{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CX4SDXDDSPOUOPM55PATFNISZQ","short_pith_number":"pith:CX4SDXDD","schema_version":"1.0","canonical_sha256":"15f921dc6393dd473d9debc132b512cc1111943eab08a5b3f401a8585d0c0547","source":{"kind":"arxiv","id":"1310.2711","version":2},"attestation_state":"computed","paper":{"title":"Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Guy Kortsarz, Mohammad T. Hajiaghayi, Rohit Khandekar","submitted_at":"2013-10-10T06:08:03Z","abstract_excerpt":"In this paper, we consider proving inapproximability in terms of OPT and thus we base the foundations of fixed parameter inapproximability."},"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":"1310.2711","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-10T06:08:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2251ffb91b3621d6dd01c147a7256467f69df1a101b742d482d8922e02e61a8b","abstract_canon_sha256":"a058d7c73c85268bee39f6fb225660933ac27348ffe2bbc02b212c8287d388e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:27.840124Z","signature_b64":"3P9ISqUfxtSUmNzQew4lgVMnguNPXT/Kl0B1/d0jo/wrFbnddCpmnoq/5uJLtMhp9YQzc2APUb70ZuV8KpN3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15f921dc6393dd473d9debc132b512cc1111943eab08a5b3f401a8585d0c0547","last_reissued_at":"2026-05-18T03:05:27.839533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:27.839533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Guy Kortsarz, Mohammad T. Hajiaghayi, Rohit Khandekar","submitted_at":"2013-10-10T06:08:03Z","abstract_excerpt":"In this paper, we consider proving inapproximability in terms of OPT and thus we base the foundations of fixed parameter inapproximability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2711","kind":"arxiv","version":2},"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":"1310.2711","created_at":"2026-05-18T03:05:27.839621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2711v2","created_at":"2026-05-18T03:05:27.839621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2711","created_at":"2026-05-18T03:05:27.839621+00:00"},{"alias_kind":"pith_short_12","alias_value":"CX4SDXDDSPOU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CX4SDXDDSPOUOPM5","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CX4SDXDD","created_at":"2026-05-18T12:27:40.988391+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/CX4SDXDDSPOUOPM55PATFNISZQ","json":"https://pith.science/pith/CX4SDXDDSPOUOPM55PATFNISZQ.json","graph_json":"https://pith.science/api/pith-number/CX4SDXDDSPOUOPM55PATFNISZQ/graph.json","events_json":"https://pith.science/api/pith-number/CX4SDXDDSPOUOPM55PATFNISZQ/events.json","paper":"https://pith.science/paper/CX4SDXDD"},"agent_actions":{"view_html":"https://pith.science/pith/CX4SDXDDSPOUOPM55PATFNISZQ","download_json":"https://pith.science/pith/CX4SDXDDSPOUOPM55PATFNISZQ.json","view_paper":"https://pith.science/paper/CX4SDXDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2711&json=true","fetch_graph":"https://pith.science/api/pith-number/CX4SDXDDSPOUOPM55PATFNISZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/CX4SDXDDSPOUOPM55PATFNISZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CX4SDXDDSPOUOPM55PATFNISZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CX4SDXDDSPOUOPM55PATFNISZQ/action/storage_attestation","attest_author":"https://pith.science/pith/CX4SDXDDSPOUOPM55PATFNISZQ/action/author_attestation","sign_citation":"https://pith.science/pith/CX4SDXDDSPOUOPM55PATFNISZQ/action/citation_signature","submit_replication":"https://pith.science/pith/CX4SDXDDSPOUOPM55PATFNISZQ/action/replication_record"}},"created_at":"2026-05-18T03:05:27.839621+00:00","updated_at":"2026-05-18T03:05:27.839621+00:00"}