{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TUANSWFSGR6OGOOE2JUDTT6KMD","short_pith_number":"pith:TUANSWFS","canonical_record":{"source":{"id":"1610.03029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-10T19:05:54Z","cross_cats_sorted":[],"title_canon_sha256":"886cb117b96a9388d2f2ee0469706b0624515b246cad192c875ce4fb73930bff","abstract_canon_sha256":"4cbcb002d76ba3f23294231369a111f3061d84b65f469efccc9c9efb626e1c02"},"schema_version":"1.0"},"canonical_sha256":"9d00d958b2347ce339c4d26839cfca60e912f951d8def369c82a42f41f54d2d5","source":{"kind":"arxiv","id":"1610.03029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03029","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03029v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03029","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"TUANSWFSGR6O","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TUANSWFSGR6OGOOE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TUANSWFS","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TUANSWFSGR6OGOOE2JUDTT6KMD","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-10T19:05:54Z","cross_cats_sorted":[],"title_canon_sha256":"886cb117b96a9388d2f2ee0469706b0624515b246cad192c875ce4fb73930bff","abstract_canon_sha256":"4cbcb002d76ba3f23294231369a111f3061d84b65f469efccc9c9efb626e1c02"},"schema_version":"1.0"},"canonical_sha256":"9d00d958b2347ce339c4d26839cfca60e912f951d8def369c82a42f41f54d2d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.159755Z","signature_b64":"I3L7VyAhG5601CUr1wrcBgfK46UCusYeMC2xJsVvurCdRFgaR/KhYJIHUuIwJLsFuSEHa74rIrqIH4bkPmcvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d00d958b2347ce339c4d26839cfca60e912f951d8def369c82a42f41f54d2d5","last_reissued_at":"2026-05-18T01:02:50.159355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.159355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03029","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:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lP2yf1tijJP6AnKZjTz6E9meU6iDMY7zabD68f2gEboUTbc3RjQ0Y1rwukx6eyTXaWUX9B6E2S6TijieA763Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:51:43.479678Z"},"content_sha256":"e0640834b2f98bd1cc0e471385275ff82e9bdde4cedc3ca22be32109f8900639","schema_version":"1.0","event_id":"sha256:e0640834b2f98bd1cc0e471385275ff82e9bdde4cedc3ca22be32109f8900639"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TUANSWFSGR6OGOOE2JUDTT6KMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds for CSP refutation by SDP hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Witmer, Ryuhei Mori","submitted_at":"2016-10-10T19:05:54Z","abstract_excerpt":"For a $k$-ary predicate $P$, a random instance of CSP$(P)$ with $n$ variables and $m$ constraints is unsatisfiable with high probability when $m \\gg n$. The natural algorithmic task in this regime is \\emph{refutation}: finding a proof that a given random instance is unsatisfiable. Recent work of Allen et al. suggests that the difficulty of refuting CSP$(P)$ using an SDP is determined by a parameter $\\mathrm{cmplx}(P)$, the smallest $t$ for which there does not exist a $t$-wise uniform distribution over satisfying assignments to $P$. In particular they show that random instances of CSP$(P)$ wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03029","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:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3q46+RasDJzZ179PimJ7x3HkVB3Tt/jw2dxuZhveg6VYu3d2kF6U1wEd5OYGrg9O6ZIUlEK0VGQTv0AHERZwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:51:43.480425Z"},"content_sha256":"d4fbcb2b34182f0ba91035f90acf646e99753bfe0ee5a7049453657fa9e7e213","schema_version":"1.0","event_id":"sha256:d4fbcb2b34182f0ba91035f90acf646e99753bfe0ee5a7049453657fa9e7e213"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/bundle.json","state_url":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/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-26T11:51:43Z","links":{"resolver":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD","bundle":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/bundle.json","state":"https://pith.science/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUANSWFSGR6OGOOE2JUDTT6KMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TUANSWFSGR6OGOOE2JUDTT6KMD","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":"4cbcb002d76ba3f23294231369a111f3061d84b65f469efccc9c9efb626e1c02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-10T19:05:54Z","title_canon_sha256":"886cb117b96a9388d2f2ee0469706b0624515b246cad192c875ce4fb73930bff"},"schema_version":"1.0","source":{"id":"1610.03029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03029","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03029v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03029","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"TUANSWFSGR6O","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TUANSWFSGR6OGOOE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TUANSWFS","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:d4fbcb2b34182f0ba91035f90acf646e99753bfe0ee5a7049453657fa9e7e213","target":"graph","created_at":"2026-05-18T01:02:50Z","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":"For a $k$-ary predicate $P$, a random instance of CSP$(P)$ with $n$ variables and $m$ constraints is unsatisfiable with high probability when $m \\gg n$. The natural algorithmic task in this regime is \\emph{refutation}: finding a proof that a given random instance is unsatisfiable. Recent work of Allen et al. suggests that the difficulty of refuting CSP$(P)$ using an SDP is determined by a parameter $\\mathrm{cmplx}(P)$, the smallest $t$ for which there does not exist a $t$-wise uniform distribution over satisfying assignments to $P$. In particular they show that random instances of CSP$(P)$ wit","authors_text":"David Witmer, Ryuhei Mori","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-10T19:05:54Z","title":"Lower bounds for CSP refutation by SDP hierarchies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03029","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:e0640834b2f98bd1cc0e471385275ff82e9bdde4cedc3ca22be32109f8900639","target":"record","created_at":"2026-05-18T01:02:50Z","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":"4cbcb002d76ba3f23294231369a111f3061d84b65f469efccc9c9efb626e1c02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-10T19:05:54Z","title_canon_sha256":"886cb117b96a9388d2f2ee0469706b0624515b246cad192c875ce4fb73930bff"},"schema_version":"1.0","source":{"id":"1610.03029","kind":"arxiv","version":1}},"canonical_sha256":"9d00d958b2347ce339c4d26839cfca60e912f951d8def369c82a42f41f54d2d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d00d958b2347ce339c4d26839cfca60e912f951d8def369c82a42f41f54d2d5","first_computed_at":"2026-05-18T01:02:50.159355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:50.159355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I3L7VyAhG5601CUr1wrcBgfK46UCusYeMC2xJsVvurCdRFgaR/KhYJIHUuIwJLsFuSEHa74rIrqIH4bkPmcvCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:50.159755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0640834b2f98bd1cc0e471385275ff82e9bdde4cedc3ca22be32109f8900639","sha256:d4fbcb2b34182f0ba91035f90acf646e99753bfe0ee5a7049453657fa9e7e213"],"state_sha256":"a4a720c40472e5cc4dcee4050dacabad0ca977f1f84bf2639660eea15af45e10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JE3YFMlIt5VRHdCvVQQ2THy5q4fH0m3pYcmqJnGQhZHj/qYWEGiqA/CXK6rYgiEo7scfJSWkXt+v9DzsuYO3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:51:43.484226Z","bundle_sha256":"aeb9ebd40bde76bc8d3fc06ffb932c5480d1e68ec62e726a56e7f24f7722c596"}}