Client Reporting
Bound aggregate audience union without membership data
Report defensible unique-audience count bounds from supplied audience cardinalities when no membership intersections were provided.
Experimental native example · local preview · revision 1
WORKFLOW PREVIEW
See how it works
Use + and − to zoom, F to fit. Press Enter on a node to inspect it.
Private preview. These tested drafts are available for inspection. Adding them to a Vora workspace is still being tested.
What you need
- Authorized supplied facts matching the closed contract.
- Declared completeness, identity and unit assumptions reviewed by an agency operator.
Follow the workflow step by step
Supplied agency data
Receive the explicitly supplied manual input packet.
Bound aggregate audience union without membership data
Report defensible unique-audience count bounds from supplied audience cardinalities when no membership intersections were provided.
Setup and review
- Download the workflow JSON from this page and inspect its inputs schema and Code node.
- Prepare a synthetic packet matching the input schema. Keep unknown values explicit and report completeness honestly.
- Review the on-page literal example before running your own supplied-data case.
- Inspect every unknown, tie, missing reference or bounded status before taking a downstream action.
Inspect every node
Expand a node to inspect its complete settings. Review the runtime and adoption evidence before installing it.
Supplied agency data · wfManualTrigger
{
"label": "Supplied agency data"
}Bound aggregate audience union without membership data · code
{
"code": "\nfunction fail(reason){throw new Error('input: '+reason);}\nfunction check(schema,value,where){\n if(value===null){if(schema.type==='null'||Array.isArray(schema.type)&&schema.type.includes('null'))return;fail(where+' wrong_type');}\n const type=Array.isArray(schema.type)?schema.type[0]:schema.type;\n if(type==='object'){\n if(!value||typeof value!=='object'||Array.isArray(value))fail(where+' wrong_type');\n for(const name of Object.keys(value))if(!Object.hasOwn(schema.properties,name))fail(where+' unknown_field');\n for(const name of schema.required)if(!Object.hasOwn(value,name))fail(where+' missing_field');\n for(const [name,shape]of Object.entries(schema.properties))check(shape,value[name],where+'.'+name);\n }else if(type==='array'){\n if(!Array.isArray(value)||value.length>schema.maxItems)fail(where+' array_bound');\n for(const item of value)check(schema.items,item,where+'[]');\n }else if(type==='string'){if(typeof value!=='string'||value.length>schema.maxLength)fail(where+' string_bound');}\n else if(type==='integer'){if(!Number.isSafeInteger(value)||value<schema.minimum||value>schema.maximum)fail(where+' integer_bound');}\n else if(type==='boolean'){if(typeof value!=='boolean')fail(where+' wrong_type');}\n else fail(where+' unsupported_type');\n}\nfunction id(value){if(typeof value!=='string'||!value||value.trim()!==value)fail('noncanonical_identity');return value;}\nfunction unique(values,reason){if(new Set(values).size!==values.length)fail(reason);}\nfunction safeAdd(a,b){if(a>Number.MAX_SAFE_INTEGER-b)fail('unsafe_sum');return a+b;}\nfunction day(value){if(!/^\\d{4}-\\d{2}-\\d{2}$/.test(value))fail('invalid_calendar_day');const ms=Date.parse(value+'T00:00:00Z');if(!Number.isFinite(ms)||new Date(ms).toISOString().slice(0,10)!==value)fail('invalid_calendar_day');return ms;}\nfunction refKey(ref){id(ref.assetId);if(ref.version<1)fail('positive_version_required');return JSON.stringify([ref.assetId,ref.version]);}\nfunction refValue(key){const pair=JSON.parse(key);return {assetId:pair[0],version:pair[1]};}\nfunction sortedRefs(keys){return [...keys].sort().map(refValue);}\n\nfunction lexIds(a,b){for(let i=0;i<Math.min(a.length,b.length);i++){if(a[i]<b[i])return -1;if(a[i]>b[i])return 1;}return a.length-b.length;}\nfunction maxSubset(rows,idField,feasible){let best=-1,ids=[],ties=0;for(let mask=0;mask<2**rows.length;mask++){const chosen=rows.filter((_,i)=>mask&(1<<i));if(!feasible(chosen))continue;const value=chosen.reduce((n,r)=>n+r.valuePoints,0),current=chosen.map(r=>r[idField]).sort();if(value>best){best=value;ids=current;ties=1;}else if(value===best){ties++;if(lexIds(current,ids)<0)ids=current;}}return {ids,value:best,ties};}\nfunction rat(n,d){if(d===0n)fail('zero_denominator');if(d<0n){n=-n;d=-d;}let a=n<0n?-n:n,b=d;while(b){const next=a%b;a=b;b=next;}return [n/a,d/a];}\nfunction ratAdd(a,b){return rat(a[0]*b[1]+b[0]*a[1],a[1]*b[1]);}\nfunction ratSub(a,b){return rat(a[0]*b[1]-b[0]*a[1],a[1]*b[1]);}\nfunction ratMul(a,b){return rat(a[0]*b[0],a[1]*b[1]);}\nfunction ratText(a){return a[0].toString()+'/'+a[1].toString();}\n\n\ncheck({\"type\":\"object\",\"properties\":{\"scopeId\":{\"type\":\"string\",\"maxLength\":128},\"selectionComplete\":{\"type\":[\"boolean\",\"null\"]},\"universeSize\":{\"type\":\"integer\",\"minimum\":0,\"maximum\":1000000},\"audiences\":{\"type\":\"array\",\"items\":{\"type\":\"object\",\"properties\":{\"audienceId\":{\"type\":\"string\",\"maxLength\":128},\"size\":{\"type\":[\"integer\",\"null\"],\"minimum\":0,\"maximum\":1000000}},\"required\":[\"audienceId\",\"size\"],\"additionalProperties\":false},\"maxItems\":30}},\"required\":[\"scopeId\",\"selectionComplete\",\"universeSize\",\"audiences\"],\"additionalProperties\":false},context.input,\"input\");\nconst result=(function audienceBounds(x){\n id(x.scopeId);unique(x.audiences.map(a=>id(a.audienceId)),'duplicate_audience_id');for(const a of x.audiences)if(a.size!==null&&a.size>x.universeSize)fail('audience_larger_than_universe');\n const unknown=x.audiences.filter(a=>a.size===null).map(a=>a.audienceId).sort(),known=x.audiences.filter(a=>a.size!==null),lower=known.length?Math.max(...known.map(a=>a.size)):0,upper=unknown.length?x.universeSize:Math.min(x.universeSize,known.reduce((n,a)=>n+a.size,0)),exact=lower===upper;\n return {status:x.selectionComplete!==true?'bounded_incomplete_selection':unknown.length?'bounded_unknown_cardinalities':exact?'exact_within_supplied_cardinalities':'bounded_within_supplied_cardinalities',lowerUnique:lower,upperUnique:upper,exactWithinSuppliedAudiences:exact,unknownAudienceIds:unknown};\n})(context.input);\ncheck({\"type\":\"object\",\"properties\":{\"status\":{\"type\":\"string\",\"maxLength\":128},\"lowerUnique\":{\"type\":\"integer\",\"minimum\":0,\"maximum\":1000000},\"upperUnique\":{\"type\":\"integer\",\"minimum\":0,\"maximum\":1000000},\"exactWithinSuppliedAudiences\":{\"type\":\"boolean\"},\"unknownAudienceIds\":{\"type\":\"array\",\"items\":{\"type\":\"string\",\"maxLength\":128},\"maxItems\":100}},\"required\":[\"status\",\"lowerUnique\",\"upperUnique\",\"exactWithinSuppliedAudiences\",\"unknownAudienceIds\"],\"additionalProperties\":false},result,\"output\");\nreturn result;",
"label": "Bound aggregate audience union without membership data",
"memoryLimit": 16,
"outputVar": "result",
"timeout": 1000
}Input and output contracts
Input
{
"type": "object",
"properties": {
"scopeId": {
"type": "string",
"maxLength": 128
},
"selectionComplete": {
"type": [
"boolean",
"null"
]
},
"universeSize": {
"type": "integer",
"minimum": 0,
"maximum": 1000000
},
"audiences": {
"type": "array",
"items": {
"type": "object",
"properties": {
"audienceId": {
"type": "string",
"maxLength": 128
},
"size": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 1000000
}
},
"required": [
"audienceId",
"size"
],
"additionalProperties": false
},
"maxItems": 30
}
},
"required": [
"scopeId",
"selectionComplete",
"universeSize",
"audiences"
],
"additionalProperties": false
}Output
{
"type": "object",
"properties": {
"status": {
"type": "string",
"maxLength": 128
},
"lowerUnique": {
"type": "integer",
"minimum": 0,
"maximum": 1000000
},
"upperUnique": {
"type": "integer",
"minimum": 0,
"maximum": 1000000
},
"exactWithinSuppliedAudiences": {
"type": "boolean"
},
"unknownAudienceIds": {
"type": "array",
"items": {
"type": "string",
"maxLength": 128
},
"maxItems": 100
}
},
"required": [
"status",
"lowerUnique",
"upperUnique",
"exactWithinSuppliedAudiences",
"unknownAudienceIds"
],
"additionalProperties": false
}Choose an output for this job
This business workflow also has 15 delivery formats. Compare their inputs, output examples and limits.
Example input and result
These examples use synthetic data.
Input
{
"scopeId": "client-A",
"selectionComplete": true,
"universeSize": 100,
"audiences": [
{
"audienceId": "a",
"size": 60
},
{
"audienceId": "b",
"size": 50
}
]
}Expected result
{
"status": "bounded_within_supplied_cardinalities",
"lowerUnique": 60,
"upperUnique": 100,
"exactWithinSuppliedAudiences": false,
"unknownAudienceIds": []
}Success means: Report defensible unique-audience count bounds from supplied audience cardinalities when no membership intersections were provided.
When something goes wrong
- Correct malformed facts and rerun. Incomplete or unknown facts remain uncertain; do not fabricate a resolution.
Limits and costs
- No membership or pairwise intersection is supplied. Tight cardinality bounds: largest known audience to min(universe,sum known sizes) when all sizes known; unknown size permits upper universe. Unknown selection marks incomplete and no point estimate is invented. Audience totals without member intersections cannot establish a deduplicated reach count. The union is at least the largest known audience and at most the smaller of the declared universe and the sum of known sizes when every size is known. An unknown audience size allows the upper bound to reach the universe. These bounds assume the supplied audiences share the declared universe.
- No paid model calls or metered third-party operations are declared in this pure graph. Vora plan availability, compute and quotas still apply; pricing has not been verified by this batch.