{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J3HBBDQAI6DKQGC2ATI7S7ATB3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8aae883f1d6adb488c511054f9fa43633ea9cf22737e46d2e578e539a0ea6120","cross_cats_sorted":["math.CO","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-18T23:01:55Z","title_canon_sha256":"b29e1d3e08b9d39d4772d0a6fca4fbe6b1e51fb55d1769db5ea54348d717b819"},"schema_version":"1.0","source":{"id":"1610.05825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05825","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05825v1","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05825","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"J3HBBDQAI6DK","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J3HBBDQAI6DKQGC2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J3HBBDQA","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:10762a0110c4954845317ef7289a4cfa22347f8e6dca589f65d4672b7ca50b58","target":"graph","created_at":"2026-05-18T01:01:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Joshua A. Grochow","cross_cats":["math.CO","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-18T23:01:55Z","title":"NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05825","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:914e627d34513e7b60143b312c50c6b7b92b75ae4c92517e7ae45ed05d6fef17","target":"record","created_at":"2026-05-18T01:01:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8aae883f1d6adb488c511054f9fa43633ea9cf22737e46d2e578e539a0ea6120","cross_cats_sorted":["math.CO","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-18T23:01:55Z","title_canon_sha256":"b29e1d3e08b9d39d4772d0a6fca4fbe6b1e51fb55d1769db5ea54348d717b819"},"schema_version":"1.0","source":{"id":"1610.05825","kind":"arxiv","version":1}},"canonical_sha256":"4ece108e004786a8185a04d1f97c130ef7f5224b2a2ddf323e0d7b27c87840ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ece108e004786a8185a04d1f97c130ef7f5224b2a2ddf323e0d7b27c87840ef","first_computed_at":"2026-05-18T01:01:51.005703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:51.005703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TVmnC5h64JR//jEwhsRwXM4dO/s/ILfNEGbQmcNKKIF8DGZ6PzLWAB3rV1rvXzzZ0wPS+Co/SG7WrNSi3H15CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:51.006411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:914e627d34513e7b60143b312c50c6b7b92b75ae4c92517e7ae45ed05d6fef17","sha256:10762a0110c4954845317ef7289a4cfa22347f8e6dca589f65d4672b7ca50b58"],"state_sha256":"94293ce88ed63975896f35edf095dcead475cc13e1d24495af8c86ae56a59e48"}