{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GOMPUG464ZHLZBF3ZYGELAH5IU","short_pith_number":"pith:GOMPUG46","schema_version":"1.0","canonical_sha256":"3398fa1b9ee64ebc84bbce0c4580fd452ad7ea78bc564b063859021ff28df480","source":{"kind":"arxiv","id":"1204.5666","version":1},"attestation_state":"computed","paper":{"title":"A new point of NP-hardness for 2-to-1 Label Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"John Wright, Per Austrin, Ryan O'Donnell","submitted_at":"2012-04-25T14:20:23Z","abstract_excerpt":"We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a $(23/24 + \\eps)$-satisfying assignment."},"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":"1204.5666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-25T14:20:23Z","cross_cats_sorted":[],"title_canon_sha256":"24459e23a67e614af25f994d02a72e5e09d49acc8bee79cbba650f7526743b2f","abstract_canon_sha256":"70e600eb91c8fdf48b6cf3f4495d2387885d1b6e9e94283dd63210a5320be46f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:01.706009Z","signature_b64":"tgGKyXw5GupZUG6F1F5UC3O+RyY/0hvWRzA0xmJgfZa3Whguivv++Dzr0VRcZWLcyNQ9fFMxn8zSg5wCT9sJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3398fa1b9ee64ebc84bbce0c4580fd452ad7ea78bc564b063859021ff28df480","last_reissued_at":"2026-05-18T03:57:01.705046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:01.705046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new point of NP-hardness for 2-to-1 Label Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"John Wright, Per Austrin, Ryan O'Donnell","submitted_at":"2012-04-25T14:20:23Z","abstract_excerpt":"We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a $(23/24 + \\eps)$-satisfying assignment."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5666","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":"1204.5666","created_at":"2026-05-18T03:57:01.705205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5666v1","created_at":"2026-05-18T03:57:01.705205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5666","created_at":"2026-05-18T03:57:01.705205+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOMPUG464ZHL","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOMPUG464ZHLZBF3","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOMPUG46","created_at":"2026-05-18T12:27:06.952714+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/GOMPUG464ZHLZBF3ZYGELAH5IU","json":"https://pith.science/pith/GOMPUG464ZHLZBF3ZYGELAH5IU.json","graph_json":"https://pith.science/api/pith-number/GOMPUG464ZHLZBF3ZYGELAH5IU/graph.json","events_json":"https://pith.science/api/pith-number/GOMPUG464ZHLZBF3ZYGELAH5IU/events.json","paper":"https://pith.science/paper/GOMPUG46"},"agent_actions":{"view_html":"https://pith.science/pith/GOMPUG464ZHLZBF3ZYGELAH5IU","download_json":"https://pith.science/pith/GOMPUG464ZHLZBF3ZYGELAH5IU.json","view_paper":"https://pith.science/paper/GOMPUG46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5666&json=true","fetch_graph":"https://pith.science/api/pith-number/GOMPUG464ZHLZBF3ZYGELAH5IU/graph.json","fetch_events":"https://pith.science/api/pith-number/GOMPUG464ZHLZBF3ZYGELAH5IU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOMPUG464ZHLZBF3ZYGELAH5IU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOMPUG464ZHLZBF3ZYGELAH5IU/action/storage_attestation","attest_author":"https://pith.science/pith/GOMPUG464ZHLZBF3ZYGELAH5IU/action/author_attestation","sign_citation":"https://pith.science/pith/GOMPUG464ZHLZBF3ZYGELAH5IU/action/citation_signature","submit_replication":"https://pith.science/pith/GOMPUG464ZHLZBF3ZYGELAH5IU/action/replication_record"}},"created_at":"2026-05-18T03:57:01.705205+00:00","updated_at":"2026-05-18T03:57:01.705205+00:00"}