{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PKD6CYEEGHGUNCIM4PZHSMPYJH","short_pith_number":"pith:PKD6CYEE","schema_version":"1.0","canonical_sha256":"7a87e1608431cd46890ce3f27931f849e34d37e49626fc218ec839e6644a1041","source":{"kind":"arxiv","id":"1008.3216","version":1},"attestation_state":"computed","paper":{"title":"An approximation algorithm for the total cover problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pooya Hatami","submitted_at":"2010-08-19T04:51:15Z","abstract_excerpt":"We introduce a $2$-approximation algorithm for the minimum total covering number problem."},"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":"1008.3216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-19T04:51:15Z","cross_cats_sorted":[],"title_canon_sha256":"a0c874a6dc2399b80bf2ce5ec285a94d6b2a2c18412f7b4e379c4f12930b17d1","abstract_canon_sha256":"de8ad54d98bdc51186b9db61d140bd8ecdf746b7aaf524bc7498a65ac17d836c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.106012Z","signature_b64":"SURq2sim4Lhv83RrDYD6JfGPyTWcEVkiTSRoqlGNmbolK7FE8wcTJO4C+G3QRct6Jo3gX8o2hYiFwt2YSbWxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a87e1608431cd46890ce3f27931f849e34d37e49626fc218ec839e6644a1041","last_reissued_at":"2026-05-18T04:42:03.105602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.105602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An approximation algorithm for the total cover problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pooya Hatami","submitted_at":"2010-08-19T04:51:15Z","abstract_excerpt":"We introduce a $2$-approximation algorithm for the minimum total covering number problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3216","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":"1008.3216","created_at":"2026-05-18T04:42:03.105669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3216v1","created_at":"2026-05-18T04:42:03.105669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3216","created_at":"2026-05-18T04:42:03.105669+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKD6CYEEGHGU","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKD6CYEEGHGUNCIM","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKD6CYEE","created_at":"2026-05-18T12:26:12.377268+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/PKD6CYEEGHGUNCIM4PZHSMPYJH","json":"https://pith.science/pith/PKD6CYEEGHGUNCIM4PZHSMPYJH.json","graph_json":"https://pith.science/api/pith-number/PKD6CYEEGHGUNCIM4PZHSMPYJH/graph.json","events_json":"https://pith.science/api/pith-number/PKD6CYEEGHGUNCIM4PZHSMPYJH/events.json","paper":"https://pith.science/paper/PKD6CYEE"},"agent_actions":{"view_html":"https://pith.science/pith/PKD6CYEEGHGUNCIM4PZHSMPYJH","download_json":"https://pith.science/pith/PKD6CYEEGHGUNCIM4PZHSMPYJH.json","view_paper":"https://pith.science/paper/PKD6CYEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3216&json=true","fetch_graph":"https://pith.science/api/pith-number/PKD6CYEEGHGUNCIM4PZHSMPYJH/graph.json","fetch_events":"https://pith.science/api/pith-number/PKD6CYEEGHGUNCIM4PZHSMPYJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKD6CYEEGHGUNCIM4PZHSMPYJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKD6CYEEGHGUNCIM4PZHSMPYJH/action/storage_attestation","attest_author":"https://pith.science/pith/PKD6CYEEGHGUNCIM4PZHSMPYJH/action/author_attestation","sign_citation":"https://pith.science/pith/PKD6CYEEGHGUNCIM4PZHSMPYJH/action/citation_signature","submit_replication":"https://pith.science/pith/PKD6CYEEGHGUNCIM4PZHSMPYJH/action/replication_record"}},"created_at":"2026-05-18T04:42:03.105669+00:00","updated_at":"2026-05-18T04:42:03.105669+00:00"}