Agency Commercial
Review supplied stakeholder pairwise choices
Review supplied client stakeholder comparisons of proposed automation or creative directions when pairwise winners can cycle.
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.
Review supplied stakeholder pairwise choices
Review supplied client stakeholder comparisons of proposed automation or creative directions when pairwise winners can cycle.
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"
}Review supplied stakeholder pairwise choices · 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\"]},\"candidateIds\":{\"type\":\"array\",\"items\":{\"type\":\"string\",\"maxLength\":128},\"maxItems\":10},\"comparisons\":{\"type\":\"array\",\"items\":{\"type\":\"object\",\"properties\":{\"leftId\":{\"type\":\"string\",\"maxLength\":128},\"rightId\":{\"type\":\"string\",\"maxLength\":128},\"leftVotes\":{\"type\":\"integer\",\"minimum\":0,\"maximum\":1000000},\"rightVotes\":{\"type\":\"integer\",\"minimum\":0,\"maximum\":1000000}},\"required\":[\"leftId\",\"rightId\",\"leftVotes\",\"rightVotes\"],\"additionalProperties\":false},\"maxItems\":45}},\"required\":[\"scopeId\",\"selectionComplete\",\"candidateIds\",\"comparisons\"],\"additionalProperties\":false},context.input,\"input\");\nconst result=(function pairwise(x){\n id(x.scopeId);unique(x.candidateIds.map(id),'duplicate_candidate_id');const names=[...x.candidateIds].sort(),indices=new Map(names.map((n,i)=>[n,i])),n=names.length,reach=names.map(()=>names.map(()=>false)),pairs=new Set(),ties=[];\n for(const c of x.comparisons){id(c.leftId);id(c.rightId);if(c.leftId===c.rightId||!indices.has(c.leftId)||!indices.has(c.rightId))fail('invalid_comparison_reference');const key=JSON.stringify([c.leftId,c.rightId].sort());if(pairs.has(key))fail('duplicate_comparison');pairs.add(key);const a=indices.get(c.leftId),b=indices.get(c.rightId);if(c.leftVotes>c.rightVotes)reach[a][b]=true;else if(c.rightVotes>c.leftVotes)reach[b][a]=true;else {const ids=[c.leftId,c.rightId].sort();ties.push({leftId:ids[0],rightId:ids[1]});}}\n const direct=reach.map(r=>[...r]);for(let k=0;k<n;k++)for(let i=0;i<n;i++)for(let j=0;j<n;j++)reach[i][j]=reach[i][j]||reach[i][k]&&reach[k][j];\n const cycles=names.filter((_,i)=>reach[i][i]),tiedPairs=ties.sort((a,b)=>lexIds([a.leftId,a.rightId],[b.leftId,b.rightId]));\n if(x.selectionComplete!==true)return {status:'unknown_selection',winnerIds:[],cycleCandidateIds:cycles,tiedPairs};\n if(pairs.size!==n*(n-1)/2)return {status:'incomplete_comparisons',winnerIds:[],cycleCandidateIds:cycles,tiedPairs};\n if(!n)return {status:'empty_supplied_candidates',winnerIds:[],cycleCandidateIds:[],tiedPairs};\n const winners=names.filter((_,i)=>names.every((__,j)=>i===j||direct[i][j]));\n return {status:winners.length?'pairwise_winner':cycles.length?'cycle_without_pairwise_winner':'no_strict_winner',winnerIds:winners,cycleCandidateIds:cycles,tiedPairs};\n})(context.input);\ncheck({\"type\":\"object\",\"properties\":{\"status\":{\"type\":\"string\",\"maxLength\":128},\"winnerIds\":{\"type\":\"array\",\"items\":{\"type\":\"string\",\"maxLength\":128},\"maxItems\":100},\"cycleCandidateIds\":{\"type\":\"array\",\"items\":{\"type\":\"string\",\"maxLength\":128},\"maxItems\":100},\"tiedPairs\":{\"type\":\"array\",\"items\":{\"type\":\"object\",\"properties\":{\"leftId\":{\"type\":\"string\",\"maxLength\":128},\"rightId\":{\"type\":\"string\",\"maxLength\":128}},\"required\":[\"leftId\",\"rightId\"],\"additionalProperties\":false},\"maxItems\":45}},\"required\":[\"status\",\"winnerIds\",\"cycleCandidateIds\",\"tiedPairs\"],\"additionalProperties\":false},result,\"output\");\nreturn result;",
"label": "Review supplied stakeholder pairwise choices",
"memoryLimit": 16,
"outputVar": "result",
"timeout": 1000
}Input and output contracts
Input
{
"type": "object",
"properties": {
"scopeId": {
"type": "string",
"maxLength": 128
},
"selectionComplete": {
"type": [
"boolean",
"null"
]
},
"candidateIds": {
"type": "array",
"items": {
"type": "string",
"maxLength": 128
},
"maxItems": 10
},
"comparisons": {
"type": "array",
"items": {
"type": "object",
"properties": {
"leftId": {
"type": "string",
"maxLength": 128
},
"rightId": {
"type": "string",
"maxLength": 128
},
"leftVotes": {
"type": "integer",
"minimum": 0,
"maximum": 1000000
},
"rightVotes": {
"type": "integer",
"minimum": 0,
"maximum": 1000000
}
},
"required": [
"leftId",
"rightId",
"leftVotes",
"rightVotes"
],
"additionalProperties": false
},
"maxItems": 45
}
},
"required": [
"scopeId",
"selectionComplete",
"candidateIds",
"comparisons"
],
"additionalProperties": false
}Output
{
"type": "object",
"properties": {
"status": {
"type": "string",
"maxLength": 128
},
"winnerIds": {
"type": "array",
"items": {
"type": "string",
"maxLength": 128
},
"maxItems": 100
},
"cycleCandidateIds": {
"type": "array",
"items": {
"type": "string",
"maxLength": 128
},
"maxItems": 100
},
"tiedPairs": {
"type": "array",
"items": {
"type": "object",
"properties": {
"leftId": {
"type": "string",
"maxLength": 128
},
"rightId": {
"type": "string",
"maxLength": 128
}
},
"required": [
"leftId",
"rightId"
],
"additionalProperties": false
},
"maxItems": 45
}
},
"required": [
"status",
"winnerIds",
"cycleCandidateIds",
"tiedPairs"
],
"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,
"candidateIds": [
"a",
"b",
"c"
],
"comparisons": [
{
"leftId": "a",
"rightId": "b",
"leftVotes": 2,
"rightVotes": 1
},
{
"leftId": "a",
"rightId": "c",
"leftVotes": 2,
"rightVotes": 1
},
{
"leftId": "b",
"rightId": "c",
"leftVotes": 2,
"rightVotes": 1
}
]
}Expected result
{
"status": "pairwise_winner",
"winnerIds": [
"a"
],
"cycleCandidateIds": [],
"tiedPairs": []
}Success means: Review supplied client stakeholder comparisons of proposed automation or creative directions when pairwise winners can cycle.
When something goes wrong
- Correct malformed facts and rerun. Incomplete or unknown facts remain uncertain; do not fabricate a resolution.
Limits and costs
- Every unordered candidate pair supplied once with directional vote counts. A winner strictly beats every other candidate in its own comparisons. A tie in one of those comparisons rules that candidate out; a tie among other options need not rule it out. Return cycle-involved IDs using directed transitive reachability; supplied counts imply no representative electorate. Three directions can each win a different head-to-head comparison. The operation requires one row per unordered pair, checks for a candidate with strict majority wins against every other candidate, and exposes candidates involved in directed preference cycles. A candidate must win every one of its own head-to-head comparisons. A tie in one of those comparisons rules that candidate out; a tie among other options need not eliminate an otherwise strict winner. Supplied vote counts establish neither consent nor representative client opinion.
- 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.