{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7PZJ622LYSDJRBOQKW46YSLJNR","short_pith_number":"pith:7PZJ622L","canonical_record":{"source":{"id":"1607.08058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-27T12:15:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"97aa8839eb9587e00d3cfdd7a78320d06b83e065c7d42374fb58024c3ffba7af","abstract_canon_sha256":"f635c018db3e3b40b9693eac48315a17b2cae42656fbe445389da16c8e55bdb2"},"schema_version":"1.0"},"canonical_sha256":"fbf29f6b4bc4869885d055b9ec49696c5b4c0ecc3ee8cb39b6091f6ee3de8f90","source":{"kind":"arxiv","id":"1607.08058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08058","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08058v1","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08058","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"7PZJ622LYSDJ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7PZJ622LYSDJRBOQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7PZJ622L","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7PZJ622LYSDJRBOQKW46YSLJNR","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-27T12:15:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"97aa8839eb9587e00d3cfdd7a78320d06b83e065c7d42374fb58024c3ffba7af","abstract_canon_sha256":"f635c018db3e3b40b9693eac48315a17b2cae42656fbe445389da16c8e55bdb2"},"schema_version":"1.0"},"canonical_sha256":"fbf29f6b4bc4869885d055b9ec49696c5b4c0ecc3ee8cb39b6091f6ee3de8f90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:11.419695Z","signature_b64":"5mGEvg1/HtH1x+hzO7KH06Hdf4j5y7MZvz3eZE10uLQpY6/XftZZSowni+ByyyCkMobCPRwJeK1nrVTFZF1eAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbf29f6b4bc4869885d055b9ec49696c5b4c0ecc3ee8cb39b6091f6ee3de8f90","last_reissued_at":"2026-05-17T23:46:11.419126Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:11.419126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08058","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-17T23:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vtzsMARCmfj9WRp4CSMoD7nHUD3R/sysqDJc4LMy4uhNTnj9IOYXGXYofc5BsBP5Q3l8Ehtrq3jWoy57Sql5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:06:56.460025Z"},"content_sha256":"ea1e2a41ab368917123348fda1704fa97f68b1143eb0be4bea1d511c7e1bd7a3","schema_version":"1.0","event_id":"sha256:ea1e2a41ab368917123348fda1704fa97f68b1143eb0be4bea1d511c7e1bd7a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7PZJ622LYSDJRBOQKW46YSLJNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cops and Robbers on Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Kratochv\\'il, Pavel Klav\\'ik, Przemys{\\l}aw Gordinowicz, Tom\\'a\\v{s} Gaven\\v{c}iak, V\\'it Jel\\'inek","submitted_at":"2016-07-27T12:15:30Z","abstract_excerpt":"The cop number of a graph $G$ is the smallest $k$ such that $k$ cops win the game of cops and robber on $G$. We investigate the maximum cop number of geometric intersection graphs, which are graphs whose vertices are represented by geometric shapes and edges by their intersections. We establish the following dichotomy for previously studied classes of intersection graphs:\n  The intersection graphs of arc-connected sets in the plane (called string graphs) have cop number at most 15, and more generally, the intersection graphs of arc-connected subsets of a surface have cop number at most $10g+15"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08058","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-17T23:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykCaDOndHaaKngo43udQGOh/EBdkHUitL9rdCZTtug+wXi65UE9XxnM6XDWYgNXYYq18Bs28r4ewe/U2lYAvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:06:56.460396Z"},"content_sha256":"01c7c2b6b1a9d6368d5fdb7055a58021f4aa2ae61c376b4d6b5d11219242e0c6","schema_version":"1.0","event_id":"sha256:01c7c2b6b1a9d6368d5fdb7055a58021f4aa2ae61c376b4d6b5d11219242e0c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PZJ622LYSDJRBOQKW46YSLJNR/bundle.json","state_url":"https://pith.science/pith/7PZJ622LYSDJRBOQKW46YSLJNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PZJ622LYSDJRBOQKW46YSLJNR/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-28T23:06:56Z","links":{"resolver":"https://pith.science/pith/7PZJ622LYSDJRBOQKW46YSLJNR","bundle":"https://pith.science/pith/7PZJ622LYSDJRBOQKW46YSLJNR/bundle.json","state":"https://pith.science/pith/7PZJ622LYSDJRBOQKW46YSLJNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PZJ622LYSDJRBOQKW46YSLJNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7PZJ622LYSDJRBOQKW46YSLJNR","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":"f635c018db3e3b40b9693eac48315a17b2cae42656fbe445389da16c8e55bdb2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-27T12:15:30Z","title_canon_sha256":"97aa8839eb9587e00d3cfdd7a78320d06b83e065c7d42374fb58024c3ffba7af"},"schema_version":"1.0","source":{"id":"1607.08058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08058","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08058v1","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08058","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"7PZJ622LYSDJ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7PZJ622LYSDJRBOQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7PZJ622L","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:01c7c2b6b1a9d6368d5fdb7055a58021f4aa2ae61c376b4d6b5d11219242e0c6","target":"graph","created_at":"2026-05-17T23:46: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":"The cop number of a graph $G$ is the smallest $k$ such that $k$ cops win the game of cops and robber on $G$. We investigate the maximum cop number of geometric intersection graphs, which are graphs whose vertices are represented by geometric shapes and edges by their intersections. We establish the following dichotomy for previously studied classes of intersection graphs:\n  The intersection graphs of arc-connected sets in the plane (called string graphs) have cop number at most 15, and more generally, the intersection graphs of arc-connected subsets of a surface have cop number at most $10g+15","authors_text":"Jan Kratochv\\'il, Pavel Klav\\'ik, Przemys{\\l}aw Gordinowicz, Tom\\'a\\v{s} Gaven\\v{c}iak, V\\'it Jel\\'inek","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-27T12:15:30Z","title":"Cops and Robbers on Intersection Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08058","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:ea1e2a41ab368917123348fda1704fa97f68b1143eb0be4bea1d511c7e1bd7a3","target":"record","created_at":"2026-05-17T23:46: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":"f635c018db3e3b40b9693eac48315a17b2cae42656fbe445389da16c8e55bdb2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-27T12:15:30Z","title_canon_sha256":"97aa8839eb9587e00d3cfdd7a78320d06b83e065c7d42374fb58024c3ffba7af"},"schema_version":"1.0","source":{"id":"1607.08058","kind":"arxiv","version":1}},"canonical_sha256":"fbf29f6b4bc4869885d055b9ec49696c5b4c0ecc3ee8cb39b6091f6ee3de8f90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbf29f6b4bc4869885d055b9ec49696c5b4c0ecc3ee8cb39b6091f6ee3de8f90","first_computed_at":"2026-05-17T23:46:11.419126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:11.419126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5mGEvg1/HtH1x+hzO7KH06Hdf4j5y7MZvz3eZE10uLQpY6/XftZZSowni+ByyyCkMobCPRwJeK1nrVTFZF1eAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:11.419695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea1e2a41ab368917123348fda1704fa97f68b1143eb0be4bea1d511c7e1bd7a3","sha256:01c7c2b6b1a9d6368d5fdb7055a58021f4aa2ae61c376b4d6b5d11219242e0c6"],"state_sha256":"e2d56aa7376f86abba546b14fe4ae90ae1757c515f6a00fb92de4979806a27ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDP9neztzjXAnzLzbtW+79VHpwdYJlmJB3zcmkESoDHd37G6xg6yrPvdHB2j7384Y5qmS1FB/zD5DRnB8z51Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:06:56.462748Z","bundle_sha256":"f254a6ab60008f7dfec6a58f006654fdd6ad8c135eac3831efb4bcbaf8524218"}}