{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AIMFBJDFBHGEUQYSCI6YDNBITT","short_pith_number":"pith:AIMFBJDF","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"},"canonical_sha256":"021850a46509cc4a4312123d81b4289ce90f3a81614fae58b85d7b9248841932","source":{"kind":"arxiv","id":"1707.02033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02033","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02033v1","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02033","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"AIMFBJDFBHGE","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIMFBJDFBHGEUQYS","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIMFBJDF","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AIMFBJDFBHGEUQYSCI6YDNBITT","target":"record","payload":{"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"},"canonical_sha256":"021850a46509cc4a4312123d81b4289ce90f3a81614fae58b85d7b9248841932","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"},"source_kind":"arxiv","source_id":"1707.02033","source_version":1,"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-05-18T00:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kHtMjRGafhCXQ3DqGboNn+IqzoqXC66Ej7YwUt80WX6X0hKi/0DqPYiATCSllG30oMAxwPaei8ZNSwYuw8bDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:56:40.308672Z"},"content_sha256":"d3562bc4c644700edaa9d6f68359a3efd17ec943530f45b35d7999a36062b0aa","schema_version":"1.0","event_id":"sha256:d3562bc4c644700edaa9d6f68359a3efd17ec943530f45b35d7999a36062b0aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AIMFBJDFBHGEUQYSCI6YDNBITT","target":"graph","payload":{"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"},"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-05-18T00:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnLlSTQ5au4QpC7tvQXc1QPl/nVIX0NTepQ+TbM9Id3EV9Ajq8RNsdgVEA31wBC8A3nRHO442w3GwsLjec17Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:56:40.309248Z"},"content_sha256":"01d931803c6cfc2b281a717fb3cb315cba0f20c2661f0f6eb903da9131e7f52f","schema_version":"1.0","event_id":"sha256:01d931803c6cfc2b281a717fb3cb315cba0f20c2661f0f6eb903da9131e7f52f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/bundle.json","state_url":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/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-05-26T05:56:40Z","links":{"resolver":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT","bundle":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/bundle.json","state":"https://pith.science/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIMFBJDFBHGEUQYSCI6YDNBITT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AIMFBJDFBHGEUQYSCI6YDNBITT","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":"3ee1e04df36e42a69239cde0549950f2e7f89a29830e5d312d6dbe593f8b030c","cross_cats_sorted":["cs.AI","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-07T04:31:33Z","title_canon_sha256":"1a7538ded50da261f667b077578a1e015f16da6c934bd0a292ce020fd8ce9a1e"},"schema_version":"1.0","source":{"id":"1707.02033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02033","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02033v1","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02033","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"AIMFBJDFBHGE","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIMFBJDFBHGEUQYS","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIMFBJDF","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:01d931803c6cfc2b281a717fb3cb315cba0f20c2661f0f6eb903da9131e7f52f","target":"graph","created_at":"2026-05-18T00:40:45Z","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"},"paper":{"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","authors_text":"Shengyu Zhang, Xiaohui Bei, Youming Qiao","cross_cats":["cs.AI","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-07T04:31:33Z","title":"Networked Fairness in Cake Cutting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02033","kind":"arxiv","version":1},"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:d3562bc4c644700edaa9d6f68359a3efd17ec943530f45b35d7999a36062b0aa","target":"record","created_at":"2026-05-18T00:40:45Z","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":"3ee1e04df36e42a69239cde0549950f2e7f89a29830e5d312d6dbe593f8b030c","cross_cats_sorted":["cs.AI","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-07T04:31:33Z","title_canon_sha256":"1a7538ded50da261f667b077578a1e015f16da6c934bd0a292ce020fd8ce9a1e"},"schema_version":"1.0","source":{"id":"1707.02033","kind":"arxiv","version":1}},"canonical_sha256":"021850a46509cc4a4312123d81b4289ce90f3a81614fae58b85d7b9248841932","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"021850a46509cc4a4312123d81b4289ce90f3a81614fae58b85d7b9248841932","first_computed_at":"2026-05-18T00:40:45.408540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:45.408540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3bYWIVAgfA5ZF+6h3/cW7y1kuXvCCFjpfgyAU6IDmiIiPK2waVrqZIa+FAcrnZd1Pt50wBtM8jntdih2Q3tCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:45.409171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3562bc4c644700edaa9d6f68359a3efd17ec943530f45b35d7999a36062b0aa","sha256:01d931803c6cfc2b281a717fb3cb315cba0f20c2661f0f6eb903da9131e7f52f"],"state_sha256":"509be9c2ea7ef4968fd9b2738cd80a379cea5f2fdb440cec34f86b1b132db28f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zk0UtzVa5zI8VoPLjpYlPcXp5tLiX4O0E0/B81o/XWVLGIQYyDGnKOEp/Kwv3GQcArBeqTvWsUj1S/HHAoIxAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:56:40.315069Z","bundle_sha256":"ec17120ac8fd8e46b56991614ccf157e2bc1dc8b7e656fc768f371fc548805cf"}}