{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A7XK3DYZLOTQUNTWE5DLPFV4G7","short_pith_number":"pith:A7XK3DYZ","canonical_record":{"source":{"id":"1411.6727","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T04:38:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5c69839107e5a32fca44629a6e1498ac797ffb9014f3ca2292981ae9a4f4d59d","abstract_canon_sha256":"c7ab34b1b35e24cce6283a8f3c81dfb426eaf265d205ecffbff826366a66cb00"},"schema_version":"1.0"},"canonical_sha256":"07eead8f195ba70a36762746b796bc37dc4f49e53f5f44813fb28cfebb6231f5","source":{"kind":"arxiv","id":"1411.6727","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6727","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6727v3","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6727","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"A7XK3DYZLOTQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A7XK3DYZLOTQUNTW","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A7XK3DYZ","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A7XK3DYZLOTQUNTWE5DLPFV4G7","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6727","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T04:38:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5c69839107e5a32fca44629a6e1498ac797ffb9014f3ca2292981ae9a4f4d59d","abstract_canon_sha256":"c7ab34b1b35e24cce6283a8f3c81dfb426eaf265d205ecffbff826366a66cb00"},"schema_version":"1.0"},"canonical_sha256":"07eead8f195ba70a36762746b796bc37dc4f49e53f5f44813fb28cfebb6231f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:04.754960Z","signature_b64":"h9qpCsW9rWCc8WGMMckL3ctdUy9wU7YxN2Me8gImer1Azmx4xiBnURpohVRCqDWHEiAo97O70OkrgyitlElvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07eead8f195ba70a36762746b796bc37dc4f49e53f5f44813fb28cfebb6231f5","last_reissued_at":"2026-05-18T00:46:04.754486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:04.754486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6727","source_version":3,"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:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8Z+tB2BrfOqlO69uzSUwd8v6YHDX4/aSmkfX6DnbL2AbkBEY6h0pHvq3Goo354BD2CRXPxVyU7RkRMxscunAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:29:10.553471Z"},"content_sha256":"3d3b215d45f69bc54d0cf50a6eed8f54dc30a57db3aa897ce504dc3c35de0211","schema_version":"1.0","event_id":"sha256:3d3b215d45f69bc54d0cf50a6eed8f54dc30a57db3aa897ce504dc3c35de0211"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A7XK3DYZLOTQUNTWE5DLPFV4G7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph sharing game and the structure of weighted graphs with a forbidden subdivision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adam G\\k{a}gol, Bartosz Walczak, Piotr Micek","submitted_at":"2014-11-25T04:38:00Z","abstract_excerpt":"In the graph sharing game, two players share a connected graph $G$ with non-negative weights assigned to the vertices, claiming and collecting the vertices of $G$ one by one, while keeping the set of all claimed vertices connected through the whole game. Each player wants to maximize the total weight of the vertices they have gathered by the end of the game, when the whole $G$ has been claimed. It is proved that for any class $\\mathcal{G}$ of graphs with an odd number of vertices and with forbidden subdivision of a fixed graph (e.g., for the class $\\mathcal{G}$ of planar graphs with an odd num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6727","kind":"arxiv","version":3},"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:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9cLZ9nfUAZ/RIFsw59kvW/eHX0BGoG4tmNNfZzB2KSaWXrVxmcS4ujoqIHhoOq/t89riGmowL/FWceztaqADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:29:10.553844Z"},"content_sha256":"d12f09c12e154ae3ca4befaa08aae3b1bc29719d717830e95bde4adcf6476cac","schema_version":"1.0","event_id":"sha256:d12f09c12e154ae3ca4befaa08aae3b1bc29719d717830e95bde4adcf6476cac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7XK3DYZLOTQUNTWE5DLPFV4G7/bundle.json","state_url":"https://pith.science/pith/A7XK3DYZLOTQUNTWE5DLPFV4G7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7XK3DYZLOTQUNTWE5DLPFV4G7/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-31T17:29:10Z","links":{"resolver":"https://pith.science/pith/A7XK3DYZLOTQUNTWE5DLPFV4G7","bundle":"https://pith.science/pith/A7XK3DYZLOTQUNTWE5DLPFV4G7/bundle.json","state":"https://pith.science/pith/A7XK3DYZLOTQUNTWE5DLPFV4G7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7XK3DYZLOTQUNTWE5DLPFV4G7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A7XK3DYZLOTQUNTWE5DLPFV4G7","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":"c7ab34b1b35e24cce6283a8f3c81dfb426eaf265d205ecffbff826366a66cb00","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T04:38:00Z","title_canon_sha256":"5c69839107e5a32fca44629a6e1498ac797ffb9014f3ca2292981ae9a4f4d59d"},"schema_version":"1.0","source":{"id":"1411.6727","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6727","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6727v3","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6727","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"A7XK3DYZLOTQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A7XK3DYZLOTQUNTW","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A7XK3DYZ","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:d12f09c12e154ae3ca4befaa08aae3b1bc29719d717830e95bde4adcf6476cac","target":"graph","created_at":"2026-05-18T00:46:04Z","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":"In the graph sharing game, two players share a connected graph $G$ with non-negative weights assigned to the vertices, claiming and collecting the vertices of $G$ one by one, while keeping the set of all claimed vertices connected through the whole game. Each player wants to maximize the total weight of the vertices they have gathered by the end of the game, when the whole $G$ has been claimed. It is proved that for any class $\\mathcal{G}$ of graphs with an odd number of vertices and with forbidden subdivision of a fixed graph (e.g., for the class $\\mathcal{G}$ of planar graphs with an odd num","authors_text":"Adam G\\k{a}gol, Bartosz Walczak, Piotr Micek","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T04:38:00Z","title":"Graph sharing game and the structure of weighted graphs with a forbidden subdivision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6727","kind":"arxiv","version":3},"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:3d3b215d45f69bc54d0cf50a6eed8f54dc30a57db3aa897ce504dc3c35de0211","target":"record","created_at":"2026-05-18T00:46:04Z","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":"c7ab34b1b35e24cce6283a8f3c81dfb426eaf265d205ecffbff826366a66cb00","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T04:38:00Z","title_canon_sha256":"5c69839107e5a32fca44629a6e1498ac797ffb9014f3ca2292981ae9a4f4d59d"},"schema_version":"1.0","source":{"id":"1411.6727","kind":"arxiv","version":3}},"canonical_sha256":"07eead8f195ba70a36762746b796bc37dc4f49e53f5f44813fb28cfebb6231f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07eead8f195ba70a36762746b796bc37dc4f49e53f5f44813fb28cfebb6231f5","first_computed_at":"2026-05-18T00:46:04.754486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:04.754486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h9qpCsW9rWCc8WGMMckL3ctdUy9wU7YxN2Me8gImer1Azmx4xiBnURpohVRCqDWHEiAo97O70OkrgyitlElvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:04.754960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6727","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d3b215d45f69bc54d0cf50a6eed8f54dc30a57db3aa897ce504dc3c35de0211","sha256:d12f09c12e154ae3ca4befaa08aae3b1bc29719d717830e95bde4adcf6476cac"],"state_sha256":"93e71816eb04367ef2a202c986f29f27b67090b474f12fe505c9b77534704907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmvl0LYWcPTczr/eXyTzzDWv8S85IbQcbiuHaPRH2BpyE/06UXNSxl9UUaBLfe+xnrOJNy3P2E668AS3O9FXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:29:10.555949Z","bundle_sha256":"a83bef2d9c24fb10cd5b989a4b3d00561625c81878c51a29de983d368fef185b"}}