{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VZJQLZLXLIBE7I2W2C5SQK3KBN","short_pith_number":"pith:VZJQLZLX","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"},"canonical_sha256":"ae5305e5775a024fa356d0bb282b6a0b4ec3100b6f466c44d25aea4880ef8a8d","source":{"kind":"arxiv","id":"2301.01323","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.01323","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"2301.01323v2","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01323","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"VZJQLZLXLIBE","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"pith_short_16","alias_value":"VZJQLZLXLIBE7I2W","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"pith_short_8","alias_value":"VZJQLZLX","created_at":"2026-07-05T06:51:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VZJQLZLXLIBE7I2W2C5SQK3KBN","target":"record","payload":{"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"},"canonical_sha256":"ae5305e5775a024fa356d0bb282b6a0b4ec3100b6f466c44d25aea4880ef8a8d","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"},"source_kind":"arxiv","source_id":"2301.01323","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SzBgUiA1g8naFUX4Sno+XH2C8V1yNJPiTgONKcJaMg+fjoer1r7aVDEnT01a08AKumcxPeUeqNYTjh92eKKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T00:14:35.692524Z"},"content_sha256":"1bf83758d088e9fff202af268d75c18a86a06bf0be3b60ee658f0dc8000e58ad","schema_version":"1.0","event_id":"sha256:1bf83758d088e9fff202af268d75c18a86a06bf0be3b60ee658f0dc8000e58ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VZJQLZLXLIBE7I2W2C5SQK3KBN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYZY8yjzbsQWTiXTGGn+eLrFOEdXUKoZDrjb5Gf7H9Bq4C8UweBjZtvLbSDb5FKeGlOIcIDS9pDAgRQH2AjPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T00:14:35.693162Z"},"content_sha256":"61366d44daea192b70112f34e513ddb93197812d968b735f8f2200f11b693cec","schema_version":"1.0","event_id":"sha256:61366d44daea192b70112f34e513ddb93197812d968b735f8f2200f11b693cec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/bundle.json","state_url":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T00:14:35Z","links":{"resolver":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN","bundle":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/bundle.json","state":"https://pith.science/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZJQLZLXLIBE7I2W2C5SQK3KBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VZJQLZLXLIBE7I2W2C5SQK3KBN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b8f10ee5ad20596d7a504d37fa714d357b1c9e99bb999661207caa2e32274354","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-01-03T19:26:15Z","title_canon_sha256":"6540cfcb03916cc87849a39af4ef1511e9decdfce265f49a8c075d4bcd73e414"},"schema_version":"1.0","source":{"id":"2301.01323","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.01323","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"2301.01323v2","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01323","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"VZJQLZLXLIBE","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"pith_short_16","alias_value":"VZJQLZLXLIBE7I2W","created_at":"2026-07-05T06:51:48Z"},{"alias_kind":"pith_short_8","alias_value":"VZJQLZLX","created_at":"2026-07-05T06:51:48Z"}],"graph_snapshots":[{"event_id":"sha256:61366d44daea192b70112f34e513ddb93197812d968b735f8f2200f11b693cec","target":"graph","created_at":"2026-07-05T06:51:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.01323/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-01-03T19:26:15Z","title":"Graphical House Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01323","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1bf83758d088e9fff202af268d75c18a86a06bf0be3b60ee658f0dc8000e58ad","target":"record","created_at":"2026-07-05T06:51:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b8f10ee5ad20596d7a504d37fa714d357b1c9e99bb999661207caa2e32274354","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-01-03T19:26:15Z","title_canon_sha256":"6540cfcb03916cc87849a39af4ef1511e9decdfce265f49a8c075d4bcd73e414"},"schema_version":"1.0","source":{"id":"2301.01323","kind":"arxiv","version":2}},"canonical_sha256":"ae5305e5775a024fa356d0bb282b6a0b4ec3100b6f466c44d25aea4880ef8a8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae5305e5775a024fa356d0bb282b6a0b4ec3100b6f466c44d25aea4880ef8a8d","first_computed_at":"2026-07-05T06:51:48.060964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:51:48.060964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5qM1TJjl6plnvnsqdlI2h8pJmQ8LC9xxjEzwufAH75PxK61sKZsvpKJYCaYhC+Dxj1MPcMQMh3/N6wU3plNjDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:51:48.061371Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.01323","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bf83758d088e9fff202af268d75c18a86a06bf0be3b60ee658f0dc8000e58ad","sha256:61366d44daea192b70112f34e513ddb93197812d968b735f8f2200f11b693cec"],"state_sha256":"414bcaffa7d2f76bccbcdc6b37afc82f8eea64090809b8d800aa4313b6d418fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7AO/95OpTgmbtEa/wronWYSBEW1Ev0zvoF7zH5yG6BuBMMFyrc85NM+Rg27swGhkKS46VZsP5Fp3pmJiKAfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T00:14:35.697492Z","bundle_sha256":"703ba132811968117350dfb3b3f64bf9e790429e75fbeeebf2461df0a9375e3c"}}