{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ASLBS7IMSDB3XD7ZREM54BNKLQ","short_pith_number":"pith:ASLBS7IM","canonical_record":{"source":{"id":"1803.03081","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-08T13:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"c11a2f37989728c6cd8d313fac1852465c3f7202e9b8d09a607c3b4dbfcef880","abstract_canon_sha256":"311df90c037a2902f549df6569146d6c543d226339e2d422e7d6c769d69f9a79"},"schema_version":"1.0"},"canonical_sha256":"0496197d0c90c3bb8ff98919de05aa5c34dba58f7077db3528661159b90b6398","source":{"kind":"arxiv","id":"1803.03081","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03081","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03081v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03081","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"ASLBS7IMSDB3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASLBS7IMSDB3XD7Z","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASLBS7IM","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ASLBS7IMSDB3XD7ZREM54BNKLQ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03081","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-08T13:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"c11a2f37989728c6cd8d313fac1852465c3f7202e9b8d09a607c3b4dbfcef880","abstract_canon_sha256":"311df90c037a2902f549df6569146d6c543d226339e2d422e7d6c769d69f9a79"},"schema_version":"1.0"},"canonical_sha256":"0496197d0c90c3bb8ff98919de05aa5c34dba58f7077db3528661159b90b6398","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:09.022896Z","signature_b64":"FjDdSye69TSeQTHbY/6rfaqkO6JriL3+Mrm5fDHmYEL4apHLAico7rj46dS0mfXB1HB9u3X4Gf86MC3NWhTdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0496197d0c90c3bb8ff98919de05aa5c34dba58f7077db3528661159b90b6398","last_reissued_at":"2026-05-18T00:18:09.022478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:09.022478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03081","source_version":2,"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-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJlGT7gPrwRyzpCtTJUuMlffnfr900r25LgZhQyYbHeapRRFu65m/uqriuLejWcZjrwSobZXOZ3IE6/ygQIyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:22:48.333668Z"},"content_sha256":"70dd0e89e6b85d75b28b637e3aa526a80997d661d83934e38526b39b2a1ad850","schema_version":"1.0","event_id":"sha256:70dd0e89e6b85d75b28b637e3aa526a80997d661d83934e38526b39b2a1ad850"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ASLBS7IMSDB3XD7ZREM54BNKLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chomp on generalized Kneser graphs and others","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ignacio Garc\\'ia-Marco, Kolja Knauer, Luis Pedro Montejano","submitted_at":"2018-03-08T13:34:45Z","abstract_excerpt":"In chomp on graphs, two players alternatingly pick an edge or a vertex from a graph. The player that cannot move any more loses. The questions one wants to answer for a given graph are: Which player has a winning strategy? Can a explicit strategy be devised? We answer these questions (and determine the Nim-value) for the class of generalized Kneser graphs and for several families of Johnson graphs. We also generalize some of these results to the clique complexes of these graphs. Furthermore, we determine which player has a winning strategy for some classes of threshold graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03081","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"},"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-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zE1/bfopGjhBWpxIPbi0mesK7wR/tOwOKzlsUhheVc3b8fA49YjoN5X9htrPOvpiWK3SkMPqhS1JClfrZHJrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:22:48.334479Z"},"content_sha256":"4e00cac5f2314cc9a7b751ac9c2d6881537d6d1aa95a043f57af672f68e98d1d","schema_version":"1.0","event_id":"sha256:4e00cac5f2314cc9a7b751ac9c2d6881537d6d1aa95a043f57af672f68e98d1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASLBS7IMSDB3XD7ZREM54BNKLQ/bundle.json","state_url":"https://pith.science/pith/ASLBS7IMSDB3XD7ZREM54BNKLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASLBS7IMSDB3XD7ZREM54BNKLQ/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-05-25T12:22:48Z","links":{"resolver":"https://pith.science/pith/ASLBS7IMSDB3XD7ZREM54BNKLQ","bundle":"https://pith.science/pith/ASLBS7IMSDB3XD7ZREM54BNKLQ/bundle.json","state":"https://pith.science/pith/ASLBS7IMSDB3XD7ZREM54BNKLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASLBS7IMSDB3XD7ZREM54BNKLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ASLBS7IMSDB3XD7ZREM54BNKLQ","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":"311df90c037a2902f549df6569146d6c543d226339e2d422e7d6c769d69f9a79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-08T13:34:45Z","title_canon_sha256":"c11a2f37989728c6cd8d313fac1852465c3f7202e9b8d09a607c3b4dbfcef880"},"schema_version":"1.0","source":{"id":"1803.03081","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03081","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03081v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03081","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"ASLBS7IMSDB3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASLBS7IMSDB3XD7Z","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASLBS7IM","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:4e00cac5f2314cc9a7b751ac9c2d6881537d6d1aa95a043f57af672f68e98d1d","target":"graph","created_at":"2026-05-18T00:18:09Z","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":"In chomp on graphs, two players alternatingly pick an edge or a vertex from a graph. The player that cannot move any more loses. The questions one wants to answer for a given graph are: Which player has a winning strategy? Can a explicit strategy be devised? We answer these questions (and determine the Nim-value) for the class of generalized Kneser graphs and for several families of Johnson graphs. We also generalize some of these results to the clique complexes of these graphs. Furthermore, we determine which player has a winning strategy for some classes of threshold graphs.","authors_text":"Ignacio Garc\\'ia-Marco, Kolja Knauer, Luis Pedro Montejano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-08T13:34:45Z","title":"Chomp on generalized Kneser graphs and others"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03081","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:70dd0e89e6b85d75b28b637e3aa526a80997d661d83934e38526b39b2a1ad850","target":"record","created_at":"2026-05-18T00:18:09Z","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":"311df90c037a2902f549df6569146d6c543d226339e2d422e7d6c769d69f9a79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-08T13:34:45Z","title_canon_sha256":"c11a2f37989728c6cd8d313fac1852465c3f7202e9b8d09a607c3b4dbfcef880"},"schema_version":"1.0","source":{"id":"1803.03081","kind":"arxiv","version":2}},"canonical_sha256":"0496197d0c90c3bb8ff98919de05aa5c34dba58f7077db3528661159b90b6398","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0496197d0c90c3bb8ff98919de05aa5c34dba58f7077db3528661159b90b6398","first_computed_at":"2026-05-18T00:18:09.022478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:09.022478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FjDdSye69TSeQTHbY/6rfaqkO6JriL3+Mrm5fDHmYEL4apHLAico7rj46dS0mfXB1HB9u3X4Gf86MC3NWhTdAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:09.022896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03081","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70dd0e89e6b85d75b28b637e3aa526a80997d661d83934e38526b39b2a1ad850","sha256:4e00cac5f2314cc9a7b751ac9c2d6881537d6d1aa95a043f57af672f68e98d1d"],"state_sha256":"b4692b61a52829f1d33720e706ee88e9a08499d4ae62673c9b44794d57ed2440"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M33ex7Zrbj3h9U+LOcL8VwOSY56q1zZh4CxTlNL5wMuGQb2+rhl5AoQrK/RqSKETKqmI4lSCuPpusa2DyjPGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:22:48.338855Z","bundle_sha256":"7ed012bea822ab0ddc9cd45ea27f8469c55ff4904f04b4efc3122eef6f30135a"}}