{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4ZSXNHTVVPD665XDEHASGS62I2","short_pith_number":"pith:4ZSXNHTV","canonical_record":{"source":{"id":"1509.04696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-15T19:42:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a5f7a96c19eda5b0ff276fa2d04b620e7e390e3b72bc3fcc5235d8b678d87a6f","abstract_canon_sha256":"617dddc767df8edfd1fb37b36f382e447625d3be1fcc39a4719c58c372a87324"},"schema_version":"1.0"},"canonical_sha256":"e665769e75abc7ef76e321c1234bda468cbdce417b6dfb7a199b20dcae9d5d59","source":{"kind":"arxiv","id":"1509.04696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04696","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04696v1","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04696","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"4ZSXNHTVVPD6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4ZSXNHTVVPD665XD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4ZSXNHTV","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4ZSXNHTVVPD665XDEHASGS62I2","target":"record","payload":{"canonical_record":{"source":{"id":"1509.04696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-15T19:42:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a5f7a96c19eda5b0ff276fa2d04b620e7e390e3b72bc3fcc5235d8b678d87a6f","abstract_canon_sha256":"617dddc767df8edfd1fb37b36f382e447625d3be1fcc39a4719c58c372a87324"},"schema_version":"1.0"},"canonical_sha256":"e665769e75abc7ef76e321c1234bda468cbdce417b6dfb7a199b20dcae9d5d59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:58.241979Z","signature_b64":"WT6mE3wa0Nv+u29RTi9i4j9H/eDDHvT7GId8xB0RN+PumVPSh9W+MeFoKel4DHjoFx1gBdn+HZh4f5gpSk3wBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e665769e75abc7ef76e321c1234bda468cbdce417b6dfb7a199b20dcae9d5d59","last_reissued_at":"2026-05-18T01:32:58.241365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:58.241365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.04696","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-18T01:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zhjnQgtoi1y8sOpcEBxl6VjkChV1W983vh2cnC5BAgTt5D+wmVjFYomQMNeI5fAwzVQCztGqrCgmTZDjqlnjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:30:17.504129Z"},"content_sha256":"f087663aa9b705ab3f8985459a2fb05dd3ce3bc08e4d334e75ea47eb26d355c9","schema_version":"1.0","event_id":"sha256:f087663aa9b705ab3f8985459a2fb05dd3ce3bc08e4d334e75ea47eb26d355c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4ZSXNHTVVPD665XDEHASGS62I2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the cop number of generalized Petersen graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jonathan Guzman, Madeleine Hanson-Colvin, Nikolas Schonscheck, Robert W. Bell, Taylor Ball","submitted_at":"2015-09-15T19:42:49Z","abstract_excerpt":"We show that the cop number of every generalized Petersen graph is at most 4. The strategy is to play a modified game of cops and robbers on an infinite cyclic covering space where the objective is to capture the robber or force the robber towards an end of the infinite graph. We prove that finite isometric subtrees are 1-guardable and apply this to determine the exact cop number of some families of generalized Petersen graphs. We also extend these ideas to prove that the cop number of any connected I-graph is at most 5."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04696","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-18T01:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AekiNvvU4iIkPMszIc4BjVW40rtxVrx03jKrW34hjjcPWTzLJDwNHAvRXjLVIHX9XIupCJu8NwmbnQNaLzVeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:30:17.504501Z"},"content_sha256":"91e58e3b54fea2bb3230c0cb123bf9bf38f4225685064a43afbc8afad145a8f6","schema_version":"1.0","event_id":"sha256:91e58e3b54fea2bb3230c0cb123bf9bf38f4225685064a43afbc8afad145a8f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZSXNHTVVPD665XDEHASGS62I2/bundle.json","state_url":"https://pith.science/pith/4ZSXNHTVVPD665XDEHASGS62I2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZSXNHTVVPD665XDEHASGS62I2/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-25T05:30:17Z","links":{"resolver":"https://pith.science/pith/4ZSXNHTVVPD665XDEHASGS62I2","bundle":"https://pith.science/pith/4ZSXNHTVVPD665XDEHASGS62I2/bundle.json","state":"https://pith.science/pith/4ZSXNHTVVPD665XDEHASGS62I2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZSXNHTVVPD665XDEHASGS62I2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4ZSXNHTVVPD665XDEHASGS62I2","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":"617dddc767df8edfd1fb37b36f382e447625d3be1fcc39a4719c58c372a87324","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-15T19:42:49Z","title_canon_sha256":"a5f7a96c19eda5b0ff276fa2d04b620e7e390e3b72bc3fcc5235d8b678d87a6f"},"schema_version":"1.0","source":{"id":"1509.04696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04696","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04696v1","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04696","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"4ZSXNHTVVPD6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4ZSXNHTVVPD665XD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4ZSXNHTV","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:91e58e3b54fea2bb3230c0cb123bf9bf38f4225685064a43afbc8afad145a8f6","target":"graph","created_at":"2026-05-18T01:32: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 show that the cop number of every generalized Petersen graph is at most 4. The strategy is to play a modified game of cops and robbers on an infinite cyclic covering space where the objective is to capture the robber or force the robber towards an end of the infinite graph. We prove that finite isometric subtrees are 1-guardable and apply this to determine the exact cop number of some families of generalized Petersen graphs. We also extend these ideas to prove that the cop number of any connected I-graph is at most 5.","authors_text":"Jonathan Guzman, Madeleine Hanson-Colvin, Nikolas Schonscheck, Robert W. Bell, Taylor Ball","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-15T19:42:49Z","title":"On the cop number of generalized Petersen graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04696","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:f087663aa9b705ab3f8985459a2fb05dd3ce3bc08e4d334e75ea47eb26d355c9","target":"record","created_at":"2026-05-18T01:32: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":"617dddc767df8edfd1fb37b36f382e447625d3be1fcc39a4719c58c372a87324","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-15T19:42:49Z","title_canon_sha256":"a5f7a96c19eda5b0ff276fa2d04b620e7e390e3b72bc3fcc5235d8b678d87a6f"},"schema_version":"1.0","source":{"id":"1509.04696","kind":"arxiv","version":1}},"canonical_sha256":"e665769e75abc7ef76e321c1234bda468cbdce417b6dfb7a199b20dcae9d5d59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e665769e75abc7ef76e321c1234bda468cbdce417b6dfb7a199b20dcae9d5d59","first_computed_at":"2026-05-18T01:32:58.241365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:58.241365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WT6mE3wa0Nv+u29RTi9i4j9H/eDDHvT7GId8xB0RN+PumVPSh9W+MeFoKel4DHjoFx1gBdn+HZh4f5gpSk3wBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:58.241979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f087663aa9b705ab3f8985459a2fb05dd3ce3bc08e4d334e75ea47eb26d355c9","sha256:91e58e3b54fea2bb3230c0cb123bf9bf38f4225685064a43afbc8afad145a8f6"],"state_sha256":"a88bd8b8d0eeb494a1587f891779e9d0d515bc932e15bb147f1b9353245a1d7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcsaCr9WDw2p9QpwvimtdAgpT1MFDzPw63b0FU/5QPDscKhts3gUvWAgfRf7w1Gh1FYSxxKRvBrQ98mbsR9CCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:30:17.506490Z","bundle_sha256":"ad34b92782fbf1053eab69712e69d716e101548d0e80df409bc17ab6d955696a"}}