{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TQZMBYKX24YIUXHNIDCGOEND4N","short_pith_number":"pith:TQZMBYKX","canonical_record":{"source":{"id":"1202.0042","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-31T22:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"079f008acbca8af79ed3440026be9830b9154b72e8ecbecadfa17d468bd70a35","abstract_canon_sha256":"417ea41e24c47f3169f81e6ce0124cfb6788cab37d10ba79c5e93cb513a28dab"},"schema_version":"1.0"},"canonical_sha256":"9c32c0e157d7308a5ced40c46711a3e364be1929df6098aec2ffc5c26e26f9b7","source":{"kind":"arxiv","id":"1202.0042","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0042","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0042v3","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0042","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"TQZMBYKX24YI","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TQZMBYKX24YIUXHN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TQZMBYKX","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TQZMBYKX24YIUXHNIDCGOEND4N","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0042","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-31T22:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"079f008acbca8af79ed3440026be9830b9154b72e8ecbecadfa17d468bd70a35","abstract_canon_sha256":"417ea41e24c47f3169f81e6ce0124cfb6788cab37d10ba79c5e93cb513a28dab"},"schema_version":"1.0"},"canonical_sha256":"9c32c0e157d7308a5ced40c46711a3e364be1929df6098aec2ffc5c26e26f9b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:08.704218Z","signature_b64":"hOy/nNUZ5O/Am+umEDhAP84zQLCZPtcx3UuUmPyQ0jaXQzT2+FlX1Cq0Wao/s5fNCwO34k0hnLQNzgS/O5NYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c32c0e157d7308a5ced40c46711a3e364be1929df6098aec2ffc5c26e26f9b7","last_reissued_at":"2026-05-18T04:03:08.703429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:08.703429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0042","source_version":3,"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-18T04:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+sX/lpdzJQzVoT3NLXmJvNHMvw8w/RVdo02fa/otCYHgh9nmwU1ljerZPHZa323NNVblve95nhqZUusmzXwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:01:04.849045Z"},"content_sha256":"b7e09a31d9f5ac5e44caa584dafb8f78fecfcfdecd192b4ef38fec32fe661468","schema_version":"1.0","event_id":"sha256:b7e09a31d9f5ac5e44caa584dafb8f78fecfcfdecd192b4ef38fec32fe661468"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TQZMBYKX24YIUXHNIDCGOEND4N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Harold Connamacher, Michael Molloy","submitted_at":"2012-01-31T22:13:48Z","abstract_excerpt":"We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability threshold, and for which random instances with density near that threshold appear to be computationally difficult. More formally, it is the first random CSP model for which the satisfiability threshold is known and which shares the following characteristics with random k-SAT for k >= 3. The problem is NP-complete, the satisfiability threshold occurs when there is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0042","kind":"arxiv","version":3},"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-18T04:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRtg+DecC1zNBxdZmF6FkwOk9cbieLPmDOhmhFMjtPmjcnkh6h5w0vXA8Vv0TEkiQ5czc8RSGkb/a/w8Db2fDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:01:04.849604Z"},"content_sha256":"341964c9f7598cca6e5788ab08d93280bb73ceac629c2ba83a6c196ec74a600a","schema_version":"1.0","event_id":"sha256:341964c9f7598cca6e5788ab08d93280bb73ceac629c2ba83a6c196ec74a600a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQZMBYKX24YIUXHNIDCGOEND4N/bundle.json","state_url":"https://pith.science/pith/TQZMBYKX24YIUXHNIDCGOEND4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQZMBYKX24YIUXHNIDCGOEND4N/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-01T23:01:04Z","links":{"resolver":"https://pith.science/pith/TQZMBYKX24YIUXHNIDCGOEND4N","bundle":"https://pith.science/pith/TQZMBYKX24YIUXHNIDCGOEND4N/bundle.json","state":"https://pith.science/pith/TQZMBYKX24YIUXHNIDCGOEND4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQZMBYKX24YIUXHNIDCGOEND4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TQZMBYKX24YIUXHNIDCGOEND4N","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":"417ea41e24c47f3169f81e6ce0124cfb6788cab37d10ba79c5e93cb513a28dab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-31T22:13:48Z","title_canon_sha256":"079f008acbca8af79ed3440026be9830b9154b72e8ecbecadfa17d468bd70a35"},"schema_version":"1.0","source":{"id":"1202.0042","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0042","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0042v3","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0042","created_at":"2026-05-18T04:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"TQZMBYKX24YI","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TQZMBYKX24YIUXHN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TQZMBYKX","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:341964c9f7598cca6e5788ab08d93280bb73ceac629c2ba83a6c196ec74a600a","target":"graph","created_at":"2026-05-18T04:03:08Z","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 determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability threshold, and for which random instances with density near that threshold appear to be computationally difficult. More formally, it is the first random CSP model for which the satisfiability threshold is known and which shares the following characteristics with random k-SAT for k >= 3. The problem is NP-complete, the satisfiability threshold occurs when there is","authors_text":"Harold Connamacher, Michael Molloy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-31T22:13:48Z","title":"The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0042","kind":"arxiv","version":3},"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:b7e09a31d9f5ac5e44caa584dafb8f78fecfcfdecd192b4ef38fec32fe661468","target":"record","created_at":"2026-05-18T04:03:08Z","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":"417ea41e24c47f3169f81e6ce0124cfb6788cab37d10ba79c5e93cb513a28dab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-31T22:13:48Z","title_canon_sha256":"079f008acbca8af79ed3440026be9830b9154b72e8ecbecadfa17d468bd70a35"},"schema_version":"1.0","source":{"id":"1202.0042","kind":"arxiv","version":3}},"canonical_sha256":"9c32c0e157d7308a5ced40c46711a3e364be1929df6098aec2ffc5c26e26f9b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c32c0e157d7308a5ced40c46711a3e364be1929df6098aec2ffc5c26e26f9b7","first_computed_at":"2026-05-18T04:03:08.703429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:08.703429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hOy/nNUZ5O/Am+umEDhAP84zQLCZPtcx3UuUmPyQ0jaXQzT2+FlX1Cq0Wao/s5fNCwO34k0hnLQNzgS/O5NYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:08.704218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0042","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7e09a31d9f5ac5e44caa584dafb8f78fecfcfdecd192b4ef38fec32fe661468","sha256:341964c9f7598cca6e5788ab08d93280bb73ceac629c2ba83a6c196ec74a600a"],"state_sha256":"41611fae8374af48385d788bb6fe027c52342f7acd2db2f948bd52332fe0f796"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHX3mBSPBv3RksEINDeZ1ACrP7/AUR2HkgzKfls9akglzTvOEXnp/HaifHTttWQU1h790SwnV3JIxdRE9BvjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:01:04.852792Z","bundle_sha256":"4c563413dd0421cf9913afeba5c0a0aed9a073bb4dadb47bf2ab5998f7fa8b20"}}