{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AIMFBJDFBHGEUQYSCI6YDNBITT","short_pith_number":"pith:AIMFBJDF","schema_version":"1.0","canonical_sha256":"021850a46509cc4a4312123d81b4289ce90f3a81614fae58b85d7b9248841932","source":{"kind":"arxiv","id":"1707.02033","version":1},"attestation_state":"computed","paper":{"title":"Networked Fairness in Cake Cutting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.DS","authors_text":"Shengyu Zhang, Xiaohui Bei, Youming Qiao","submitted_at":"2017-07-07T04:31:33Z","abstract_excerpt":"We introduce a graphical framework for fair division in cake cutting, where comparisons between agents are limited by an underlying network structure. We generalize the classical fairness notions of envy-freeness and proportionality to this graphical setting. Given a simple undirected graph G, an allocation is envy-free on G if no agent envies any of her neighbor's share, and is proportional on G if every agent values her own share no less than the average among her neighbors, with respect to her own measure. These generalizations open new research directions in developing simple and efficient"},"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":"1707.02033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-07T04:31:33Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"1a7538ded50da261f667b077578a1e015f16da6c934bd0a292ce020fd8ce9a1e","abstract_canon_sha256":"3ee1e04df36e42a69239cde0549950f2e7f89a29830e5d312d6dbe593f8b030c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:45.409171Z","signature_b64":"3bYWIVAgfA5ZF+6h3/cW7y1kuXvCCFjpfgyAU6IDmiIiPK2waVrqZIa+FAcrnZd1Pt50wBtM8jntdih2Q3tCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"021850a46509cc4a4312123d81b4289ce90f3a81614fae58b85d7b9248841932","last_reissued_at":"2026-05-18T00:40:45.408540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:45.408540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Networked Fairness in Cake Cutting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.DS","authors_text":"Shengyu Zhang, Xiaohui Bei, Youming Qiao","submitted_at":"2017-07-07T04:31:33Z","abstract_excerpt":"We introduce a graphical framework for fair division in cake cutting, where comparisons between agents are limited by an underlying network structure. We generalize the classical fairness notions of envy-freeness and proportionality to this graphical setting. Given a simple undirected graph G, an allocation is envy-free on G if no agent envies any of her neighbor's share, and is proportional on G if every agent values her own share no less than the average among her neighbors, with respect to her own measure. These generalizations open new research directions in developing simple and efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02033","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":"1707.02033","created_at":"2026-05-18T00:40:45.408624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02033v1","created_at":"2026-05-18T00:40:45.408624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02033","created_at":"2026-05-18T00:40:45.408624+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIMFBJDFBHGE","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIMFBJDFBHGEUQYS","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIMFBJDF","created_at":"2026-05-18T12:31:05.417338+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/AIMFBJDFBHGEUQYSCI6YDNBITT","json":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT.json","graph_json":"https://pith.science/api/pith-number/AIMFBJDFBHGEUQYSCI6YDNBITT/graph.json","events_json":"https://pith.science/api/pith-number/AIMFBJDFBHGEUQYSCI6YDNBITT/events.json","paper":"https://pith.science/paper/AIMFBJDF"},"agent_actions":{"view_html":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT","download_json":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT.json","view_paper":"https://pith.science/paper/AIMFBJDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02033&json=true","fetch_graph":"https://pith.science/api/pith-number/AIMFBJDFBHGEUQYSCI6YDNBITT/graph.json","fetch_events":"https://pith.science/api/pith-number/AIMFBJDFBHGEUQYSCI6YDNBITT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/action/storage_attestation","attest_author":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/action/author_attestation","sign_citation":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/action/citation_signature","submit_replication":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/action/replication_record"}},"created_at":"2026-05-18T00:40:45.408624+00:00","updated_at":"2026-05-18T00:40:45.408624+00:00"}