{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JRBHET2DPLKWKGNLCOJ335DHIA","short_pith_number":"pith:JRBHET2D","canonical_record":{"source":{"id":"1605.00058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T02:53:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"95159764ca43b56ac096fce8bed7a16ac0d2cf874288b416ebb6cc22f293075d","abstract_canon_sha256":"16a253c3d506bd33d1856a7ad3a4dfd380961c7f0efd0226f9a0941e57781fe2"},"schema_version":"1.0"},"canonical_sha256":"4c42724f437ad56519ab1393bdf4674013ffec1bf80e5d8c2f6319c53250f5b0","source":{"kind":"arxiv","id":"1605.00058","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00058","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00058v2","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00058","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"JRBHET2DPLKW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JRBHET2DPLKWKGNL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JRBHET2D","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JRBHET2DPLKWKGNLCOJ335DHIA","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T02:53:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"95159764ca43b56ac096fce8bed7a16ac0d2cf874288b416ebb6cc22f293075d","abstract_canon_sha256":"16a253c3d506bd33d1856a7ad3a4dfd380961c7f0efd0226f9a0941e57781fe2"},"schema_version":"1.0"},"canonical_sha256":"4c42724f437ad56519ab1393bdf4674013ffec1bf80e5d8c2f6319c53250f5b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:12.397681Z","signature_b64":"IUmjT/hpVhqESCKOlskEGwVqz0jmsAQH4k4acPFXfc91BZDtLY0e+sZc6SF3hywVzJsl/pXEHLxw0FbYNm8XBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c42724f437ad56519ab1393bdf4674013ffec1bf80e5d8c2f6319c53250f5b0","last_reissued_at":"2026-05-18T01:00:12.396885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:12.396885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00058","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-18T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Dt+J6lYvJMIj2KHLN7QSbI1FQWaXlKqcRkZJAXo4vaj+DhhH+s8SPtTXR0bVZEq2hYZxkUxBLdMRBiuAHIeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:50:38.228975Z"},"content_sha256":"028cd5831aca8c0839ec3010187ede229d53798ce3f6b72b489a0f2a456a89ed","schema_version":"1.0","event_id":"sha256:028cd5831aca8c0839ec3010187ede229d53798ce3f6b72b489a0f2a456a89ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JRBHET2DPLKWKGNLCOJ335DHIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strongly Refuting Random CSPs Below the Spectral Threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Prasad Raghavendra, Satish Rao, Tselil Schramm","submitted_at":"2016-04-30T02:53:31Z","abstract_excerpt":"Random constraint satisfaction problems (CSPs) are known to exhibit threshold phenomena: given a uniformly random instance of a CSP with $n$ variables and $m$ clauses, there is a value of $m = \\Omega(n)$ beyond which the CSP will be unsatisfiable with high probability. Strong refutation is the problem of certifying that no variable assignment satisfies more than a constant fraction of clauses; this is the natural algorithmic problem in the unsatisfiable regime (when $m/n = \\omega(1)$).\n  Intuitively, strong refutation should become easier as the clause density $m/n$ grows, because the contradi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00058","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-18T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSWGdsbanBGVGKsZXoWH1f9RGBm/5BEf2Y0diAD7UFfG/xdIh19C0QifqX04OjtZAjDvfkfGhHubQyuTG9hhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:50:38.229344Z"},"content_sha256":"65984e81c62f6521dbb837930748722c95da8067384c66f72b62ea0ca8a49d7d","schema_version":"1.0","event_id":"sha256:65984e81c62f6521dbb837930748722c95da8067384c66f72b62ea0ca8a49d7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRBHET2DPLKWKGNLCOJ335DHIA/bundle.json","state_url":"https://pith.science/pith/JRBHET2DPLKWKGNLCOJ335DHIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRBHET2DPLKWKGNLCOJ335DHIA/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-28T11:50:38Z","links":{"resolver":"https://pith.science/pith/JRBHET2DPLKWKGNLCOJ335DHIA","bundle":"https://pith.science/pith/JRBHET2DPLKWKGNLCOJ335DHIA/bundle.json","state":"https://pith.science/pith/JRBHET2DPLKWKGNLCOJ335DHIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRBHET2DPLKWKGNLCOJ335DHIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JRBHET2DPLKWKGNLCOJ335DHIA","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":"16a253c3d506bd33d1856a7ad3a4dfd380961c7f0efd0226f9a0941e57781fe2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T02:53:31Z","title_canon_sha256":"95159764ca43b56ac096fce8bed7a16ac0d2cf874288b416ebb6cc22f293075d"},"schema_version":"1.0","source":{"id":"1605.00058","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00058","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00058v2","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00058","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"JRBHET2DPLKW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JRBHET2DPLKWKGNL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JRBHET2D","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:65984e81c62f6521dbb837930748722c95da8067384c66f72b62ea0ca8a49d7d","target":"graph","created_at":"2026-05-18T01:00:12Z","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":"Random constraint satisfaction problems (CSPs) are known to exhibit threshold phenomena: given a uniformly random instance of a CSP with $n$ variables and $m$ clauses, there is a value of $m = \\Omega(n)$ beyond which the CSP will be unsatisfiable with high probability. Strong refutation is the problem of certifying that no variable assignment satisfies more than a constant fraction of clauses; this is the natural algorithmic problem in the unsatisfiable regime (when $m/n = \\omega(1)$).\n  Intuitively, strong refutation should become easier as the clause density $m/n$ grows, because the contradi","authors_text":"Prasad Raghavendra, Satish Rao, Tselil Schramm","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T02:53:31Z","title":"Strongly Refuting Random CSPs Below the Spectral Threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00058","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:028cd5831aca8c0839ec3010187ede229d53798ce3f6b72b489a0f2a456a89ed","target":"record","created_at":"2026-05-18T01:00:12Z","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":"16a253c3d506bd33d1856a7ad3a4dfd380961c7f0efd0226f9a0941e57781fe2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T02:53:31Z","title_canon_sha256":"95159764ca43b56ac096fce8bed7a16ac0d2cf874288b416ebb6cc22f293075d"},"schema_version":"1.0","source":{"id":"1605.00058","kind":"arxiv","version":2}},"canonical_sha256":"4c42724f437ad56519ab1393bdf4674013ffec1bf80e5d8c2f6319c53250f5b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c42724f437ad56519ab1393bdf4674013ffec1bf80e5d8c2f6319c53250f5b0","first_computed_at":"2026-05-18T01:00:12.396885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:12.396885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IUmjT/hpVhqESCKOlskEGwVqz0jmsAQH4k4acPFXfc91BZDtLY0e+sZc6SF3hywVzJsl/pXEHLxw0FbYNm8XBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:12.397681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00058","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:028cd5831aca8c0839ec3010187ede229d53798ce3f6b72b489a0f2a456a89ed","sha256:65984e81c62f6521dbb837930748722c95da8067384c66f72b62ea0ca8a49d7d"],"state_sha256":"5e183f6eab3a5b3f4842980e8a2fe08dc12b383a9cb8dc8c749f82bcaa45d7b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50rmVo+HhOh5uTaquXwuMNxCpHA+4A0wd4vyMmp1CBi41PkMiI/o44mVluG1oYzBhGPMQ4StukzWhtJmnhWyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:50:38.231351Z","bundle_sha256":"a3cdfae624aac1aa76f0018c7fcacf690a7fb9cdc777a7e78309b797fe966b30"}}