{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5NGNOG4UH2H2ESKCIRIBULT43K","short_pith_number":"pith:5NGNOG4U","schema_version":"1.0","canonical_sha256":"eb4cd71b943e8fa2494244501a2e7cda98e8e9ecd22967ed3e172a83bdfb8f17","source":{"kind":"arxiv","id":"1412.4100","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.4100","created_at":"2026-05-18T02:31:27.934420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4100v1","created_at":"2026-05-18T02:31:27.934420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4100","created_at":"2026-05-18T02:31:27.934420+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NGNOG4UH2H2","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NGNOG4UH2H2ESKC","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NGNOG4U","created_at":"2026-05-18T12:28:14.216126+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/5NGNOG4UH2H2ESKCIRIBULT43K","json":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K.json","graph_json":"https://pith.science/api/pith-number/5NGNOG4UH2H2ESKCIRIBULT43K/graph.json","events_json":"https://pith.science/api/pith-number/5NGNOG4UH2H2ESKCIRIBULT43K/events.json","paper":"https://pith.science/paper/5NGNOG4U"},"agent_actions":{"view_html":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K","download_json":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K.json","view_paper":"https://pith.science/paper/5NGNOG4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4100&json=true","fetch_graph":"https://pith.science/api/pith-number/5NGNOG4UH2H2ESKCIRIBULT43K/graph.json","fetch_events":"https://pith.science/api/pith-number/5NGNOG4UH2H2ESKCIRIBULT43K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K/action/storage_attestation","attest_author":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K/action/author_attestation","sign_citation":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K/action/citation_signature","submit_replication":"https://pith.science/pith/5NGNOG4UH2H2ESKCIRIBULT43K/action/replication_record"}},"created_at":"2026-05-18T02:31:27.934420+00:00","updated_at":"2026-05-18T02:31:27.934420+00:00"}