{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J3HBBDQAI6DKQGC2ATI7S7ATB3","short_pith_number":"pith:J3HBBDQA","schema_version":"1.0","canonical_sha256":"4ece108e004786a8185a04d1f97c130ef7f5224b2a2ddf323e0d7b27c87840ef","source":{"kind":"arxiv","id":"1610.05825","version":1},"attestation_state":"computed","paper":{"title":"NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.RT"],"primary_cat":"cs.CC","authors_text":"Joshua A. Grochow","submitted_at":"2016-10-18T23:01:55Z","abstract_excerpt":"Mahaney's Theorem states that, assuming $\\mathsf{P} \\neq \\mathsf{NP}$, no NP-hard set can have a polynomially bounded number of yes-instances at each input length. We give an exposition of a very simple unpublished proof of Manindra Agrawal whose ideas appear in Agrawal-Arvind (\"Geometric sets of low information content,\" Theoret. Comp. Sci., 1996). This proof is so simple that it can easily be taught to undergraduates or a general graduate CS audience - not just theorists! - in about 10 minutes, which the author has done successfully several times. We also include applications of Mahaney's Th"},"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":"1610.05825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-18T23:01:55Z","cross_cats_sorted":["math.CO","math.RT"],"title_canon_sha256":"b29e1d3e08b9d39d4772d0a6fca4fbe6b1e51fb55d1769db5ea54348d717b819","abstract_canon_sha256":"8aae883f1d6adb488c511054f9fa43633ea9cf22737e46d2e578e539a0ea6120"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:51.006411Z","signature_b64":"TVmnC5h64JR//jEwhsRwXM4dO/s/ILfNEGbQmcNKKIF8DGZ6PzLWAB3rV1rvXzzZ0wPS+Co/SG7WrNSi3H15CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ece108e004786a8185a04d1f97c130ef7f5224b2a2ddf323e0d7b27c87840ef","last_reissued_at":"2026-05-18T01:01:51.005703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:51.005703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.RT"],"primary_cat":"cs.CC","authors_text":"Joshua A. Grochow","submitted_at":"2016-10-18T23:01:55Z","abstract_excerpt":"Mahaney's Theorem states that, assuming $\\mathsf{P} \\neq \\mathsf{NP}$, no NP-hard set can have a polynomially bounded number of yes-instances at each input length. We give an exposition of a very simple unpublished proof of Manindra Agrawal whose ideas appear in Agrawal-Arvind (\"Geometric sets of low information content,\" Theoret. Comp. Sci., 1996). This proof is so simple that it can easily be taught to undergraduates or a general graduate CS audience - not just theorists! - in about 10 minutes, which the author has done successfully several times. We also include applications of Mahaney's Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05825","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":"1610.05825","created_at":"2026-05-18T01:01:51.005821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05825v1","created_at":"2026-05-18T01:01:51.005821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05825","created_at":"2026-05-18T01:01:51.005821+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3HBBDQAI6DK","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3HBBDQAI6DKQGC2","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3HBBDQA","created_at":"2026-05-18T12:30:22.444734+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/J3HBBDQAI6DKQGC2ATI7S7ATB3","json":"https://pith.science/pith/J3HBBDQAI6DKQGC2ATI7S7ATB3.json","graph_json":"https://pith.science/api/pith-number/J3HBBDQAI6DKQGC2ATI7S7ATB3/graph.json","events_json":"https://pith.science/api/pith-number/J3HBBDQAI6DKQGC2ATI7S7ATB3/events.json","paper":"https://pith.science/paper/J3HBBDQA"},"agent_actions":{"view_html":"https://pith.science/pith/J3HBBDQAI6DKQGC2ATI7S7ATB3","download_json":"https://pith.science/pith/J3HBBDQAI6DKQGC2ATI7S7ATB3.json","view_paper":"https://pith.science/paper/J3HBBDQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05825&json=true","fetch_graph":"https://pith.science/api/pith-number/J3HBBDQAI6DKQGC2ATI7S7ATB3/graph.json","fetch_events":"https://pith.science/api/pith-number/J3HBBDQAI6DKQGC2ATI7S7ATB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3HBBDQAI6DKQGC2ATI7S7ATB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3HBBDQAI6DKQGC2ATI7S7ATB3/action/storage_attestation","attest_author":"https://pith.science/pith/J3HBBDQAI6DKQGC2ATI7S7ATB3/action/author_attestation","sign_citation":"https://pith.science/pith/J3HBBDQAI6DKQGC2ATI7S7ATB3/action/citation_signature","submit_replication":"https://pith.science/pith/J3HBBDQAI6DKQGC2ATI7S7ATB3/action/replication_record"}},"created_at":"2026-05-18T01:01:51.005821+00:00","updated_at":"2026-05-18T01:01:51.005821+00:00"}