{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7SYJIB6BNGIMRYAEJJPEVZU2GQ","short_pith_number":"pith:7SYJIB6B","canonical_record":{"source":{"id":"1308.2841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-13T12:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"c75965edd8984f0dcbfbe226b44ea86257241ef5f4e5e9e5941ce83831e63b5c","abstract_canon_sha256":"847d1826d05bff521224c7c561dcaeb0adb8a16767e08f75d066957ad52b93ed"},"schema_version":"1.0"},"canonical_sha256":"fcb09407c16990c8e0044a5e4ae69a34175df6e8c99abf4a94c5297d41441d8f","source":{"kind":"arxiv","id":"1308.2841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2841","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2841v1","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2841","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"7SYJIB6BNGIM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7SYJIB6BNGIMRYAE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7SYJIB6B","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7SYJIB6BNGIMRYAEJJPEVZU2GQ","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-13T12:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"c75965edd8984f0dcbfbe226b44ea86257241ef5f4e5e9e5941ce83831e63b5c","abstract_canon_sha256":"847d1826d05bff521224c7c561dcaeb0adb8a16767e08f75d066957ad52b93ed"},"schema_version":"1.0"},"canonical_sha256":"fcb09407c16990c8e0044a5e4ae69a34175df6e8c99abf4a94c5297d41441d8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:58.387766Z","signature_b64":"WxO2biGc40UaxSU0bXYyEbH2szSthsPhbCBDC2ExPN1Uq2awK+9kpKkVugcIsmwbUpSiQ+1nR1ESq4n37MpxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb09407c16990c8e0044a5e4ae69a34175df6e8c99abf4a94c5297d41441d8f","last_reissued_at":"2026-05-18T03:15:58.387331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:58.387331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2841","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:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3eRZCeZN477RAujSz7AQce4AOZ0/EUDblVw9NgPzkTJ41vPRq3GmW6wfWoVvzLuGZDxDaO390HHKLJMt0J+hCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:05:04.671273Z"},"content_sha256":"d64f762430fa9441da487bae17e38349dbe45c740ccb4df98058605aae52cd71","schema_version":"1.0","event_id":"sha256:d64f762430fa9441da487bae17e38349dbe45c740ccb4df98058605aae52cd71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7SYJIB6BNGIMRYAEJJPEVZU2GQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the minimum order of k-cop-win graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aaron Maurer, Andrew Beveridge, Anthony Bonato, John McCauley, Paolo Codenotti, Silviya Valeva, William Baird","submitted_at":"2013-08-13T12:42:44Z","abstract_excerpt":"We consider the minimum order graphs with a given cop number. We prove that the minimum order of a connected graph with cop number 3 is 10, and show that the Petersen graph is the unique isomorphism type of graph with this property. We provide the results of a computational search on the cop number of all graphs up to and including order 10. A relationship is presented between the minimum order of graph with cop number $k$ and Meyniel's conjecture on the asymptotic maximum value of the cop number of a connected graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2841","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:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7CSj7etmDPH8aje0gSazsOhtgHO2K/8GnDHtc9ZTtZ7MhuYNo2iaSkkMDIGVrMdXnVA0GDF5JI0JYkRr/lr1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:05:04.671928Z"},"content_sha256":"8504f7bbfc1ee9fa2d965bea34bf3ab263741d72f2c898d6207bd1d0c716c217","schema_version":"1.0","event_id":"sha256:8504f7bbfc1ee9fa2d965bea34bf3ab263741d72f2c898d6207bd1d0c716c217"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SYJIB6BNGIMRYAEJJPEVZU2GQ/bundle.json","state_url":"https://pith.science/pith/7SYJIB6BNGIMRYAEJJPEVZU2GQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SYJIB6BNGIMRYAEJJPEVZU2GQ/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-02T05:05:04Z","links":{"resolver":"https://pith.science/pith/7SYJIB6BNGIMRYAEJJPEVZU2GQ","bundle":"https://pith.science/pith/7SYJIB6BNGIMRYAEJJPEVZU2GQ/bundle.json","state":"https://pith.science/pith/7SYJIB6BNGIMRYAEJJPEVZU2GQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SYJIB6BNGIMRYAEJJPEVZU2GQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7SYJIB6BNGIMRYAEJJPEVZU2GQ","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":"847d1826d05bff521224c7c561dcaeb0adb8a16767e08f75d066957ad52b93ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-13T12:42:44Z","title_canon_sha256":"c75965edd8984f0dcbfbe226b44ea86257241ef5f4e5e9e5941ce83831e63b5c"},"schema_version":"1.0","source":{"id":"1308.2841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2841","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2841v1","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2841","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"7SYJIB6BNGIM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7SYJIB6BNGIMRYAE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7SYJIB6B","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:8504f7bbfc1ee9fa2d965bea34bf3ab263741d72f2c898d6207bd1d0c716c217","target":"graph","created_at":"2026-05-18T03:15:58Z","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 consider the minimum order graphs with a given cop number. We prove that the minimum order of a connected graph with cop number 3 is 10, and show that the Petersen graph is the unique isomorphism type of graph with this property. We provide the results of a computational search on the cop number of all graphs up to and including order 10. A relationship is presented between the minimum order of graph with cop number $k$ and Meyniel's conjecture on the asymptotic maximum value of the cop number of a connected graph.","authors_text":"Aaron Maurer, Andrew Beveridge, Anthony Bonato, John McCauley, Paolo Codenotti, Silviya Valeva, William Baird","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-13T12:42:44Z","title":"On the minimum order of k-cop-win graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2841","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:d64f762430fa9441da487bae17e38349dbe45c740ccb4df98058605aae52cd71","target":"record","created_at":"2026-05-18T03:15:58Z","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":"847d1826d05bff521224c7c561dcaeb0adb8a16767e08f75d066957ad52b93ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-13T12:42:44Z","title_canon_sha256":"c75965edd8984f0dcbfbe226b44ea86257241ef5f4e5e9e5941ce83831e63b5c"},"schema_version":"1.0","source":{"id":"1308.2841","kind":"arxiv","version":1}},"canonical_sha256":"fcb09407c16990c8e0044a5e4ae69a34175df6e8c99abf4a94c5297d41441d8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcb09407c16990c8e0044a5e4ae69a34175df6e8c99abf4a94c5297d41441d8f","first_computed_at":"2026-05-18T03:15:58.387331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:58.387331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WxO2biGc40UaxSU0bXYyEbH2szSthsPhbCBDC2ExPN1Uq2awK+9kpKkVugcIsmwbUpSiQ+1nR1ESq4n37MpxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:58.387766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d64f762430fa9441da487bae17e38349dbe45c740ccb4df98058605aae52cd71","sha256:8504f7bbfc1ee9fa2d965bea34bf3ab263741d72f2c898d6207bd1d0c716c217"],"state_sha256":"8a842e7a8ccdb32ced43d1c87b0436037cc0714d9106dccecff9d2f65279e5a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cJwdvo8QsOo8GvKWPEA9DbaCK8+OgLJ73Kj3HPljGAmLXlnHGnLx1tFlcgqKQowYZVQwb7cjw/STdYtLGVfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:05:04.675165Z","bundle_sha256":"0a3b93d9deebc8e4a19cc406cdacb0f7db995598abbc59ecb3ad81d1981ab2bb"}}