{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MPLKZQEMUVCX3SPM7WZTRM2UE5","short_pith_number":"pith:MPLKZQEM","schema_version":"1.0","canonical_sha256":"63d6acc08ca5457dc9ecfdb338b3542764e18614a885071beab0aae09e9e67fc","source":{"kind":"arxiv","id":"1303.1671","version":1},"attestation_state":"computed","paper":{"title":"Another Disjoint Compression Algorithm for OCT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"N.S.Narayanaswamy, R.Krithika","submitted_at":"2013-03-07T12:58:35Z","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."},"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":"1303.1671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-07T12:58:35Z","cross_cats_sorted":[],"title_canon_sha256":"0e4d7804bab7ee1d204a459b7f0a593e95a6fdacc40166460aa5ff066c52ebdd","abstract_canon_sha256":"ad6fe465d1dca68f7cbd279c759ca4c13ed343d5647a538e209a26e2b9cd767e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:33.495258Z","signature_b64":"4IsxAYQcHCpcW7Whhg0pXAM0SWAggfQrI7Q7sG2vmI3eR1yP5rRjmK9/GXcSxLmkxBqCTTN4GMMSXObDcXvXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63d6acc08ca5457dc9ecfdb338b3542764e18614a885071beab0aae09e9e67fc","last_reissued_at":"2026-05-18T03:31:33.494660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:33.494660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Another Disjoint Compression Algorithm for OCT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"N.S.Narayanaswamy, R.Krithika","submitted_at":"2013-03-07T12:58:35Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1671","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":"1303.1671","created_at":"2026-05-18T03:31:33.494759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1671v1","created_at":"2026-05-18T03:31:33.494759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1671","created_at":"2026-05-18T03:31:33.494759+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPLKZQEMUVCX","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPLKZQEMUVCX3SPM","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPLKZQEM","created_at":"2026-05-18T12:27:52.871228+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/MPLKZQEMUVCX3SPM7WZTRM2UE5","json":"https://pith.science/pith/MPLKZQEMUVCX3SPM7WZTRM2UE5.json","graph_json":"https://pith.science/api/pith-number/MPLKZQEMUVCX3SPM7WZTRM2UE5/graph.json","events_json":"https://pith.science/api/pith-number/MPLKZQEMUVCX3SPM7WZTRM2UE5/events.json","paper":"https://pith.science/paper/MPLKZQEM"},"agent_actions":{"view_html":"https://pith.science/pith/MPLKZQEMUVCX3SPM7WZTRM2UE5","download_json":"https://pith.science/pith/MPLKZQEMUVCX3SPM7WZTRM2UE5.json","view_paper":"https://pith.science/paper/MPLKZQEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1671&json=true","fetch_graph":"https://pith.science/api/pith-number/MPLKZQEMUVCX3SPM7WZTRM2UE5/graph.json","fetch_events":"https://pith.science/api/pith-number/MPLKZQEMUVCX3SPM7WZTRM2UE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPLKZQEMUVCX3SPM7WZTRM2UE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPLKZQEMUVCX3SPM7WZTRM2UE5/action/storage_attestation","attest_author":"https://pith.science/pith/MPLKZQEMUVCX3SPM7WZTRM2UE5/action/author_attestation","sign_citation":"https://pith.science/pith/MPLKZQEMUVCX3SPM7WZTRM2UE5/action/citation_signature","submit_replication":"https://pith.science/pith/MPLKZQEMUVCX3SPM7WZTRM2UE5/action/replication_record"}},"created_at":"2026-05-18T03:31:33.494759+00:00","updated_at":"2026-05-18T03:31:33.494759+00:00"}