{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KRCIIYRGKIUTRJXAWMKWSZGKV2","short_pith_number":"pith:KRCIIYRG","canonical_record":{"source":{"id":"1305.1677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:12:00Z","cross_cats_sorted":[],"title_canon_sha256":"51c327a9a097afdfe38f8634df0dcb1df70f1ca5127c78b25dda5b02e2e49353","abstract_canon_sha256":"502a3437c8c15c888b602645a3281643ffda74789ab9dc680fde08ed61057e9d"},"schema_version":"1.0"},"canonical_sha256":"5444846226522938a6e0b3156964caae9530b597fdb265cba629fbab86fc299b","source":{"kind":"arxiv","id":"1305.1677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1677","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1677v1","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1677","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"KRCIIYRGKIUT","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KRCIIYRGKIUTRJXA","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KRCIIYRG","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KRCIIYRGKIUTRJXAWMKWSZGKV2","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:12:00Z","cross_cats_sorted":[],"title_canon_sha256":"51c327a9a097afdfe38f8634df0dcb1df70f1ca5127c78b25dda5b02e2e49353","abstract_canon_sha256":"502a3437c8c15c888b602645a3281643ffda74789ab9dc680fde08ed61057e9d"},"schema_version":"1.0"},"canonical_sha256":"5444846226522938a6e0b3156964caae9530b597fdb265cba629fbab86fc299b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:11.606886Z","signature_b64":"DdRcrqdeWmK5SCb0F8QlY1O3BKZRm2plsNYukF7NlDhDgM+53NbARTHRHLy7IGk/+HnMvbiJMn0N4ueh7LH5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5444846226522938a6e0b3156964caae9530b597fdb265cba629fbab86fc299b","last_reissued_at":"2026-05-18T03:26:11.606108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:11.606108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1677","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-18T03:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qAF23DVYBNmsr/aBrPtbnSUHimBRhCVecR/Z084m4wMUaZ4u5OapV9ea7vNC203iHo1Q4hmITKojxAwR6k4uBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T17:18:29.798763Z"},"content_sha256":"197ca47209aa678d9fecb1719aafc742ca24b48159ddb0b8518c6e05dbeab7d4","schema_version":"1.0","event_id":"sha256:197ca47209aa678d9fecb1719aafc742ca24b48159ddb0b8518c6e05dbeab7d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KRCIIYRGKIUTRJXAWMKWSZGKV2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toppling numbers of complete and random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Bonato, P. Pralat, W. Kinnersley","submitted_at":"2013-05-07T23:12:00Z","abstract_excerpt":"We study a two-person game played on graphs based on the widely studied chip-firing game. Players Max and Min alternately place chips on the vertices of a graph. When a vertex accumulates as many chips as its degree, it fires, sending one chip to each neighbour; this may in turn cause other vertices to fire. The game ends when vertices continue firing forever. Min seeks to minimize the number of chips played during the game, while Max seeks to maximize it. When both players play optimally, the length of the game is the {\\em toppling number} of a graph $G$, and is denoted by $\\tg(G)$.\n  By cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1677","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-18T03:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmqnxshG/WkJRheIGRl4zxfJXakl8zLCGpDMnHrRkSTCLU9bzxXDqiAo9PJLVUZ8744vvF0Wx0g53UH9bHWWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T17:18:29.799114Z"},"content_sha256":"e225c74dfa3ab13e11638bf8f77a35ed0e002b8066ddc49a1d56b2e5b3b2e35f","schema_version":"1.0","event_id":"sha256:e225c74dfa3ab13e11638bf8f77a35ed0e002b8066ddc49a1d56b2e5b3b2e35f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRCIIYRGKIUTRJXAWMKWSZGKV2/bundle.json","state_url":"https://pith.science/pith/KRCIIYRGKIUTRJXAWMKWSZGKV2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRCIIYRGKIUTRJXAWMKWSZGKV2/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-07-01T17:18:29Z","links":{"resolver":"https://pith.science/pith/KRCIIYRGKIUTRJXAWMKWSZGKV2","bundle":"https://pith.science/pith/KRCIIYRGKIUTRJXAWMKWSZGKV2/bundle.json","state":"https://pith.science/pith/KRCIIYRGKIUTRJXAWMKWSZGKV2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRCIIYRGKIUTRJXAWMKWSZGKV2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KRCIIYRGKIUTRJXAWMKWSZGKV2","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":"502a3437c8c15c888b602645a3281643ffda74789ab9dc680fde08ed61057e9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:12:00Z","title_canon_sha256":"51c327a9a097afdfe38f8634df0dcb1df70f1ca5127c78b25dda5b02e2e49353"},"schema_version":"1.0","source":{"id":"1305.1677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1677","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1677v1","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1677","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"KRCIIYRGKIUT","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KRCIIYRGKIUTRJXA","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KRCIIYRG","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:e225c74dfa3ab13e11638bf8f77a35ed0e002b8066ddc49a1d56b2e5b3b2e35f","target":"graph","created_at":"2026-05-18T03:26:11Z","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 a two-person game played on graphs based on the widely studied chip-firing game. Players Max and Min alternately place chips on the vertices of a graph. When a vertex accumulates as many chips as its degree, it fires, sending one chip to each neighbour; this may in turn cause other vertices to fire. The game ends when vertices continue firing forever. Min seeks to minimize the number of chips played during the game, while Max seeks to maximize it. When both players play optimally, the length of the game is the {\\em toppling number} of a graph $G$, and is denoted by $\\tg(G)$.\n  By cons","authors_text":"A. Bonato, P. Pralat, W. Kinnersley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:12:00Z","title":"Toppling numbers of complete and random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1677","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:197ca47209aa678d9fecb1719aafc742ca24b48159ddb0b8518c6e05dbeab7d4","target":"record","created_at":"2026-05-18T03:26:11Z","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":"502a3437c8c15c888b602645a3281643ffda74789ab9dc680fde08ed61057e9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:12:00Z","title_canon_sha256":"51c327a9a097afdfe38f8634df0dcb1df70f1ca5127c78b25dda5b02e2e49353"},"schema_version":"1.0","source":{"id":"1305.1677","kind":"arxiv","version":1}},"canonical_sha256":"5444846226522938a6e0b3156964caae9530b597fdb265cba629fbab86fc299b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5444846226522938a6e0b3156964caae9530b597fdb265cba629fbab86fc299b","first_computed_at":"2026-05-18T03:26:11.606108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:11.606108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DdRcrqdeWmK5SCb0F8QlY1O3BKZRm2plsNYukF7NlDhDgM+53NbARTHRHLy7IGk/+HnMvbiJMn0N4ueh7LH5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:11.606886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:197ca47209aa678d9fecb1719aafc742ca24b48159ddb0b8518c6e05dbeab7d4","sha256:e225c74dfa3ab13e11638bf8f77a35ed0e002b8066ddc49a1d56b2e5b3b2e35f"],"state_sha256":"6cd085a75c08a734b9be28f7f5328b5066340d4382807b7fdc55a53c35c2ed11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXKZZd3CzSzlY7+tgCt1pqKb9srBaou/caTqL05Z0f3T9Gj09oTuQKhIVtOMR19rYt57XdMhQExWsPHU9PiaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T17:18:29.801042Z","bundle_sha256":"9b64062d836c6931e962b5cf10d83207387a3623e2d3d46cc42fbe1f0aad8dc5"}}