{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JAM4ZO4OTHZSTYWMYKNPYIZFKC","short_pith_number":"pith:JAM4ZO4O","schema_version":"1.0","canonical_sha256":"4819ccbb8e99f329e2ccc29afc232550b2643352d2e5ca18492326429331bbe6","source":{"kind":"arxiv","id":"2507.14321","version":1},"attestation_state":"computed","paper":{"title":"Cops and Robbers, Clique Covers, and Induced Cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexander Clow, Imed Zaguia","submitted_at":"2025-07-18T18:50:02Z","abstract_excerpt":"We consider the Cops and Robbers game played on finite simple graphs. In a graph $G$, the number of cops required to capture a robber in the Cops and Robbers game is denoted by $c(G)$. For all graphs $G$, $c(G) \\leq \\alpha(G) \\leq \\theta(G)$ where $\\alpha(G)$ and $\\theta(G)$ are the independence number and clique cover number respectively. In 2022 Turcotte asked if $c(G) < \\alpha(G)$ for all graphs with $\\alpha(G) \\geq 3$. Recently, Char, Maniya, and Pradhan proved this is false, at least when $\\alpha = 3$,by demonstrating the compliment of the Shrikhande graph has cop number and independence "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.14321","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-18T18:50:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e171013700b88ce39d80395594f23aa7e9ddeba8ac3f0bfe6deef4e1e0b93d55","abstract_canon_sha256":"33e141d56c535706c73e6db4f646d9eac8544564d3a9cf3afc85b23eed62752e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:04.281633Z","signature_b64":"gyNp+62GsdyYWvCz1fPlkkv/aHyfwR3KcK9w51Qr8OcN0z00+FYpzWGPJhpr7nlO1zbt7pS9dldouGQHhR1TAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4819ccbb8e99f329e2ccc29afc232550b2643352d2e5ca18492326429331bbe6","last_reissued_at":"2026-07-05T11:40:04.281214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:04.281214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cops and Robbers, Clique Covers, and Induced Cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexander Clow, Imed Zaguia","submitted_at":"2025-07-18T18:50:02Z","abstract_excerpt":"We consider the Cops and Robbers game played on finite simple graphs. In a graph $G$, the number of cops required to capture a robber in the Cops and Robbers game is denoted by $c(G)$. For all graphs $G$, $c(G) \\leq \\alpha(G) \\leq \\theta(G)$ where $\\alpha(G)$ and $\\theta(G)$ are the independence number and clique cover number respectively. In 2022 Turcotte asked if $c(G) < \\alpha(G)$ for all graphs with $\\alpha(G) \\geq 3$. Recently, Char, Maniya, and Pradhan proved this is false, at least when $\\alpha = 3$,by demonstrating the compliment of the Shrikhande graph has cop number and independence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.14321","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.14321/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.14321","created_at":"2026-07-05T11:40:04.281267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.14321v1","created_at":"2026-07-05T11:40:04.281267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.14321","created_at":"2026-07-05T11:40:04.281267+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAM4ZO4OTHZS","created_at":"2026-07-05T11:40:04.281267+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAM4ZO4OTHZSTYWM","created_at":"2026-07-05T11:40:04.281267+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAM4ZO4O","created_at":"2026-07-05T11:40:04.281267+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JAM4ZO4OTHZSTYWMYKNPYIZFKC","json":"https://pith.science/pith/JAM4ZO4OTHZSTYWMYKNPYIZFKC.json","graph_json":"https://pith.science/api/pith-number/JAM4ZO4OTHZSTYWMYKNPYIZFKC/graph.json","events_json":"https://pith.science/api/pith-number/JAM4ZO4OTHZSTYWMYKNPYIZFKC/events.json","paper":"https://pith.science/paper/JAM4ZO4O"},"agent_actions":{"view_html":"https://pith.science/pith/JAM4ZO4OTHZSTYWMYKNPYIZFKC","download_json":"https://pith.science/pith/JAM4ZO4OTHZSTYWMYKNPYIZFKC.json","view_paper":"https://pith.science/paper/JAM4ZO4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.14321&json=true","fetch_graph":"https://pith.science/api/pith-number/JAM4ZO4OTHZSTYWMYKNPYIZFKC/graph.json","fetch_events":"https://pith.science/api/pith-number/JAM4ZO4OTHZSTYWMYKNPYIZFKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAM4ZO4OTHZSTYWMYKNPYIZFKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAM4ZO4OTHZSTYWMYKNPYIZFKC/action/storage_attestation","attest_author":"https://pith.science/pith/JAM4ZO4OTHZSTYWMYKNPYIZFKC/action/author_attestation","sign_citation":"https://pith.science/pith/JAM4ZO4OTHZSTYWMYKNPYIZFKC/action/citation_signature","submit_replication":"https://pith.science/pith/JAM4ZO4OTHZSTYWMYKNPYIZFKC/action/replication_record"}},"created_at":"2026-07-05T11:40:04.281267+00:00","updated_at":"2026-07-05T11:40:04.281267+00:00"}