{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VGJI47GWEWTQRKHEYKKIIRXIKB","short_pith_number":"pith:VGJI47GW","schema_version":"1.0","canonical_sha256":"a9928e7cd625a708a8e4c2948446e850490b7f5424f254eb63de3edd0e701849","source":{"kind":"arxiv","id":"1509.07533","version":2},"attestation_state":"computed","paper":{"title":"Graph games and the pizza problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel E. Brown, Lawrence G. Brown","submitted_at":"2015-09-24T20:49:39Z","abstract_excerpt":"We propose a class of two person perfect information games based on weighted graphs. One of these games can be described in terms of a round pizza which is cut radially into pieces of varying size. The two players alternately take pieces subject to the following rule: Once the first piece has been chosen, all subsequent selections must be adjacent to the hole left by the previously taken pieces. Each player tries to get as much pizza as possible. The original pizza problem was to settle the conjecture that Player One can always get at least half of the pizza. The conjecture turned out to be fa"},"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":"1509.07533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-24T20:49:39Z","cross_cats_sorted":[],"title_canon_sha256":"19e913113a65810d79656caaa03be809fe88c1cc7a89be82565574d37629a477","abstract_canon_sha256":"0ebd0f1364afe948f42e789893c96f678b902daad1f510911b44854191cdd17d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:15.988339Z","signature_b64":"pHlPQQPTRvkK6t4PybKOWyVN2SimxjiX5itDC3erta3MRck44vvPi7i/vESLp01m/vMdTfZbrKJACUzRvpvbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9928e7cd625a708a8e4c2948446e850490b7f5424f254eb63de3edd0e701849","last_reissued_at":"2026-05-18T01:27:15.987646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:15.987646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph games and the pizza problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel E. Brown, Lawrence G. Brown","submitted_at":"2015-09-24T20:49:39Z","abstract_excerpt":"We propose a class of two person perfect information games based on weighted graphs. One of these games can be described in terms of a round pizza which is cut radially into pieces of varying size. The two players alternately take pieces subject to the following rule: Once the first piece has been chosen, all subsequent selections must be adjacent to the hole left by the previously taken pieces. Each player tries to get as much pizza as possible. The original pizza problem was to settle the conjecture that Player One can always get at least half of the pizza. The conjecture turned out to be fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07533","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":""},"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":"1509.07533","created_at":"2026-05-18T01:27:15.987751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07533v2","created_at":"2026-05-18T01:27:15.987751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07533","created_at":"2026-05-18T01:27:15.987751+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGJI47GWEWTQ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGJI47GWEWTQRKHE","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGJI47GW","created_at":"2026-05-18T12:29:44.643036+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/VGJI47GWEWTQRKHEYKKIIRXIKB","json":"https://pith.science/pith/VGJI47GWEWTQRKHEYKKIIRXIKB.json","graph_json":"https://pith.science/api/pith-number/VGJI47GWEWTQRKHEYKKIIRXIKB/graph.json","events_json":"https://pith.science/api/pith-number/VGJI47GWEWTQRKHEYKKIIRXIKB/events.json","paper":"https://pith.science/paper/VGJI47GW"},"agent_actions":{"view_html":"https://pith.science/pith/VGJI47GWEWTQRKHEYKKIIRXIKB","download_json":"https://pith.science/pith/VGJI47GWEWTQRKHEYKKIIRXIKB.json","view_paper":"https://pith.science/paper/VGJI47GW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07533&json=true","fetch_graph":"https://pith.science/api/pith-number/VGJI47GWEWTQRKHEYKKIIRXIKB/graph.json","fetch_events":"https://pith.science/api/pith-number/VGJI47GWEWTQRKHEYKKIIRXIKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGJI47GWEWTQRKHEYKKIIRXIKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGJI47GWEWTQRKHEYKKIIRXIKB/action/storage_attestation","attest_author":"https://pith.science/pith/VGJI47GWEWTQRKHEYKKIIRXIKB/action/author_attestation","sign_citation":"https://pith.science/pith/VGJI47GWEWTQRKHEYKKIIRXIKB/action/citation_signature","submit_replication":"https://pith.science/pith/VGJI47GWEWTQRKHEYKKIIRXIKB/action/replication_record"}},"created_at":"2026-05-18T01:27:15.987751+00:00","updated_at":"2026-05-18T01:27:15.987751+00:00"}