{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U7XIHSDPVS5TWL6SN56AQETG6K","short_pith_number":"pith:U7XIHSDP","schema_version":"1.0","canonical_sha256":"a7ee83c86facbb3b2fd26f7c081266f28033bda60874458cd359b038ee6401f3","source":{"kind":"arxiv","id":"1508.02071","version":1},"attestation_state":"computed","paper":{"title":"On Percolation and $NP$-Hardness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Reichman, Igor Shinkar","submitted_at":"2015-08-09T19:03:15Z","abstract_excerpt":"We consider the robustness of computational hardness of problems whose input is obtained by applying independent random deletions to worst-case instances. For some classical $NP$-hard problems on graphs, such as Coloring, Vertex-Cover, and Hamiltonicity, we examine the complexity of these problems when edges (or vertices) of an arbitrary graph are deleted independently with probability $1-p > 0$. We prove that for $n$-vertex graphs, these problems remain as hard as in the worst-case, as long as $p > \\frac{1}{n^{1-\\epsilon}}$ for arbitrary $\\epsilon \\in (0,1)$, unless $NP \\subseteq BPP$.\n  We a"},"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":"1508.02071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-09T19:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"ef9aab8ce2368186b47e326ae0e9ec2b4774dbe5b38f3be631d777a3834df2b2","abstract_canon_sha256":"be48e91b634e7d4452487137db4730e8217a50a3d8600247d48ebc37897ff16d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:34.305345Z","signature_b64":"WF9RTF6txzTFGHVZteJmYGXAcoQj/YzU91cuuIfPQwmGJNgFS2/ItmFY2KZkkaaVM91qxAdNctsprANaK50cBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7ee83c86facbb3b2fd26f7c081266f28033bda60874458cd359b038ee6401f3","last_reissued_at":"2026-05-18T01:35:34.304639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:34.304639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Percolation and $NP$-Hardness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Reichman, Igor Shinkar","submitted_at":"2015-08-09T19:03:15Z","abstract_excerpt":"We consider the robustness of computational hardness of problems whose input is obtained by applying independent random deletions to worst-case instances. For some classical $NP$-hard problems on graphs, such as Coloring, Vertex-Cover, and Hamiltonicity, we examine the complexity of these problems when edges (or vertices) of an arbitrary graph are deleted independently with probability $1-p > 0$. We prove that for $n$-vertex graphs, these problems remain as hard as in the worst-case, as long as $p > \\frac{1}{n^{1-\\epsilon}}$ for arbitrary $\\epsilon \\in (0,1)$, unless $NP \\subseteq BPP$.\n  We a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02071","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":"1508.02071","created_at":"2026-05-18T01:35:34.304748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02071v1","created_at":"2026-05-18T01:35:34.304748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02071","created_at":"2026-05-18T01:35:34.304748+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7XIHSDPVS5T","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7XIHSDPVS5TWL6S","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7XIHSDP","created_at":"2026-05-18T12:29:44.643036+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/U7XIHSDPVS5TWL6SN56AQETG6K","json":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K.json","graph_json":"https://pith.science/api/pith-number/U7XIHSDPVS5TWL6SN56AQETG6K/graph.json","events_json":"https://pith.science/api/pith-number/U7XIHSDPVS5TWL6SN56AQETG6K/events.json","paper":"https://pith.science/paper/U7XIHSDP"},"agent_actions":{"view_html":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K","download_json":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K.json","view_paper":"https://pith.science/paper/U7XIHSDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02071&json=true","fetch_graph":"https://pith.science/api/pith-number/U7XIHSDPVS5TWL6SN56AQETG6K/graph.json","fetch_events":"https://pith.science/api/pith-number/U7XIHSDPVS5TWL6SN56AQETG6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K/action/storage_attestation","attest_author":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K/action/author_attestation","sign_citation":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K/action/citation_signature","submit_replication":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K/action/replication_record"}},"created_at":"2026-05-18T01:35:34.304748+00:00","updated_at":"2026-05-18T01:35:34.304748+00:00"}