{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QMX36ZBARUZHDYUQ4TX67OWZRE","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":"c2997b515d7367da32832e6f1b6c734696c4d519004629d1b1e5e914d03b7d1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-22T02:02:42Z","title_canon_sha256":"de0191002a859be13bc01d531ef901f47eb319e01c60dfceca412152d480faf1"},"schema_version":"1.0","source":{"id":"1401.5538","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5538","created_at":"2026-05-18T02:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5538v2","created_at":"2026-05-18T02:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5538","created_at":"2026-05-18T02:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"QMX36ZBARUZH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMX36ZBARUZHDYUQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMX36ZBA","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:10df23879d3b970b59a837f5160458e97001ea69576ade61ef48274929259ec5","target":"graph","created_at":"2026-05-18T02:52:25Z","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 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.","authors_text":"Alan Frieze, Lisa Espig, Michael Krivelevich, Wesley Pegden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-22T02:02:42Z","title":"Walker-Breaker games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5538","kind":"arxiv","version":2},"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:eb63860d81e4a4ae5eceb84dd61c264d1d6b1f5629d2996e379f0d34ce400407","target":"record","created_at":"2026-05-18T02:52:25Z","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":"c2997b515d7367da32832e6f1b6c734696c4d519004629d1b1e5e914d03b7d1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-22T02:02:42Z","title_canon_sha256":"de0191002a859be13bc01d531ef901f47eb319e01c60dfceca412152d480faf1"},"schema_version":"1.0","source":{"id":"1401.5538","kind":"arxiv","version":2}},"canonical_sha256":"832fbf64208d3271e290e4efefbad9891ad822b770850e240d3e154f0cb8fdff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"832fbf64208d3271e290e4efefbad9891ad822b770850e240d3e154f0cb8fdff","first_computed_at":"2026-05-18T02:52:25.955392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:25.955392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xlnNd7xV41pBun0I8wo6k2iuE6yOMOSGcm//zJ1kmh3nDhXxk5FmFwmROsUSqej5U9R6RvvufsuSrInpu9LBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:25.956202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5538","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb63860d81e4a4ae5eceb84dd61c264d1d6b1f5629d2996e379f0d34ce400407","sha256:10df23879d3b970b59a837f5160458e97001ea69576ade61ef48274929259ec5"],"state_sha256":"5bb50e528074fe96b7eed75a3cb27f8d462561ff596f39abf5dfd5aa0a1344e5"}