{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:42LPAOY7QVDCD27ADHXNDHWASX","short_pith_number":"pith:42LPAOY7","schema_version":"1.0","canonical_sha256":"e696f03b1f854621ebe019eed19ec095e0598f4a1d9bfdc29eb9921ddb74b30e","source":{"kind":"arxiv","id":"cs/0205037","version":1},"attestation_state":"computed","paper":{"title":"A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover","license":"","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Neal Young, Samir Khuller, Uzi Vishkin","submitted_at":"2002-05-18T04:22:29Z","abstract_excerpt":"The paper describes a simple deterministic parallel/distributed (2+epsilon)-approximation algorithm for the minimum-weight vertex-cover problem and its dual (edge/element packing)."},"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":"cs/0205037","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T04:22:29Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5a12bf09d2c4538c1af178800b3b0643afd8f02e8793f124d52e20e9a6d2adeb","abstract_canon_sha256":"adb3cb52b99b1b473554c926660ffcf06216f1ea9ce5ea1d4ae40f6f67ae6a4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.965265Z","signature_b64":"TeNTdDDfcc9t1YfOAxk/aBKj/t98GUP1yVaIomy/SWfTTFzVBRxTrNpGv82EpWyrpWUqd2sjRYyhPQuXSaYXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e696f03b1f854621ebe019eed19ec095e0598f4a1d9bfdc29eb9921ddb74b30e","last_reissued_at":"2026-05-18T01:59:53.964774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.964774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover","license":"","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Neal Young, Samir Khuller, Uzi Vishkin","submitted_at":"2002-05-18T04:22:29Z","abstract_excerpt":"The paper describes a simple deterministic parallel/distributed (2+epsilon)-approximation algorithm for the minimum-weight vertex-cover problem and its dual (edge/element packing)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205037","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":"cs/0205037","created_at":"2026-05-18T01:59:53.964849+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205037v1","created_at":"2026-05-18T01:59:53.964849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205037","created_at":"2026-05-18T01:59:53.964849+00:00"},{"alias_kind":"pith_short_12","alias_value":"42LPAOY7QVDC","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"42LPAOY7QVDCD27A","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"42LPAOY7","created_at":"2026-05-18T12:25:50.845339+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/42LPAOY7QVDCD27ADHXNDHWASX","json":"https://pith.science/pith/42LPAOY7QVDCD27ADHXNDHWASX.json","graph_json":"https://pith.science/api/pith-number/42LPAOY7QVDCD27ADHXNDHWASX/graph.json","events_json":"https://pith.science/api/pith-number/42LPAOY7QVDCD27ADHXNDHWASX/events.json","paper":"https://pith.science/paper/42LPAOY7"},"agent_actions":{"view_html":"https://pith.science/pith/42LPAOY7QVDCD27ADHXNDHWASX","download_json":"https://pith.science/pith/42LPAOY7QVDCD27ADHXNDHWASX.json","view_paper":"https://pith.science/paper/42LPAOY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205037&json=true","fetch_graph":"https://pith.science/api/pith-number/42LPAOY7QVDCD27ADHXNDHWASX/graph.json","fetch_events":"https://pith.science/api/pith-number/42LPAOY7QVDCD27ADHXNDHWASX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42LPAOY7QVDCD27ADHXNDHWASX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42LPAOY7QVDCD27ADHXNDHWASX/action/storage_attestation","attest_author":"https://pith.science/pith/42LPAOY7QVDCD27ADHXNDHWASX/action/author_attestation","sign_citation":"https://pith.science/pith/42LPAOY7QVDCD27ADHXNDHWASX/action/citation_signature","submit_replication":"https://pith.science/pith/42LPAOY7QVDCD27ADHXNDHWASX/action/replication_record"}},"created_at":"2026-05-18T01:59:53.964849+00:00","updated_at":"2026-05-18T01:59:53.964849+00:00"}