{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U7XIHSDPVS5TWL6SN56AQETG6K","short_pith_number":"pith:U7XIHSDP","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"},"canonical_sha256":"a7ee83c86facbb3b2fd26f7c081266f28033bda60874458cd359b038ee6401f3","source":{"kind":"arxiv","id":"1508.02071","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02071","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02071v1","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02071","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"U7XIHSDPVS5T","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U7XIHSDPVS5TWL6S","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U7XIHSDP","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U7XIHSDPVS5TWL6SN56AQETG6K","target":"record","payload":{"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"},"canonical_sha256":"a7ee83c86facbb3b2fd26f7c081266f28033bda60874458cd359b038ee6401f3","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"},"source_kind":"arxiv","source_id":"1508.02071","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6xvpPCTjWHZpdkkwFKtc2AmSdbgiKwk28dSH6TkOcWMAMawai8Doyq1m//EEYKa7c4CHiThtJ25nSclUpJ/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:37:12.189823Z"},"content_sha256":"0ac02d9da485bde05943558c94d5810374bf569d2463289277fbe811e988b5bc","schema_version":"1.0","event_id":"sha256:0ac02d9da485bde05943558c94d5810374bf569d2463289277fbe811e988b5bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U7XIHSDPVS5TWL6SN56AQETG6K","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVX/gLUlONwa2VYEza98pf3ZQ7LDIUFZqjkyCZ2BtCPhnuKqZQrWijWVQgHW0TUWg5nAXq7S1q+BEyjB14sMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:37:12.190470Z"},"content_sha256":"6433c4bb234b8049d75885a5584169c5ea9bb1bf538b04315c75ce5c676fc11c","schema_version":"1.0","event_id":"sha256:6433c4bb234b8049d75885a5584169c5ea9bb1bf538b04315c75ce5c676fc11c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K/bundle.json","state_url":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7XIHSDPVS5TWL6SN56AQETG6K/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T14:37:12Z","links":{"resolver":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K","bundle":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K/bundle.json","state":"https://pith.science/pith/U7XIHSDPVS5TWL6SN56AQETG6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7XIHSDPVS5TWL6SN56AQETG6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U7XIHSDPVS5TWL6SN56AQETG6K","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":"be48e91b634e7d4452487137db4730e8217a50a3d8600247d48ebc37897ff16d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-09T19:03:15Z","title_canon_sha256":"ef9aab8ce2368186b47e326ae0e9ec2b4774dbe5b38f3be631d777a3834df2b2"},"schema_version":"1.0","source":{"id":"1508.02071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02071","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02071v1","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02071","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"U7XIHSDPVS5T","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U7XIHSDPVS5TWL6S","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U7XIHSDP","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:6433c4bb234b8049d75885a5584169c5ea9bb1bf538b04315c75ce5c676fc11c","target":"graph","created_at":"2026-05-18T01:35:34Z","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":"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","authors_text":"Daniel Reichman, Igor Shinkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-09T19:03:15Z","title":"On Percolation and $NP$-Hardness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02071","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:0ac02d9da485bde05943558c94d5810374bf569d2463289277fbe811e988b5bc","target":"record","created_at":"2026-05-18T01:35:34Z","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":"be48e91b634e7d4452487137db4730e8217a50a3d8600247d48ebc37897ff16d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-09T19:03:15Z","title_canon_sha256":"ef9aab8ce2368186b47e326ae0e9ec2b4774dbe5b38f3be631d777a3834df2b2"},"schema_version":"1.0","source":{"id":"1508.02071","kind":"arxiv","version":1}},"canonical_sha256":"a7ee83c86facbb3b2fd26f7c081266f28033bda60874458cd359b038ee6401f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7ee83c86facbb3b2fd26f7c081266f28033bda60874458cd359b038ee6401f3","first_computed_at":"2026-05-18T01:35:34.304639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:34.304639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WF9RTF6txzTFGHVZteJmYGXAcoQj/YzU91cuuIfPQwmGJNgFS2/ItmFY2KZkkaaVM91qxAdNctsprANaK50cBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:34.305345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ac02d9da485bde05943558c94d5810374bf569d2463289277fbe811e988b5bc","sha256:6433c4bb234b8049d75885a5584169c5ea9bb1bf538b04315c75ce5c676fc11c"],"state_sha256":"483ac50d825b55939e44929e6f8c99e60672b8bf68c1a634e8c588b3c97263cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxZPt9g4d27XNkSbs/Jycc/u0fQ+Kmpkr9vVMxyGoVOw8jZ5RTHOkpJEF6WL5DZGzHFNr2SSDdHo8RBR4sdsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:37:12.194040Z","bundle_sha256":"d78d74762541b9496730a772d277b34e9a908c6c57e1b64d665628ba775cd18f"}}