{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XV7POXSIDUSPFYPNP6B3B3VG57","short_pith_number":"pith:XV7POXSI","schema_version":"1.0","canonical_sha256":"bd7ef75e481d24f2e1ed7f83b0eea6efdcd3b4a9d44c9f8ad15a89a958c068c8","source":{"kind":"arxiv","id":"1903.11484","version":1},"attestation_state":"computed","paper":{"title":"Cop number of $2K_2$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Stephen Testa, Vaidy Sivaraman","submitted_at":"2019-03-27T15:23:25Z","abstract_excerpt":"We prove that the cop number of a $2K_2$-free graph is at most $2$ if it has diameter $3$ or does not have an induced cycle of length $k$, where $k \\ \\in \\{3,4,5\\}$. We conjecture that the cop number of every $2K_2$-free graph is at most $2$."},"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":"1903.11484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-27T15:23:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ad7408e0f02408579d12811fd4ae3a7f2a7589e6c6c7f6f56e57794e915e1d74","abstract_canon_sha256":"25ad6c7a0399d37a458389dc139dadba2ea106a136c24313bda96491fcd2f26d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:03.156429Z","signature_b64":"v2/wV/hIzFNyleKf7+qqupIM9b4Urn7rA7EtwdI2HIJBzQh6E8E7dDvbr0nwGbYQFlHSCQOl/U8kIo5C9WKVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd7ef75e481d24f2e1ed7f83b0eea6efdcd3b4a9d44c9f8ad15a89a958c068c8","last_reissued_at":"2026-05-17T23:50:03.155811Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:03.155811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cop number of $2K_2$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Stephen Testa, Vaidy Sivaraman","submitted_at":"2019-03-27T15:23:25Z","abstract_excerpt":"We prove that the cop number of a $2K_2$-free graph is at most $2$ if it has diameter $3$ or does not have an induced cycle of length $k$, where $k \\ \\in \\{3,4,5\\}$. We conjecture that the cop number of every $2K_2$-free graph is at most $2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11484","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.11484","created_at":"2026-05-17T23:50:03.155882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11484v1","created_at":"2026-05-17T23:50:03.155882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11484","created_at":"2026-05-17T23:50:03.155882+00:00"},{"alias_kind":"pith_short_12","alias_value":"XV7POXSIDUSP","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XV7POXSIDUSPFYPN","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XV7POXSI","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.10941","citing_title":"Cops and Robbers on Graphs with Path Constraints","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XV7POXSIDUSPFYPNP6B3B3VG57","json":"https://pith.science/pith/XV7POXSIDUSPFYPNP6B3B3VG57.json","graph_json":"https://pith.science/api/pith-number/XV7POXSIDUSPFYPNP6B3B3VG57/graph.json","events_json":"https://pith.science/api/pith-number/XV7POXSIDUSPFYPNP6B3B3VG57/events.json","paper":"https://pith.science/paper/XV7POXSI"},"agent_actions":{"view_html":"https://pith.science/pith/XV7POXSIDUSPFYPNP6B3B3VG57","download_json":"https://pith.science/pith/XV7POXSIDUSPFYPNP6B3B3VG57.json","view_paper":"https://pith.science/paper/XV7POXSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11484&json=true","fetch_graph":"https://pith.science/api/pith-number/XV7POXSIDUSPFYPNP6B3B3VG57/graph.json","fetch_events":"https://pith.science/api/pith-number/XV7POXSIDUSPFYPNP6B3B3VG57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XV7POXSIDUSPFYPNP6B3B3VG57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XV7POXSIDUSPFYPNP6B3B3VG57/action/storage_attestation","attest_author":"https://pith.science/pith/XV7POXSIDUSPFYPNP6B3B3VG57/action/author_attestation","sign_citation":"https://pith.science/pith/XV7POXSIDUSPFYPNP6B3B3VG57/action/citation_signature","submit_replication":"https://pith.science/pith/XV7POXSIDUSPFYPNP6B3B3VG57/action/replication_record"}},"created_at":"2026-05-17T23:50:03.155882+00:00","updated_at":"2026-05-17T23:50:03.155882+00:00"}