{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VXFBIH4LRPW4UXKOBSSET2IFFZ","short_pith_number":"pith:VXFBIH4L","canonical_record":{"source":{"id":"1212.1942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-12-10T00:20:45Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"2865877d2eecd3fae2efe22082bc960edbfc8123883eb2dfa96ee82d8bb3804f","abstract_canon_sha256":"e7d8f62e056a655677c9c1e0f0c9aaf394e69ed31913b761b7feb5594538e0c1"},"schema_version":"1.0"},"canonical_sha256":"adca141f8b8bedca5d4e0ca449e9052e6593eb86bc90edc42d1c97df1597b091","source":{"kind":"arxiv","id":"1212.1942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1942","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1942v1","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1942","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"VXFBIH4LRPW4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VXFBIH4LRPW4UXKO","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VXFBIH4L","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VXFBIH4LRPW4UXKOBSSET2IFFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1212.1942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-12-10T00:20:45Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"2865877d2eecd3fae2efe22082bc960edbfc8123883eb2dfa96ee82d8bb3804f","abstract_canon_sha256":"e7d8f62e056a655677c9c1e0f0c9aaf394e69ed31913b761b7feb5594538e0c1"},"schema_version":"1.0"},"canonical_sha256":"adca141f8b8bedca5d4e0ca449e9052e6593eb86bc90edc42d1c97df1597b091","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:52.517880Z","signature_b64":"wSQraYgHSusCkfaTLY0iz+XcxkmND6m1H83umi/FYaHcd6/DUVoU5jfoTLwKzK9TOdqs5S9gz8i99WTspK3+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adca141f8b8bedca5d4e0ca449e9052e6593eb86bc90edc42d1c97df1597b091","last_reissued_at":"2026-05-18T03:26:52.517037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:52.517037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.1942","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-18T03:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nzz8RhdSf9ZfLeMCigNqFYqfbZovE4NPBgsxcfREcJGk6G+ysPS4UpN981/sD5JbDvqyrIQkj0y7YiLmu88iBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:37:47.793692Z"},"content_sha256":"e45380a64cd43ff6af52365709d548f25993168ff2d75ac9f32ab865cbff025a","schema_version":"1.0","event_id":"sha256:e45380a64cd43ff6af52365709d548f25993168ff2d75ac9f32ab865cbff025a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VXFBIH4LRPW4UXKOBSSET2IFFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balanced K-SAT and Biased random K-SAT on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cond-mat.stat-mech","authors_text":"Sharmistha Sahoo, Sumedha, Supriya Krishnamurthy","submitted_at":"2012-12-10T00:20:45Z","abstract_excerpt":"We study and solve some variations of the random K-satisfiability problem - balanced K-SAT and biased random K-SAT - on a regular tree, using techniques we have developed earlier(arXiv:1110.2065). In both these problems, as well as variations of these that we have looked at, we find that the SAT-UNSAT transition obtained on the Bethe lattice matches the exact threshold for the same model on a random graph for K=2 and is very close to the numerical value obtained for K=3. For higher K it deviates from the numerical estimates of the solvability threshold on random graphs, but is very close to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1942","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-18T03:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NScmR3AyJEZmVwrFOGV1WEL/89QJImzdSyua9OXf82y1iT3HNMQOJXRXd4yhUchNRYImXnM78HymgOIlaEgJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:37:47.794035Z"},"content_sha256":"79b94f0695cf92cd386cc214e8c128df8a85b9b8e46b1e60c34197452eb854aa","schema_version":"1.0","event_id":"sha256:79b94f0695cf92cd386cc214e8c128df8a85b9b8e46b1e60c34197452eb854aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXFBIH4LRPW4UXKOBSSET2IFFZ/bundle.json","state_url":"https://pith.science/pith/VXFBIH4LRPW4UXKOBSSET2IFFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXFBIH4LRPW4UXKOBSSET2IFFZ/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-05T14:37:47Z","links":{"resolver":"https://pith.science/pith/VXFBIH4LRPW4UXKOBSSET2IFFZ","bundle":"https://pith.science/pith/VXFBIH4LRPW4UXKOBSSET2IFFZ/bundle.json","state":"https://pith.science/pith/VXFBIH4LRPW4UXKOBSSET2IFFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXFBIH4LRPW4UXKOBSSET2IFFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VXFBIH4LRPW4UXKOBSSET2IFFZ","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":"e7d8f62e056a655677c9c1e0f0c9aaf394e69ed31913b761b7feb5594538e0c1","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-12-10T00:20:45Z","title_canon_sha256":"2865877d2eecd3fae2efe22082bc960edbfc8123883eb2dfa96ee82d8bb3804f"},"schema_version":"1.0","source":{"id":"1212.1942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1942","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1942v1","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1942","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"VXFBIH4LRPW4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VXFBIH4LRPW4UXKO","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VXFBIH4L","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:79b94f0695cf92cd386cc214e8c128df8a85b9b8e46b1e60c34197452eb854aa","target":"graph","created_at":"2026-05-18T03:26:52Z","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 study and solve some variations of the random K-satisfiability problem - balanced K-SAT and biased random K-SAT - on a regular tree, using techniques we have developed earlier(arXiv:1110.2065). In both these problems, as well as variations of these that we have looked at, we find that the SAT-UNSAT transition obtained on the Bethe lattice matches the exact threshold for the same model on a random graph for K=2 and is very close to the numerical value obtained for K=3. For higher K it deviates from the numerical estimates of the solvability threshold on random graphs, but is very close to th","authors_text":"Sharmistha Sahoo, Sumedha, Supriya Krishnamurthy","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-12-10T00:20:45Z","title":"Balanced K-SAT and Biased random K-SAT on trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1942","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:e45380a64cd43ff6af52365709d548f25993168ff2d75ac9f32ab865cbff025a","target":"record","created_at":"2026-05-18T03:26:52Z","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":"e7d8f62e056a655677c9c1e0f0c9aaf394e69ed31913b761b7feb5594538e0c1","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-12-10T00:20:45Z","title_canon_sha256":"2865877d2eecd3fae2efe22082bc960edbfc8123883eb2dfa96ee82d8bb3804f"},"schema_version":"1.0","source":{"id":"1212.1942","kind":"arxiv","version":1}},"canonical_sha256":"adca141f8b8bedca5d4e0ca449e9052e6593eb86bc90edc42d1c97df1597b091","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adca141f8b8bedca5d4e0ca449e9052e6593eb86bc90edc42d1c97df1597b091","first_computed_at":"2026-05-18T03:26:52.517037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:52.517037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wSQraYgHSusCkfaTLY0iz+XcxkmND6m1H83umi/FYaHcd6/DUVoU5jfoTLwKzK9TOdqs5S9gz8i99WTspK3+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:52.517880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e45380a64cd43ff6af52365709d548f25993168ff2d75ac9f32ab865cbff025a","sha256:79b94f0695cf92cd386cc214e8c128df8a85b9b8e46b1e60c34197452eb854aa"],"state_sha256":"90f0bd77d66ba6bdd0bfe1de1380e2f7e9e5690364675551a643916aa11c7d66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeoS8IHItSG5j/Uuxp5Wv3FxsDqVTV3Mjr9sO74Wib04eUAVlAWhvcaGizoWkUZZZ8uJjqo75JazH4Zt4g7QDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:37:47.796027Z","bundle_sha256":"3ea88ee424637d89b99c6b85ad3a4e41d094b1f37e2d46c5f34b172e06b02cc5"}}