{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RXST4ZDLEOJZGGCJ6XSHXA4UIR","short_pith_number":"pith:RXST4ZDL","schema_version":"1.0","canonical_sha256":"8de53e646b2393931849f5e47b839444609ad8aab073b33626ea8ac8d713883b","source":{"kind":"arxiv","id":"1202.0364","version":1},"attestation_state":"computed","paper":{"title":"A note on probe cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ton Kloks","submitted_at":"2012-02-02T05:24:25Z","abstract_excerpt":"Let G be a graph and let N_1, ..., N_k be k independent sets in G. The graph G is a k-probe cograph if G can be embedded into a cograph by adding edges between vertices that are contained in the same independent set. We show that there exists an O(k n^5) algorithm to check if a graph G is a k-probe cograph."},"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":"1202.0364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-02T05:24:25Z","cross_cats_sorted":[],"title_canon_sha256":"d8355d20c6feea140553431c992760f4012189e06ce896f11bc84d03305b2cf5","abstract_canon_sha256":"ca06274697d1e76052c7713fe1c71f7a13e7a33a5cbca3b4aae878d5c738e0b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:18.557508Z","signature_b64":"sVI188yNwoV1LVdsMSKYHwUaUQUQsyy1f/wsU3ysEIepezkacDs4iuElmXRFnI+b0xAaY8XI6TVZjpGjjYZUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8de53e646b2393931849f5e47b839444609ad8aab073b33626ea8ac8d713883b","last_reissued_at":"2026-05-18T04:03:18.556849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:18.556849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on probe cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ton Kloks","submitted_at":"2012-02-02T05:24:25Z","abstract_excerpt":"Let G be a graph and let N_1, ..., N_k be k independent sets in G. The graph G is a k-probe cograph if G can be embedded into a cograph by adding edges between vertices that are contained in the same independent set. We show that there exists an O(k n^5) algorithm to check if a graph G is a k-probe cograph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0364","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":"1202.0364","created_at":"2026-05-18T04:03:18.557004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0364v1","created_at":"2026-05-18T04:03:18.557004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0364","created_at":"2026-05-18T04:03:18.557004+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXST4ZDLEOJZ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXST4ZDLEOJZGGCJ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXST4ZDL","created_at":"2026-05-18T12:27:20.899486+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/RXST4ZDLEOJZGGCJ6XSHXA4UIR","json":"https://pith.science/pith/RXST4ZDLEOJZGGCJ6XSHXA4UIR.json","graph_json":"https://pith.science/api/pith-number/RXST4ZDLEOJZGGCJ6XSHXA4UIR/graph.json","events_json":"https://pith.science/api/pith-number/RXST4ZDLEOJZGGCJ6XSHXA4UIR/events.json","paper":"https://pith.science/paper/RXST4ZDL"},"agent_actions":{"view_html":"https://pith.science/pith/RXST4ZDLEOJZGGCJ6XSHXA4UIR","download_json":"https://pith.science/pith/RXST4ZDLEOJZGGCJ6XSHXA4UIR.json","view_paper":"https://pith.science/paper/RXST4ZDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0364&json=true","fetch_graph":"https://pith.science/api/pith-number/RXST4ZDLEOJZGGCJ6XSHXA4UIR/graph.json","fetch_events":"https://pith.science/api/pith-number/RXST4ZDLEOJZGGCJ6XSHXA4UIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXST4ZDLEOJZGGCJ6XSHXA4UIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXST4ZDLEOJZGGCJ6XSHXA4UIR/action/storage_attestation","attest_author":"https://pith.science/pith/RXST4ZDLEOJZGGCJ6XSHXA4UIR/action/author_attestation","sign_citation":"https://pith.science/pith/RXST4ZDLEOJZGGCJ6XSHXA4UIR/action/citation_signature","submit_replication":"https://pith.science/pith/RXST4ZDLEOJZGGCJ6XSHXA4UIR/action/replication_record"}},"created_at":"2026-05-18T04:03:18.557004+00:00","updated_at":"2026-05-18T04:03:18.557004+00:00"}