{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RXST4ZDLEOJZGGCJ6XSHXA4UIR","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":"ca06274697d1e76052c7713fe1c71f7a13e7a33a5cbca3b4aae878d5c738e0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-02T05:24:25Z","title_canon_sha256":"d8355d20c6feea140553431c992760f4012189e06ce896f11bc84d03305b2cf5"},"schema_version":"1.0","source":{"id":"1202.0364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0364","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0364v1","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0364","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"RXST4ZDLEOJZ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RXST4ZDLEOJZGGCJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RXST4ZDL","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:67ac0995cd71f60bf53be631900c25dd2162123ff8675a09633f2b2f0ab52df1","target":"graph","created_at":"2026-05-18T04:03:18Z","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":"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.","authors_text":"Ton Kloks","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-02T05:24:25Z","title":"A note on probe cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0364","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:a263e562a4a09320e045ebd8012630c7e889664807f9dc1a5cc877b1a51052f7","target":"record","created_at":"2026-05-18T04:03:18Z","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":"ca06274697d1e76052c7713fe1c71f7a13e7a33a5cbca3b4aae878d5c738e0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-02T05:24:25Z","title_canon_sha256":"d8355d20c6feea140553431c992760f4012189e06ce896f11bc84d03305b2cf5"},"schema_version":"1.0","source":{"id":"1202.0364","kind":"arxiv","version":1}},"canonical_sha256":"8de53e646b2393931849f5e47b839444609ad8aab073b33626ea8ac8d713883b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8de53e646b2393931849f5e47b839444609ad8aab073b33626ea8ac8d713883b","first_computed_at":"2026-05-18T04:03:18.556849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:18.556849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sVI188yNwoV1LVdsMSKYHwUaUQUQsyy1f/wsU3ysEIepezkacDs4iuElmXRFnI+b0xAaY8XI6TVZjpGjjYZUDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:18.557508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a263e562a4a09320e045ebd8012630c7e889664807f9dc1a5cc877b1a51052f7","sha256:67ac0995cd71f60bf53be631900c25dd2162123ff8675a09633f2b2f0ab52df1"],"state_sha256":"9d7c061758316e73837a132bb2a842e6af70f4b177945236317caa3f76151a5a"}