{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:35UOCU6KJIJSELBZZDHUHA2F6U","short_pith_number":"pith:35UOCU6K","schema_version":"1.0","canonical_sha256":"df68e153ca4a13222c39c8cf438345f5361307c33978540f0c7f1b1d683cea40","source":{"kind":"arxiv","id":"2508.13856","version":1},"attestation_state":"computed","paper":{"title":"The Multi-Stage Assignment Problem: A Fairness Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.MA","authors_text":"Shweta Jain, Swapnil Dhamal, Vibulan J","submitted_at":"2025-08-19T14:17:25Z","abstract_excerpt":"This paper explores the problem of fair assignment on Multi-Stage graphs. A multi-stage graph consists of nodes partitioned into $K$ disjoint sets (stages) structured as a sequence of weighted bipartite graphs formed across adjacent stages. The goal is to assign node-disjoint paths to $n$ agents starting from the first stage and ending in the last stage. We show that an efficient assignment that minimizes the overall sum of costs of all the agents' paths may be highly unfair and lead to significant cost disparities (envy) among the agents. We further show that finding an envy-minimizing assign"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.13856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2025-08-19T14:17:25Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"3c9a54d1fa0e13b9e915bfe55a32dd75c184662c7bd2235a767ff9c4ef9bd482","abstract_canon_sha256":"bd2375c2b50b6cf8dfa9685bcf74bec406349ead448be089c1f4b3d1ae1c69ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:08.746765Z","signature_b64":"drnuS944sdJ4CwrgKCr8dGEIS666T0TlrBGb3sxuyI2j3G1ifYqRGqECSxvCCNoRLTF0J0IufIByGD+Wa9q9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df68e153ca4a13222c39c8cf438345f5361307c33978540f0c7f1b1d683cea40","last_reissued_at":"2026-07-05T11:56:08.746401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:08.746401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Multi-Stage Assignment Problem: A Fairness Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.MA","authors_text":"Shweta Jain, Swapnil Dhamal, Vibulan J","submitted_at":"2025-08-19T14:17:25Z","abstract_excerpt":"This paper explores the problem of fair assignment on Multi-Stage graphs. A multi-stage graph consists of nodes partitioned into $K$ disjoint sets (stages) structured as a sequence of weighted bipartite graphs formed across adjacent stages. The goal is to assign node-disjoint paths to $n$ agents starting from the first stage and ending in the last stage. We show that an efficient assignment that minimizes the overall sum of costs of all the agents' paths may be highly unfair and lead to significant cost disparities (envy) among the agents. We further show that finding an envy-minimizing assign"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.13856","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.13856/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.13856","created_at":"2026-07-05T11:56:08.746462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.13856v1","created_at":"2026-07-05T11:56:08.746462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13856","created_at":"2026-07-05T11:56:08.746462+00:00"},{"alias_kind":"pith_short_12","alias_value":"35UOCU6KJIJS","created_at":"2026-07-05T11:56:08.746462+00:00"},{"alias_kind":"pith_short_16","alias_value":"35UOCU6KJIJSELBZ","created_at":"2026-07-05T11:56:08.746462+00:00"},{"alias_kind":"pith_short_8","alias_value":"35UOCU6K","created_at":"2026-07-05T11:56:08.746462+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/35UOCU6KJIJSELBZZDHUHA2F6U","json":"https://pith.science/pith/35UOCU6KJIJSELBZZDHUHA2F6U.json","graph_json":"https://pith.science/api/pith-number/35UOCU6KJIJSELBZZDHUHA2F6U/graph.json","events_json":"https://pith.science/api/pith-number/35UOCU6KJIJSELBZZDHUHA2F6U/events.json","paper":"https://pith.science/paper/35UOCU6K"},"agent_actions":{"view_html":"https://pith.science/pith/35UOCU6KJIJSELBZZDHUHA2F6U","download_json":"https://pith.science/pith/35UOCU6KJIJSELBZZDHUHA2F6U.json","view_paper":"https://pith.science/paper/35UOCU6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.13856&json=true","fetch_graph":"https://pith.science/api/pith-number/35UOCU6KJIJSELBZZDHUHA2F6U/graph.json","fetch_events":"https://pith.science/api/pith-number/35UOCU6KJIJSELBZZDHUHA2F6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35UOCU6KJIJSELBZZDHUHA2F6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35UOCU6KJIJSELBZZDHUHA2F6U/action/storage_attestation","attest_author":"https://pith.science/pith/35UOCU6KJIJSELBZZDHUHA2F6U/action/author_attestation","sign_citation":"https://pith.science/pith/35UOCU6KJIJSELBZZDHUHA2F6U/action/citation_signature","submit_replication":"https://pith.science/pith/35UOCU6KJIJSELBZZDHUHA2F6U/action/replication_record"}},"created_at":"2026-07-05T11:56:08.746462+00:00","updated_at":"2026-07-05T11:56:08.746462+00:00"}