{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2Q6X22CGT4SYAT2NRJCFWTQXYA","short_pith_number":"pith:2Q6X22CG","canonical_record":{"source":{"id":"1202.0664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-03T11:21:43Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"9a166fc2895c3530ebc0bf00314951bf223d4605cddf8b263ff451f68ad2cc01","abstract_canon_sha256":"06c5241b684576e3ed775b41292cc497d8ec6218fb41fc0c2bc2ca321f102394"},"schema_version":"1.0"},"canonical_sha256":"d43d7d68469f25804f4d8a445b4e17c0082325f08fb67aa379fb15d2a401f768","source":{"kind":"arxiv","id":"1202.0664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0664","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0664v1","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0664","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"2Q6X22CGT4SY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2Q6X22CGT4SYAT2N","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2Q6X22CG","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2Q6X22CGT4SYAT2NRJCFWTQXYA","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-03T11:21:43Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"9a166fc2895c3530ebc0bf00314951bf223d4605cddf8b263ff451f68ad2cc01","abstract_canon_sha256":"06c5241b684576e3ed775b41292cc497d8ec6218fb41fc0c2bc2ca321f102394"},"schema_version":"1.0"},"canonical_sha256":"d43d7d68469f25804f4d8a445b4e17c0082325f08fb67aa379fb15d2a401f768","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:08.283356Z","signature_b64":"Zv0TXNVUfVDk4SMB6BK3mxQxAbgo3xRBLllspVj3zQVOEJU1GwKKeRCqCnjovhrg1Qh7UMSjcfBFZjYTZ+TtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d43d7d68469f25804f4d8a445b4e17c0082325f08fb67aa379fb15d2a401f768","last_reissued_at":"2026-05-18T04:03:08.282670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:08.282670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0664","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-18T04:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lou7nomlyffPkHeHiOHK0ms/5Yj+DMWpRGTIQsilOBoe7Z13UNv+I+Z/osOyWvQrQ3Zo3VZcsOncxFIzWxmZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:27:53.067967Z"},"content_sha256":"b22c754486e13ed1c76f65af27b724024ecf7d4a2f16033ec9e857e287f820eb","schema_version":"1.0","event_id":"sha256:b22c754486e13ed1c76f65af27b724024ecf7d4a2f16033ec9e857e287f820eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2Q6X22CGT4SYAT2NRJCFWTQXYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From heaps of matches to the limits of computability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"cs.CC","authors_text":"Johan W\\\"astlund, Urban Larsson","submitted_at":"2012-02-03T11:21:43Z","abstract_excerpt":"We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current game-state by adding one of the vectors in $\\mathcal{M}$, provided all elements of the resulting vector are nonnegative. For instance, in a two-heap game, the vector $(1,-2)$ would mean adding one match to the first heap and removing two matches from the second heap. If $(1,-2) \\in \\mathcal{M}$, such a move would be permitted provided there are at least two m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0664","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-18T04:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbMVlbdMuAvwVJeJkFtcc1yz8XXynjWDyVXC3Mrytiz+l2SXwMMbanhT3XqRcklW6Afd1eZJDluGmGBgu9EyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:27:53.068330Z"},"content_sha256":"8b2b85e70fc033b2a76a1942165823796ff2d22d890311c9e5b9cad5f78bbbd0","schema_version":"1.0","event_id":"sha256:8b2b85e70fc033b2a76a1942165823796ff2d22d890311c9e5b9cad5f78bbbd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Q6X22CGT4SYAT2NRJCFWTQXYA/bundle.json","state_url":"https://pith.science/pith/2Q6X22CGT4SYAT2NRJCFWTQXYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Q6X22CGT4SYAT2NRJCFWTQXYA/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-01T03:27:53Z","links":{"resolver":"https://pith.science/pith/2Q6X22CGT4SYAT2NRJCFWTQXYA","bundle":"https://pith.science/pith/2Q6X22CGT4SYAT2NRJCFWTQXYA/bundle.json","state":"https://pith.science/pith/2Q6X22CGT4SYAT2NRJCFWTQXYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Q6X22CGT4SYAT2NRJCFWTQXYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2Q6X22CGT4SYAT2NRJCFWTQXYA","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":"06c5241b684576e3ed775b41292cc497d8ec6218fb41fc0c2bc2ca321f102394","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-03T11:21:43Z","title_canon_sha256":"9a166fc2895c3530ebc0bf00314951bf223d4605cddf8b263ff451f68ad2cc01"},"schema_version":"1.0","source":{"id":"1202.0664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0664","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0664v1","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0664","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"2Q6X22CGT4SY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2Q6X22CGT4SYAT2N","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2Q6X22CG","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:8b2b85e70fc033b2a76a1942165823796ff2d22d890311c9e5b9cad5f78bbbd0","target":"graph","created_at":"2026-05-18T04:03:08Z","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 study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current game-state by adding one of the vectors in $\\mathcal{M}$, provided all elements of the resulting vector are nonnegative. For instance, in a two-heap game, the vector $(1,-2)$ would mean adding one match to the first heap and removing two matches from the second heap. If $(1,-2) \\in \\mathcal{M}$, such a move would be permitted provided there are at least two m","authors_text":"Johan W\\\"astlund, Urban Larsson","cross_cats":["cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-03T11:21:43Z","title":"From heaps of matches to the limits of computability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0664","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:b22c754486e13ed1c76f65af27b724024ecf7d4a2f16033ec9e857e287f820eb","target":"record","created_at":"2026-05-18T04:03:08Z","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":"06c5241b684576e3ed775b41292cc497d8ec6218fb41fc0c2bc2ca321f102394","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-03T11:21:43Z","title_canon_sha256":"9a166fc2895c3530ebc0bf00314951bf223d4605cddf8b263ff451f68ad2cc01"},"schema_version":"1.0","source":{"id":"1202.0664","kind":"arxiv","version":1}},"canonical_sha256":"d43d7d68469f25804f4d8a445b4e17c0082325f08fb67aa379fb15d2a401f768","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d43d7d68469f25804f4d8a445b4e17c0082325f08fb67aa379fb15d2a401f768","first_computed_at":"2026-05-18T04:03:08.282670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:08.282670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zv0TXNVUfVDk4SMB6BK3mxQxAbgo3xRBLllspVj3zQVOEJU1GwKKeRCqCnjovhrg1Qh7UMSjcfBFZjYTZ+TtBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:08.283356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b22c754486e13ed1c76f65af27b724024ecf7d4a2f16033ec9e857e287f820eb","sha256:8b2b85e70fc033b2a76a1942165823796ff2d22d890311c9e5b9cad5f78bbbd0"],"state_sha256":"7f60ae882d383fcfad68b8a649c3529771d97701d3daddf9b61fc1f84f72fb12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9v9COh3t0qLdkyWd+pP2S+hpL2nzSdr7QyxvJxHSHnULshIdVnYOnCs0Cvyo8OHltuF9BnFh7dAPIgH3ZsZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:27:53.070555Z","bundle_sha256":"845d598b2abd1f8a20fc7f6a845f4af14ddb3ca88ae77f54a96d14a9dfe33c38"}}