{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BZCNYKGP5WYOS7M7SMGMHJUVWF","short_pith_number":"pith:BZCNYKGP","canonical_record":{"source":{"id":"1701.06258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-23T02:52:45Z","cross_cats_sorted":[],"title_canon_sha256":"71c73ec7e0a324d09e3aba3c4ab859ece4154c6dee5f13e8134da29d2925cb1e","abstract_canon_sha256":"f01a80c74d9f531321f02b7ac3b1a20dea231a0b976e5a5a52c6d2f570db81b9"},"schema_version":"1.0"},"canonical_sha256":"0e44dc28cfedb0e97d9f930cc3a695b167a9683a23af24b28d23f58ec5af4e42","source":{"kind":"arxiv","id":"1701.06258","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06258","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06258v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06258","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"BZCNYKGP5WYO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BZCNYKGP5WYOS7M7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BZCNYKGP","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BZCNYKGP5WYOS7M7SMGMHJUVWF","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-23T02:52:45Z","cross_cats_sorted":[],"title_canon_sha256":"71c73ec7e0a324d09e3aba3c4ab859ece4154c6dee5f13e8134da29d2925cb1e","abstract_canon_sha256":"f01a80c74d9f531321f02b7ac3b1a20dea231a0b976e5a5a52c6d2f570db81b9"},"schema_version":"1.0"},"canonical_sha256":"0e44dc28cfedb0e97d9f930cc3a695b167a9683a23af24b28d23f58ec5af4e42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:18.836406Z","signature_b64":"KAknb2BwJ9MxkIVTJ6TjlWjzTckGyjC5D6bvy014r4fqhcCaA/BYn+jzih2q4pWrEmnsMOp2XWWPDlRybz0VCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e44dc28cfedb0e97d9f930cc3a695b167a9683a23af24b28d23f58ec5af4e42","last_reissued_at":"2026-05-18T00:52:18.835909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:18.835909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06258","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-18T00:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLih4NaU6uoSTEwh7/kRI67WeY7NcSb4ATCr4YF+s3/HZg9MVgLSS2zGYvk0TfL5NM7hVfyCTqFLiibMc0BMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:31:53.929795Z"},"content_sha256":"052f3fcb07b9f7590f036ac436505b14bef6d257fafc705a3caab7650ea90069","schema_version":"1.0","event_id":"sha256:052f3fcb07b9f7590f036ac436505b14bef6d257fafc705a3caab7650ea90069"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BZCNYKGP5WYOS7M7SMGMHJUVWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General Bounds on Satisfiability Thresholds for Random CSPs via Fourier Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Colin Wei, Stefano Ermon","submitted_at":"2017-01-23T02:52:45Z","abstract_excerpt":"Random constraint satisfaction problems (CSPs) have been widely studied both in AI and complexity theory. Empirically and theoretically, many random CSPs have been shown to exhibit a phase transition. As the ratio of constraints to variables passes certain thresholds, they transition from being almost certainly satisfiable to unsatisfiable. The exact location of this threshold has been thoroughly investigated, but only for certain common classes of constraints. In this paper, we present new bounds for the location of these thresholds in boolean CSPs. Our main contribution is that our bounds ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06258","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-18T00:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5btcoA9cSeSuEZQqB55itzYX2jY66Aoxf1mGMRKcXB1BK/6x5wImOod9U5Dkiqly38Say5ktEjbtqJPzgZcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:31:53.930136Z"},"content_sha256":"44b437bba546c17e822b1b8f737ef9b52532b2452c571da8e4f57dcdc09312bf","schema_version":"1.0","event_id":"sha256:44b437bba546c17e822b1b8f737ef9b52532b2452c571da8e4f57dcdc09312bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZCNYKGP5WYOS7M7SMGMHJUVWF/bundle.json","state_url":"https://pith.science/pith/BZCNYKGP5WYOS7M7SMGMHJUVWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZCNYKGP5WYOS7M7SMGMHJUVWF/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-03T04:31:53Z","links":{"resolver":"https://pith.science/pith/BZCNYKGP5WYOS7M7SMGMHJUVWF","bundle":"https://pith.science/pith/BZCNYKGP5WYOS7M7SMGMHJUVWF/bundle.json","state":"https://pith.science/pith/BZCNYKGP5WYOS7M7SMGMHJUVWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZCNYKGP5WYOS7M7SMGMHJUVWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BZCNYKGP5WYOS7M7SMGMHJUVWF","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":"f01a80c74d9f531321f02b7ac3b1a20dea231a0b976e5a5a52c6d2f570db81b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-23T02:52:45Z","title_canon_sha256":"71c73ec7e0a324d09e3aba3c4ab859ece4154c6dee5f13e8134da29d2925cb1e"},"schema_version":"1.0","source":{"id":"1701.06258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06258","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06258v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06258","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"BZCNYKGP5WYO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BZCNYKGP5WYOS7M7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BZCNYKGP","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:44b437bba546c17e822b1b8f737ef9b52532b2452c571da8e4f57dcdc09312bf","target":"graph","created_at":"2026-05-18T00:52:18Z","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) have been widely studied both in AI and complexity theory. Empirically and theoretically, many random CSPs have been shown to exhibit a phase transition. As the ratio of constraints to variables passes certain thresholds, they transition from being almost certainly satisfiable to unsatisfiable. The exact location of this threshold has been thoroughly investigated, but only for certain common classes of constraints. In this paper, we present new bounds for the location of these thresholds in boolean CSPs. Our main contribution is that our bounds ar","authors_text":"Colin Wei, Stefano Ermon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-23T02:52:45Z","title":"General Bounds on Satisfiability Thresholds for Random CSPs via Fourier Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06258","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:052f3fcb07b9f7590f036ac436505b14bef6d257fafc705a3caab7650ea90069","target":"record","created_at":"2026-05-18T00:52:18Z","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":"f01a80c74d9f531321f02b7ac3b1a20dea231a0b976e5a5a52c6d2f570db81b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-23T02:52:45Z","title_canon_sha256":"71c73ec7e0a324d09e3aba3c4ab859ece4154c6dee5f13e8134da29d2925cb1e"},"schema_version":"1.0","source":{"id":"1701.06258","kind":"arxiv","version":1}},"canonical_sha256":"0e44dc28cfedb0e97d9f930cc3a695b167a9683a23af24b28d23f58ec5af4e42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e44dc28cfedb0e97d9f930cc3a695b167a9683a23af24b28d23f58ec5af4e42","first_computed_at":"2026-05-18T00:52:18.835909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:18.835909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KAknb2BwJ9MxkIVTJ6TjlWjzTckGyjC5D6bvy014r4fqhcCaA/BYn+jzih2q4pWrEmnsMOp2XWWPDlRybz0VCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:18.836406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:052f3fcb07b9f7590f036ac436505b14bef6d257fafc705a3caab7650ea90069","sha256:44b437bba546c17e822b1b8f737ef9b52532b2452c571da8e4f57dcdc09312bf"],"state_sha256":"e9432cc77a1c4b5e1a3f52013ba7ee8dacd344dc92f5b6797254fe3253b196e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fR+pCEaod/etKePrX29hKGam7ucWxOmdWwE2REcvSz4jMZfIvd/RJPmbgA2LMTnfKqiCmQhlLMBAfNJlzi+GCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:31:53.932074Z","bundle_sha256":"d6ab4ce5c13cf5d037951b71a9f52d62ad2d754770a920831eb9b0e7488079b6"}}