{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YCK63SCJDQZ5OVYO5VDHURGXN2","short_pith_number":"pith:YCK63SCJ","canonical_record":{"source":{"id":"1402.4376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-18T15:50:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3793236516b7b49c61c29cc9a6462160bfbacd8ae5a853f4c94324536fbd3236","abstract_canon_sha256":"f56efea89e6db1e42813c48ef8c50090b7276189ca2cbc96d81c7004b01d023b"},"schema_version":"1.0"},"canonical_sha256":"c095edc8491c33d7570eed467a44d76e8af60f5581939dbf72cb91b7c84301cc","source":{"kind":"arxiv","id":"1402.4376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4376","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4376v2","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4376","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"YCK63SCJDQZ5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YCK63SCJDQZ5OVYO","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YCK63SCJ","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YCK63SCJDQZ5OVYO5VDHURGXN2","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-18T15:50:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3793236516b7b49c61c29cc9a6462160bfbacd8ae5a853f4c94324536fbd3236","abstract_canon_sha256":"f56efea89e6db1e42813c48ef8c50090b7276189ca2cbc96d81c7004b01d023b"},"schema_version":"1.0"},"canonical_sha256":"c095edc8491c33d7570eed467a44d76e8af60f5581939dbf72cb91b7c84301cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:53.629141Z","signature_b64":"BJHYw65kMh9TgUkQlRLBzef0SXGF6Co04RCdyduc9jNI7jld0NDUW4sQcxRJqQOgV3b2vQFE2iG1QH7FJtmyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c095edc8491c33d7570eed467a44d76e8af60f5581939dbf72cb91b7c84301cc","last_reissued_at":"2026-05-18T02:49:53.628525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:53.628525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4376","source_version":2,"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-18T02:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9D66CSiyNfAAxUMGozChNcNEDvyhBH2u5nMCYhl+LPr9AP5/sdVpZVy1lz3OcLFCOFCRMAJNQ/j4mECkcGKmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:35:48.195546Z"},"content_sha256":"4706ed83a0dee0165901801d2069b2c36d2273ff7ae964a51ab25b3043c12bc5","schema_version":"1.0","event_id":"sha256:4706ed83a0dee0165901801d2069b2c36d2273ff7ae964a51ab25b3043c12bc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YCK63SCJDQZ5OVYO5VDHURGXN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Coloring Resilient Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jeremy Kun, Lev Reyzin","submitted_at":"2014-02-18T15:50:15Z","abstract_excerpt":"We introduce a new notion of resilience for constraint satisfaction problems, with the goal of more precisely determining the boundary between NP-hardness and the existence of efficient algorithms for resilient instances. In particular, we study $r$-resiliently $k$-colorable graphs, which are those $k$-colorable graphs that remain $k$-colorable even after the addition of any $r$ new edges. We prove lower bounds on the NP-hardness of coloring resiliently colorable graphs, and provide an algorithm that colors sufficiently resilient graphs. We also analyze the corresponding notion of resilience f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4376","kind":"arxiv","version":2},"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-18T02:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbTD1f/wIFsbRzT/iPkOnV/4xcyiRkRMWh+DlRLcPwU7HBX7SQDTMRbtUbmFC1xMZ3rhLfYgX+mSa7fNizFICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:35:48.195881Z"},"content_sha256":"3b725276e5c930923e8455d4a78902bb8ce9d5faa16dfe8f1ecef1af3eddd38f","schema_version":"1.0","event_id":"sha256:3b725276e5c930923e8455d4a78902bb8ce9d5faa16dfe8f1ecef1af3eddd38f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YCK63SCJDQZ5OVYO5VDHURGXN2/bundle.json","state_url":"https://pith.science/pith/YCK63SCJDQZ5OVYO5VDHURGXN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YCK63SCJDQZ5OVYO5VDHURGXN2/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-06-02T02:35:48Z","links":{"resolver":"https://pith.science/pith/YCK63SCJDQZ5OVYO5VDHURGXN2","bundle":"https://pith.science/pith/YCK63SCJDQZ5OVYO5VDHURGXN2/bundle.json","state":"https://pith.science/pith/YCK63SCJDQZ5OVYO5VDHURGXN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YCK63SCJDQZ5OVYO5VDHURGXN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YCK63SCJDQZ5OVYO5VDHURGXN2","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":"f56efea89e6db1e42813c48ef8c50090b7276189ca2cbc96d81c7004b01d023b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-18T15:50:15Z","title_canon_sha256":"3793236516b7b49c61c29cc9a6462160bfbacd8ae5a853f4c94324536fbd3236"},"schema_version":"1.0","source":{"id":"1402.4376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4376","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4376v2","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4376","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"YCK63SCJDQZ5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YCK63SCJDQZ5OVYO","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YCK63SCJ","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:3b725276e5c930923e8455d4a78902bb8ce9d5faa16dfe8f1ecef1af3eddd38f","target":"graph","created_at":"2026-05-18T02:49:53Z","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 introduce a new notion of resilience for constraint satisfaction problems, with the goal of more precisely determining the boundary between NP-hardness and the existence of efficient algorithms for resilient instances. In particular, we study $r$-resiliently $k$-colorable graphs, which are those $k$-colorable graphs that remain $k$-colorable even after the addition of any $r$ new edges. We prove lower bounds on the NP-hardness of coloring resiliently colorable graphs, and provide an algorithm that colors sufficiently resilient graphs. We also analyze the corresponding notion of resilience f","authors_text":"Jeremy Kun, Lev Reyzin","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-18T15:50:15Z","title":"On Coloring Resilient Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4376","kind":"arxiv","version":2},"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:4706ed83a0dee0165901801d2069b2c36d2273ff7ae964a51ab25b3043c12bc5","target":"record","created_at":"2026-05-18T02:49:53Z","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":"f56efea89e6db1e42813c48ef8c50090b7276189ca2cbc96d81c7004b01d023b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-18T15:50:15Z","title_canon_sha256":"3793236516b7b49c61c29cc9a6462160bfbacd8ae5a853f4c94324536fbd3236"},"schema_version":"1.0","source":{"id":"1402.4376","kind":"arxiv","version":2}},"canonical_sha256":"c095edc8491c33d7570eed467a44d76e8af60f5581939dbf72cb91b7c84301cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c095edc8491c33d7570eed467a44d76e8af60f5581939dbf72cb91b7c84301cc","first_computed_at":"2026-05-18T02:49:53.628525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:53.628525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BJHYw65kMh9TgUkQlRLBzef0SXGF6Co04RCdyduc9jNI7jld0NDUW4sQcxRJqQOgV3b2vQFE2iG1QH7FJtmyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:53.629141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4706ed83a0dee0165901801d2069b2c36d2273ff7ae964a51ab25b3043c12bc5","sha256:3b725276e5c930923e8455d4a78902bb8ce9d5faa16dfe8f1ecef1af3eddd38f"],"state_sha256":"1ae21b866d2cea86770fa6f50b579227826eac1953264f4a1f654b90aa1c506f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bl5dbcteG9jNkJLXx7BrMmq7q5xrResiW7iCxNEpl9898FDLyElG7uunzsH2IUraIdyTMJ+AdYU2X97LQwGTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:35:48.197752Z","bundle_sha256":"882f84a7a20335a1db47b3a2a26c4531ca305b0e7fd502ce542d300e90d18b64"}}