{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZTHYNTZ3PERBMLSVB54QAGACQN","short_pith_number":"pith:ZTHYNTZ3","canonical_record":{"source":{"id":"1410.3796","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-14T18:45:41Z","cross_cats_sorted":[],"title_canon_sha256":"a95b27b0184a29fc751cb0a3eba0ae08bddcc28d52ac921293c118b0c151cd49","abstract_canon_sha256":"8b11ad66159a48a46781a6f22371b8cab894894a4b5302f1487fdebf9a51fb65"},"schema_version":"1.0"},"canonical_sha256":"cccf86cf3b7922162e550f7900180283637173dc7f64a5f3d180278c6609dbef","source":{"kind":"arxiv","id":"1410.3796","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3796","created_at":"2026-05-18T02:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3796v3","created_at":"2026-05-18T02:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3796","created_at":"2026-05-18T02:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZTHYNTZ3PERB","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTHYNTZ3PERBMLSV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTHYNTZ3","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZTHYNTZ3PERBMLSVB54QAGACQN","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3796","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-14T18:45:41Z","cross_cats_sorted":[],"title_canon_sha256":"a95b27b0184a29fc751cb0a3eba0ae08bddcc28d52ac921293c118b0c151cd49","abstract_canon_sha256":"8b11ad66159a48a46781a6f22371b8cab894894a4b5302f1487fdebf9a51fb65"},"schema_version":"1.0"},"canonical_sha256":"cccf86cf3b7922162e550f7900180283637173dc7f64a5f3d180278c6609dbef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:17.530806Z","signature_b64":"MmbGQjaJ4iWbNykkn3Yu1Wc/MGc1mXShptv2Voxeehz7fwzEZYi3Zk/vMiCrY8ljSONs07Zyby+bssDwc/EeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cccf86cf3b7922162e550f7900180283637173dc7f64a5f3d180278c6609dbef","last_reissued_at":"2026-05-18T02:14:17.530207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:17.530207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3796","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-18T02:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YGrkHbRf09ddcnEbOij+5nYG/i+Pw8Zx7BZaCNr+2afZ1iuzOQUcW3PNtR2KqtNgp/iwRklCCTPxHUqj74MbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:22:11.889334Z"},"content_sha256":"568f1547839767a46e8aede79b1279a110a03529b94ca46c6e3bee05a84a800e","schema_version":"1.0","event_id":"sha256:568f1547839767a46e8aede79b1279a110a03529b94ca46c6e3bee05a84a800e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZTHYNTZ3PERBMLSVB54QAGACQN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reversible peg solitaire on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Stocker, John Engbers","submitted_at":"2014-10-14T18:45:41Z","abstract_excerpt":"The game of peg solitaire on graphs was introduced by Beeler and Hoilman in 2011. In this game, pegs are initially placed on all but one vertex of a graph $G$. If $xyz$ forms a path in $G$ and there are pegs on vertices $x$ and $y$ but not $z$, then a {\\em jump} places a peg on $z$ and removes the pegs from $x$ and $y$. A graph is called solvable if, for some configuration of pegs occupying all but one vertex, some sequence of jumps leaves a single peg. We study the game of {\\em reversible peg solitaire}, where there are again initially pegs on all but one vertex, but now both jumps and unjump"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3796","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-18T02:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uH6vhoyhVr9dRTJONy3LcjxVVh35PENMKTZewCsssBwtZyR7hmqmozRHmobHZQDmTHk6TW6EzuZleMk0A9kqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:22:11.889685Z"},"content_sha256":"3884fc8466ce279592296643a43fe5ccb79f3834ca02144c6af890649dd50e2d","schema_version":"1.0","event_id":"sha256:3884fc8466ce279592296643a43fe5ccb79f3834ca02144c6af890649dd50e2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTHYNTZ3PERBMLSVB54QAGACQN/bundle.json","state_url":"https://pith.science/pith/ZTHYNTZ3PERBMLSVB54QAGACQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTHYNTZ3PERBMLSVB54QAGACQN/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-03T07:22:11Z","links":{"resolver":"https://pith.science/pith/ZTHYNTZ3PERBMLSVB54QAGACQN","bundle":"https://pith.science/pith/ZTHYNTZ3PERBMLSVB54QAGACQN/bundle.json","state":"https://pith.science/pith/ZTHYNTZ3PERBMLSVB54QAGACQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTHYNTZ3PERBMLSVB54QAGACQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZTHYNTZ3PERBMLSVB54QAGACQN","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":"8b11ad66159a48a46781a6f22371b8cab894894a4b5302f1487fdebf9a51fb65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-14T18:45:41Z","title_canon_sha256":"a95b27b0184a29fc751cb0a3eba0ae08bddcc28d52ac921293c118b0c151cd49"},"schema_version":"1.0","source":{"id":"1410.3796","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3796","created_at":"2026-05-18T02:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3796v3","created_at":"2026-05-18T02:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3796","created_at":"2026-05-18T02:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZTHYNTZ3PERB","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTHYNTZ3PERBMLSV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTHYNTZ3","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:3884fc8466ce279592296643a43fe5ccb79f3834ca02144c6af890649dd50e2d","target":"graph","created_at":"2026-05-18T02:14:17Z","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":"The game of peg solitaire on graphs was introduced by Beeler and Hoilman in 2011. In this game, pegs are initially placed on all but one vertex of a graph $G$. If $xyz$ forms a path in $G$ and there are pegs on vertices $x$ and $y$ but not $z$, then a {\\em jump} places a peg on $z$ and removes the pegs from $x$ and $y$. A graph is called solvable if, for some configuration of pegs occupying all but one vertex, some sequence of jumps leaves a single peg. We study the game of {\\em reversible peg solitaire}, where there are again initially pegs on all but one vertex, but now both jumps and unjump","authors_text":"Christopher Stocker, John Engbers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-14T18:45:41Z","title":"Reversible peg solitaire on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3796","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:568f1547839767a46e8aede79b1279a110a03529b94ca46c6e3bee05a84a800e","target":"record","created_at":"2026-05-18T02:14:17Z","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":"8b11ad66159a48a46781a6f22371b8cab894894a4b5302f1487fdebf9a51fb65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-14T18:45:41Z","title_canon_sha256":"a95b27b0184a29fc751cb0a3eba0ae08bddcc28d52ac921293c118b0c151cd49"},"schema_version":"1.0","source":{"id":"1410.3796","kind":"arxiv","version":3}},"canonical_sha256":"cccf86cf3b7922162e550f7900180283637173dc7f64a5f3d180278c6609dbef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cccf86cf3b7922162e550f7900180283637173dc7f64a5f3d180278c6609dbef","first_computed_at":"2026-05-18T02:14:17.530207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:14:17.530207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MmbGQjaJ4iWbNykkn3Yu1Wc/MGc1mXShptv2Voxeehz7fwzEZYi3Zk/vMiCrY8ljSONs07Zyby+bssDwc/EeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:14:17.530806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3796","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:568f1547839767a46e8aede79b1279a110a03529b94ca46c6e3bee05a84a800e","sha256:3884fc8466ce279592296643a43fe5ccb79f3834ca02144c6af890649dd50e2d"],"state_sha256":"f353e273ab6df19c277f2255d8dcf5756ca6ec0159c240fea997e819be6f36de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f0WVhSB50Swo8cPjowl4IHlzk55PNybt6LJEQuM77tt/BBDhvAntXTrqRyW5/SRVG2BEA7PFf71owLRNp0LeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:22:11.891570Z","bundle_sha256":"17db9a4c3971a5590fe31effe3d283ee9d42d5fb1c89af8d7c8d615b1d27215a"}}