{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QMX36ZBARUZHDYUQ4TX67OWZRE","short_pith_number":"pith:QMX36ZBA","schema_version":"1.0","canonical_sha256":"832fbf64208d3271e290e4efefbad9891ad822b770850e240d3e154f0cb8fdff","source":{"kind":"arxiv","id":"1401.5538","version":2},"attestation_state":"computed","paper":{"title":"Walker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Lisa Espig, Michael Krivelevich, Wesley Pegden","submitted_at":"2014-01-22T02:02:42Z","abstract_excerpt":"We introduce and analyze the Walker-Breaker game, a variant of Maker-Breaker games where Maker is constrained to choose edges of a walk or path in a given graph G, with the goal of visiting as many vertices of the underlying graph as possible."},"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":"1401.5538","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-22T02:02:42Z","cross_cats_sorted":[],"title_canon_sha256":"de0191002a859be13bc01d531ef901f47eb319e01c60dfceca412152d480faf1","abstract_canon_sha256":"c2997b515d7367da32832e6f1b6c734696c4d519004629d1b1e5e914d03b7d1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:25.956202Z","signature_b64":"5xlnNd7xV41pBun0I8wo6k2iuE6yOMOSGcm//zJ1kmh3nDhXxk5FmFwmROsUSqej5U9R6RvvufsuSrInpu9LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"832fbf64208d3271e290e4efefbad9891ad822b770850e240d3e154f0cb8fdff","last_reissued_at":"2026-05-18T02:52:25.955392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:25.955392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Walker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Lisa Espig, Michael Krivelevich, Wesley Pegden","submitted_at":"2014-01-22T02:02:42Z","abstract_excerpt":"We introduce and analyze the Walker-Breaker game, a variant of Maker-Breaker games where Maker is constrained to choose edges of a walk or path in a given graph G, with the goal of visiting as many vertices of the underlying graph as possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5538","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":"1401.5538","created_at":"2026-05-18T02:52:25.955523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5538v2","created_at":"2026-05-18T02:52:25.955523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5538","created_at":"2026-05-18T02:52:25.955523+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMX36ZBARUZH","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMX36ZBARUZHDYUQ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMX36ZBA","created_at":"2026-05-18T12:28:46.137349+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/QMX36ZBARUZHDYUQ4TX67OWZRE","json":"https://pith.science/pith/QMX36ZBARUZHDYUQ4TX67OWZRE.json","graph_json":"https://pith.science/api/pith-number/QMX36ZBARUZHDYUQ4TX67OWZRE/graph.json","events_json":"https://pith.science/api/pith-number/QMX36ZBARUZHDYUQ4TX67OWZRE/events.json","paper":"https://pith.science/paper/QMX36ZBA"},"agent_actions":{"view_html":"https://pith.science/pith/QMX36ZBARUZHDYUQ4TX67OWZRE","download_json":"https://pith.science/pith/QMX36ZBARUZHDYUQ4TX67OWZRE.json","view_paper":"https://pith.science/paper/QMX36ZBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5538&json=true","fetch_graph":"https://pith.science/api/pith-number/QMX36ZBARUZHDYUQ4TX67OWZRE/graph.json","fetch_events":"https://pith.science/api/pith-number/QMX36ZBARUZHDYUQ4TX67OWZRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMX36ZBARUZHDYUQ4TX67OWZRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMX36ZBARUZHDYUQ4TX67OWZRE/action/storage_attestation","attest_author":"https://pith.science/pith/QMX36ZBARUZHDYUQ4TX67OWZRE/action/author_attestation","sign_citation":"https://pith.science/pith/QMX36ZBARUZHDYUQ4TX67OWZRE/action/citation_signature","submit_replication":"https://pith.science/pith/QMX36ZBARUZHDYUQ4TX67OWZRE/action/replication_record"}},"created_at":"2026-05-18T02:52:25.955523+00:00","updated_at":"2026-05-18T02:52:25.955523+00:00"}