{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VZJQLZLXLIBE7I2W2C5SQK3KBN","short_pith_number":"pith:VZJQLZLX","schema_version":"1.0","canonical_sha256":"ae5305e5775a024fa356d0bb282b6a0b4ec3100b6f466c44d25aea4880ef8a8d","source":{"kind":"arxiv","id":"2301.01323","version":2},"attestation_state":"computed","paper":{"title":"Graphical House Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan","submitted_at":"2023-01-03T19:26:15Z","abstract_excerpt":"The classical house allocation problem involves assigning $n$ houses (or items) to $n$ agents according to their preferences. A key criterion in such problems is satisfying some fairness constraints such as envy-freeness. We consider a generalization of this problem wherein the agents are placed along the vertices of a graph (corresponding to a social network), and each agent can only experience envy towards its neighbors. Our goal is to minimize the aggregate envy among the agents as a natural fairness objective, i.e., the sum of all pairwise envy values over all edges in a social graph.\n  Wh"},"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":"2301.01323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-01-03T19:26:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6540cfcb03916cc87849a39af4ef1511e9decdfce265f49a8c075d4bcd73e414","abstract_canon_sha256":"b8f10ee5ad20596d7a504d37fa714d357b1c9e99bb999661207caa2e32274354"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:48.061371Z","signature_b64":"5qM1TJjl6plnvnsqdlI2h8pJmQ8LC9xxjEzwufAH75PxK61sKZsvpKJYCaYhC+Dxj1MPcMQMh3/N6wU3plNjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae5305e5775a024fa356d0bb282b6a0b4ec3100b6f466c44d25aea4880ef8a8d","last_reissued_at":"2026-07-05T06:51:48.060964Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:48.060964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphical House Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan","submitted_at":"2023-01-03T19:26:15Z","abstract_excerpt":"The classical house allocation problem involves assigning $n$ houses (or items) to $n$ agents according to their preferences. A key criterion in such problems is satisfying some fairness constraints such as envy-freeness. We consider a generalization of this problem wherein the agents are placed along the vertices of a graph (corresponding to a social network), and each agent can only experience envy towards its neighbors. Our goal is to minimize the aggregate envy among the agents as a natural fairness objective, i.e., the sum of all pairwise envy values over all edges in a social graph.\n  Wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01323","kind":"arxiv","version":2},"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/2301.01323/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":"2301.01323","created_at":"2026-07-05T06:51:48.061021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.01323v2","created_at":"2026-07-05T06:51:48.061021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01323","created_at":"2026-07-05T06:51:48.061021+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZJQLZLXLIBE","created_at":"2026-07-05T06:51:48.061021+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZJQLZLXLIBE7I2W","created_at":"2026-07-05T06:51:48.061021+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZJQLZLX","created_at":"2026-07-05T06:51:48.061021+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/VZJQLZLXLIBE7I2W2C5SQK3KBN","json":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN.json","graph_json":"https://pith.science/api/pith-number/VZJQLZLXLIBE7I2W2C5SQK3KBN/graph.json","events_json":"https://pith.science/api/pith-number/VZJQLZLXLIBE7I2W2C5SQK3KBN/events.json","paper":"https://pith.science/paper/VZJQLZLX"},"agent_actions":{"view_html":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN","download_json":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN.json","view_paper":"https://pith.science/paper/VZJQLZLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.01323&json=true","fetch_graph":"https://pith.science/api/pith-number/VZJQLZLXLIBE7I2W2C5SQK3KBN/graph.json","fetch_events":"https://pith.science/api/pith-number/VZJQLZLXLIBE7I2W2C5SQK3KBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/action/storage_attestation","attest_author":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/action/author_attestation","sign_citation":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/action/citation_signature","submit_replication":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/action/replication_record"}},"created_at":"2026-07-05T06:51:48.061021+00:00","updated_at":"2026-07-05T06:51:48.061021+00:00"}