{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MPLKZQEMUVCX3SPM7WZTRM2UE5","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":"ad6fe465d1dca68f7cbd279c759ca4c13ed343d5647a538e209a26e2b9cd767e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-07T12:58:35Z","title_canon_sha256":"0e4d7804bab7ee1d204a459b7f0a593e95a6fdacc40166460aa5ff066c52ebdd"},"schema_version":"1.0","source":{"id":"1303.1671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1671","created_at":"2026-05-18T03:31:33Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1671v1","created_at":"2026-05-18T03:31:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1671","created_at":"2026-05-18T03:31:33Z"},{"alias_kind":"pith_short_12","alias_value":"MPLKZQEMUVCX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MPLKZQEMUVCX3SPM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MPLKZQEM","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:a8b468e432b5509bddcbbd5dae66f34468f24ff7fb63427b4949be8df39a2882","target":"graph","created_at":"2026-05-18T03:31:33Z","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":"We describe an elegant O*(2^k) algorithm for the disjoint compression problem for Odd Cycle Transversal based on a reduction to Above Guarantee Vertex Cover. We believe that this algorithm refines the understanding of the Odd Cycle Transversal algorithm by Reed, Smith and Vetta.","authors_text":"N.S.Narayanaswamy, R.Krithika","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-07T12:58:35Z","title":"Another Disjoint Compression Algorithm for OCT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1671","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:7199684701eba4a366d0ad08d1819d08d698aec573ce5e711f5b103efe9f32bc","target":"record","created_at":"2026-05-18T03:31:33Z","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":"ad6fe465d1dca68f7cbd279c759ca4c13ed343d5647a538e209a26e2b9cd767e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-07T12:58:35Z","title_canon_sha256":"0e4d7804bab7ee1d204a459b7f0a593e95a6fdacc40166460aa5ff066c52ebdd"},"schema_version":"1.0","source":{"id":"1303.1671","kind":"arxiv","version":1}},"canonical_sha256":"63d6acc08ca5457dc9ecfdb338b3542764e18614a885071beab0aae09e9e67fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63d6acc08ca5457dc9ecfdb338b3542764e18614a885071beab0aae09e9e67fc","first_computed_at":"2026-05-18T03:31:33.494660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:33.494660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4IsxAYQcHCpcW7Whhg0pXAM0SWAggfQrI7Q7sG2vmI3eR1yP5rRjmK9/GXcSxLmkxBqCTTN4GMMSXObDcXvXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:33.495258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7199684701eba4a366d0ad08d1819d08d698aec573ce5e711f5b103efe9f32bc","sha256:a8b468e432b5509bddcbbd5dae66f34468f24ff7fb63427b4949be8df39a2882"],"state_sha256":"3e485926dc750ef2c4563dbd1f494c68eb943de88c5d21204f1224cffdfad6e7"}