{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5NGNOG4UH2H2ESKCIRIBULT43K","short_pith_number":"pith:5NGNOG4U","canonical_record":{"source":{"id":"1412.4100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T19:54:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3f93fc34ddb93430921f2bf419186671d886144a16ed1b1fed534602d67d09c8","abstract_canon_sha256":"6c53a7bc58a412151f4dfdf83aed11117add306ed3eb4fb8733b44b70b620d80"},"schema_version":"1.0"},"canonical_sha256":"eb4cd71b943e8fa2494244501a2e7cda98e8e9ecd22967ed3e172a83bdfb8f17","source":{"kind":"arxiv","id":"1412.4100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4100","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4100v1","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4100","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"5NGNOG4UH2H2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5NGNOG4UH2H2ESKC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5NGNOG4U","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5NGNOG4UH2H2ESKCIRIBULT43K","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T19:54:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3f93fc34ddb93430921f2bf419186671d886144a16ed1b1fed534602d67d09c8","abstract_canon_sha256":"6c53a7bc58a412151f4dfdf83aed11117add306ed3eb4fb8733b44b70b620d80"},"schema_version":"1.0"},"canonical_sha256":"eb4cd71b943e8fa2494244501a2e7cda98e8e9ecd22967ed3e172a83bdfb8f17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:27.934760Z","signature_b64":"TnvEt7rFA9EUhshdX6JabIWBcMwq9zplA6nj/Ag5vCU9/YnTTrHg6CX0ec+DKUoKN4xN5BYOH1S4mW+iKXl2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb4cd71b943e8fa2494244501a2e7cda98e8e9ecd22967ed3e172a83bdfb8f17","last_reissued_at":"2026-05-18T02:31:27.934356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:27.934356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4100","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-18T02:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cUUaiuehdIeNSZS/k/MFnbD09BVfNk5fCiosw9iABi5pRo9KYN9SIopB8qP1Y2IPD2MErjHEBvYJ/ksfzx/5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:57:43.617345Z"},"content_sha256":"02c0a62ec9a6218847737f53588f778f1bd5660768111d4cd77ad503fb865117","schema_version":"1.0","event_id":"sha256:02c0a62ec9a6218847737f53588f778f1bd5660768111d4cd77ad503fb865117"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5NGNOG4UH2H2ESKCIRIBULT43K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Playing weighted Tron on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Hoske, Jonathan Rollin, Stefan Walzer, Torsten Ueckerdt","submitted_at":"2014-12-12T19:54:32Z","abstract_excerpt":"We consider the weighted version of the Tron game on graphs where two players, Alice and Bob, each build their own path by claiming one vertex at a time, starting with Alice. The vertices carry non-negative weights that sum up to 1 and either player tries to claim a path with larger total weight than the opponent. We show that if the graph is a tree then Alice can always ensure to get at most 1/5 less than Bob, and that there exist trees where Bob can ensure to get at least 1/5 more than Alice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4100","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-18T02:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCDISiCohdJAT1hryT7gXIN6kkoGi5RhgjXIJKs+dhYUidtdGNUplGSGnPkQHAvpO6cgaCnYWA25DxDVntjbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:57:43.617694Z"},"content_sha256":"86609de15dee4e9c454efa1b3d193c392b8bfad75ee2b6da0aa34b3da6cd2845","schema_version":"1.0","event_id":"sha256:86609de15dee4e9c454efa1b3d193c392b8bfad75ee2b6da0aa34b3da6cd2845"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K/bundle.json","state_url":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NGNOG4UH2H2ESKCIRIBULT43K/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-06-05T15:57:43Z","links":{"resolver":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K","bundle":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K/bundle.json","state":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NGNOG4UH2H2ESKCIRIBULT43K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5NGNOG4UH2H2ESKCIRIBULT43K","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":"6c53a7bc58a412151f4dfdf83aed11117add306ed3eb4fb8733b44b70b620d80","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T19:54:32Z","title_canon_sha256":"3f93fc34ddb93430921f2bf419186671d886144a16ed1b1fed534602d67d09c8"},"schema_version":"1.0","source":{"id":"1412.4100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4100","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4100v1","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4100","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"5NGNOG4UH2H2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5NGNOG4UH2H2ESKC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5NGNOG4U","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:86609de15dee4e9c454efa1b3d193c392b8bfad75ee2b6da0aa34b3da6cd2845","target":"graph","created_at":"2026-05-18T02:31:27Z","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 consider the weighted version of the Tron game on graphs where two players, Alice and Bob, each build their own path by claiming one vertex at a time, starting with Alice. The vertices carry non-negative weights that sum up to 1 and either player tries to claim a path with larger total weight than the opponent. We show that if the graph is a tree then Alice can always ensure to get at most 1/5 less than Bob, and that there exist trees where Bob can ensure to get at least 1/5 more than Alice.","authors_text":"Daniel Hoske, Jonathan Rollin, Stefan Walzer, Torsten Ueckerdt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T19:54:32Z","title":"Playing weighted Tron on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4100","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:02c0a62ec9a6218847737f53588f778f1bd5660768111d4cd77ad503fb865117","target":"record","created_at":"2026-05-18T02:31:27Z","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":"6c53a7bc58a412151f4dfdf83aed11117add306ed3eb4fb8733b44b70b620d80","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T19:54:32Z","title_canon_sha256":"3f93fc34ddb93430921f2bf419186671d886144a16ed1b1fed534602d67d09c8"},"schema_version":"1.0","source":{"id":"1412.4100","kind":"arxiv","version":1}},"canonical_sha256":"eb4cd71b943e8fa2494244501a2e7cda98e8e9ecd22967ed3e172a83bdfb8f17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb4cd71b943e8fa2494244501a2e7cda98e8e9ecd22967ed3e172a83bdfb8f17","first_computed_at":"2026-05-18T02:31:27.934356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:27.934356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TnvEt7rFA9EUhshdX6JabIWBcMwq9zplA6nj/Ag5vCU9/YnTTrHg6CX0ec+DKUoKN4xN5BYOH1S4mW+iKXl2CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:27.934760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02c0a62ec9a6218847737f53588f778f1bd5660768111d4cd77ad503fb865117","sha256:86609de15dee4e9c454efa1b3d193c392b8bfad75ee2b6da0aa34b3da6cd2845"],"state_sha256":"4afc28c06ef389d8997a63a7946548817ab1a7b48340f8b328d0f28f2e74e9ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKbb9BmrYTnafXkVH/ZgpW57QCUPTxyLFpQLDRi1mNSFaEvDwLJ6mOaqflSFHF5wtpzAN6LkXP1VNr8CcxHmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:57:43.619697Z","bundle_sha256":"395ad21e2a491ac67c14f95d0798ce1a94c66f7ffc06c762bb27955c658e31c6"}}