{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WJEMSBLCUUK2YLZCW23S7S2ICM","short_pith_number":"pith:WJEMSBLC","schema_version":"1.0","canonical_sha256":"b248c90562a515ac2f22b6b72fcb48131844ca541b3cfda66c92a70b56c72986","source":{"kind":"arxiv","id":"2211.06458","version":1},"attestation_state":"computed","paper":{"title":"A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ganesh Ghalme, Nidhi Rathi, Xin Huang, Yuka Machino","submitted_at":"2022-11-04T17:33:13Z","abstract_excerpt":"We study the classic problem of \\emph{fairly} dividing a heterogeneous and divisible resource -- modeled as a line segment $[0,1]$ and typically called as a \\emph{cake} -- among $n$ agents. This work considers an interesting variant of the problem where agents are embedded on a graph. The graphical constraint entails that each agent evaluates her allocated share only against her neighbors' share. Given a graph, the goal is to efficiently find a \\emph{locally envy-free} allocation where every agent values her share of the cake to be at least as much as that of any of her neighbors' share.\n  The"},"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":"2211.06458","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2022-11-04T17:33:13Z","cross_cats_sorted":[],"title_canon_sha256":"eadaf87b79629bc97e07dd92b35e338042358c5f5fd6abf79e46271371fbb86d","abstract_canon_sha256":"8031ad8ceae346c68b9a0ac76c7921439738c675039872bc1aab7251bc4ff92d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:15:25.359394Z","signature_b64":"0/qFkw+39Y+guGU82pKP3ftTxHRsjTdC2A+lfjo+Btf/6L+Fz7UFneWVo6xna299MRJMKxr8EXrLQrWRyCMsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b248c90562a515ac2f22b6b72fcb48131844ca541b3cfda66c92a70b56c72986","last_reissued_at":"2026-07-05T05:15:25.358991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:15:25.358991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ganesh Ghalme, Nidhi Rathi, Xin Huang, Yuka Machino","submitted_at":"2022-11-04T17:33:13Z","abstract_excerpt":"We study the classic problem of \\emph{fairly} dividing a heterogeneous and divisible resource -- modeled as a line segment $[0,1]$ and typically called as a \\emph{cake} -- among $n$ agents. This work considers an interesting variant of the problem where agents are embedded on a graph. The graphical constraint entails that each agent evaluates her allocated share only against her neighbors' share. Given a graph, the goal is to efficiently find a \\emph{locally envy-free} allocation where every agent values her share of the cake to be at least as much as that of any of her neighbors' share.\n  The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06458","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.06458/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":"2211.06458","created_at":"2026-07-05T05:15:25.359046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.06458v1","created_at":"2026-07-05T05:15:25.359046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06458","created_at":"2026-07-05T05:15:25.359046+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJEMSBLCUUK2","created_at":"2026-07-05T05:15:25.359046+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJEMSBLCUUK2YLZC","created_at":"2026-07-05T05:15:25.359046+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJEMSBLC","created_at":"2026-07-05T05:15:25.359046+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/WJEMSBLCUUK2YLZCW23S7S2ICM","json":"https://pith.science/pith/WJEMSBLCUUK2YLZCW23S7S2ICM.json","graph_json":"https://pith.science/api/pith-number/WJEMSBLCUUK2YLZCW23S7S2ICM/graph.json","events_json":"https://pith.science/api/pith-number/WJEMSBLCUUK2YLZCW23S7S2ICM/events.json","paper":"https://pith.science/paper/WJEMSBLC"},"agent_actions":{"view_html":"https://pith.science/pith/WJEMSBLCUUK2YLZCW23S7S2ICM","download_json":"https://pith.science/pith/WJEMSBLCUUK2YLZCW23S7S2ICM.json","view_paper":"https://pith.science/paper/WJEMSBLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.06458&json=true","fetch_graph":"https://pith.science/api/pith-number/WJEMSBLCUUK2YLZCW23S7S2ICM/graph.json","fetch_events":"https://pith.science/api/pith-number/WJEMSBLCUUK2YLZCW23S7S2ICM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJEMSBLCUUK2YLZCW23S7S2ICM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJEMSBLCUUK2YLZCW23S7S2ICM/action/storage_attestation","attest_author":"https://pith.science/pith/WJEMSBLCUUK2YLZCW23S7S2ICM/action/author_attestation","sign_citation":"https://pith.science/pith/WJEMSBLCUUK2YLZCW23S7S2ICM/action/citation_signature","submit_replication":"https://pith.science/pith/WJEMSBLCUUK2YLZCW23S7S2ICM/action/replication_record"}},"created_at":"2026-07-05T05:15:25.359046+00:00","updated_at":"2026-07-05T05:15:25.359046+00:00"}