{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6ROVBCV32W64ZJE42KDRXAJ22U","short_pith_number":"pith:6ROVBCV3","schema_version":"1.0","canonical_sha256":"f45d508abbd5bdcca49cd2871b813ad523a9ebc291109298354d493b6ba091f7","source":{"kind":"arxiv","id":"1811.10859","version":1},"attestation_state":"computed","paper":{"title":"Fair Division with a Secretive Agent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eshwar Ram Arunachaleswaran, Nidhi Rathi, Siddharth Barman","submitted_at":"2018-11-27T08:02:00Z","abstract_excerpt":"We study classic fair-division problems in a partial information setting. This paper respectively addresses fair division of rent, cake, and indivisible goods among agents with cardinal preferences. We will show that, for all of these settings and under appropriate valuations, a fair (or an approximately fair) division among n agents can be efficiently computed using only the valuations of n-1 agents. The nth (secretive) agent can make an arbitrary selection after the division has been proposed and, irrespective of her choice, the computed division will admit an overall fair allocation.\n  For "},"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":"1811.10859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-27T08:02:00Z","cross_cats_sorted":[],"title_canon_sha256":"36e5e634d689fe66cd1edbefd973c42cbec3ebe669320bc80d77e31ea495a27d","abstract_canon_sha256":"47e466d95298a6e11cbb2f7effb3ce4a7affdc4c7f455577d26498fdce3f2cab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.317131Z","signature_b64":"8b0zvFD0aLEY5DChjsBI/092ukdpHZOkRCBHpZO/3gbWOVKpJoVz481FaDIfQr2ysNYLFfeMG4V06easiGk2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f45d508abbd5bdcca49cd2871b813ad523a9ebc291109298354d493b6ba091f7","last_reissued_at":"2026-05-17T23:59:47.316716Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.316716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Division with a Secretive Agent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eshwar Ram Arunachaleswaran, Nidhi Rathi, Siddharth Barman","submitted_at":"2018-11-27T08:02:00Z","abstract_excerpt":"We study classic fair-division problems in a partial information setting. This paper respectively addresses fair division of rent, cake, and indivisible goods among agents with cardinal preferences. We will show that, for all of these settings and under appropriate valuations, a fair (or an approximately fair) division among n agents can be efficiently computed using only the valuations of n-1 agents. The nth (secretive) agent can make an arbitrary selection after the division has been proposed and, irrespective of her choice, the computed division will admit an overall fair allocation.\n  For "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10859","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":""},"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":"1811.10859","created_at":"2026-05-17T23:59:47.316776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10859v1","created_at":"2026-05-17T23:59:47.316776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10859","created_at":"2026-05-17T23:59:47.316776+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ROVBCV32W64","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ROVBCV32W64ZJE4","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ROVBCV3","created_at":"2026-05-18T12:32:11.075285+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/6ROVBCV32W64ZJE42KDRXAJ22U","json":"https://pith.science/pith/6ROVBCV32W64ZJE42KDRXAJ22U.json","graph_json":"https://pith.science/api/pith-number/6ROVBCV32W64ZJE42KDRXAJ22U/graph.json","events_json":"https://pith.science/api/pith-number/6ROVBCV32W64ZJE42KDRXAJ22U/events.json","paper":"https://pith.science/paper/6ROVBCV3"},"agent_actions":{"view_html":"https://pith.science/pith/6ROVBCV32W64ZJE42KDRXAJ22U","download_json":"https://pith.science/pith/6ROVBCV32W64ZJE42KDRXAJ22U.json","view_paper":"https://pith.science/paper/6ROVBCV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10859&json=true","fetch_graph":"https://pith.science/api/pith-number/6ROVBCV32W64ZJE42KDRXAJ22U/graph.json","fetch_events":"https://pith.science/api/pith-number/6ROVBCV32W64ZJE42KDRXAJ22U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ROVBCV32W64ZJE42KDRXAJ22U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ROVBCV32W64ZJE42KDRXAJ22U/action/storage_attestation","attest_author":"https://pith.science/pith/6ROVBCV32W64ZJE42KDRXAJ22U/action/author_attestation","sign_citation":"https://pith.science/pith/6ROVBCV32W64ZJE42KDRXAJ22U/action/citation_signature","submit_replication":"https://pith.science/pith/6ROVBCV32W64ZJE42KDRXAJ22U/action/replication_record"}},"created_at":"2026-05-17T23:59:47.316776+00:00","updated_at":"2026-05-17T23:59:47.316776+00:00"}