{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Z4ZO2CJ6H72J4A5Z6NFPWGNRUA","short_pith_number":"pith:Z4ZO2CJ6","canonical_record":{"source":{"id":"1212.2485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"daf0a1ebe021e1ee7f1956a2636a70753ac6e06a573b469fef6a72a17b69f59a","abstract_canon_sha256":"411ff16fcea27a272fe1fa10357827dc2a8cd1e846c32a08d4ca22db7dda8f61"},"schema_version":"1.0"},"canonical_sha256":"cf32ed093e3ff49e03b9f34afb19b1a010dd0c9d0493fbf53f1c27ad9063dc50","source":{"kind":"arxiv","id":"1212.2485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2485","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2485v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2485","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"Z4ZO2CJ6H72J","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z4ZO2CJ6H72J4A5Z","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z4ZO2CJ6","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Z4ZO2CJ6H72J4A5Z6NFPWGNRUA","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"daf0a1ebe021e1ee7f1956a2636a70753ac6e06a573b469fef6a72a17b69f59a","abstract_canon_sha256":"411ff16fcea27a272fe1fa10357827dc2a8cd1e846c32a08d4ca22db7dda8f61"},"schema_version":"1.0"},"canonical_sha256":"cf32ed093e3ff49e03b9f34afb19b1a010dd0c9d0493fbf53f1c27ad9063dc50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.636285Z","signature_b64":"iVNupuo3zlYWOHyWmxmRvqhsI19rPxwK/1Hw/3L51tmVfCLGq+CGMg3vBlkQkyvZap4bPhbRKkv+X/6ZxKi2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf32ed093e3ff49e03b9f34afb19b1a010dd0c9d0493fbf53f1c27ad9063dc50","last_reissued_at":"2026-05-18T03:38:44.635661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.635661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2485","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSitJi9JUt6ka4QoHCv0nA5zg63NssMobbO/6mFh2tJORZO/sezxEVgiC2loXxKbClHUPKng+71wkxp3DD/JBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:16:07.233057Z"},"content_sha256":"f26f1e2a6b5230bb2acc4e92fc88095c2524e012bb4fc4e66320611eae8c9b7f","schema_version":"1.0","event_id":"sha256:f26f1e2a6b5230bb2acc4e92fc88095c2524e012bb4fc4e66320611eae8c9b7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Z4ZO2CJ6H72J4A5Z6NFPWGNRUA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Yong Gao","submitted_at":"2012-10-19T15:05:37Z","abstract_excerpt":"There has been great interest in identifying tractable subclasses of NP     complete problems and designing efficient algorithms for these tractable     classes. Constraint satisfaction and Bayesian network inference are two     examples of such problems that are of great importance in AI and algorithms. In     this paper we study, under the frameworks of random constraint satisfaction     problems and random Bayesian networks, a typical tractable subclass     characterized by the treewidth of the problems. We show that the property of     having a bounded treewidth for CSPs and Bayesian netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2485","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7O9UFSsYk5bUciG6Qegd+nxZIwLkm+pJwAbpPXMzu2aJrsIbvklFHksbLsCajLQKnLdLzeeXl6F4220jE0IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:16:07.233407Z"},"content_sha256":"e2651b5ba19533e097934f8adf3e817e8a288c622e79e35c5eb16ed89dee06e3","schema_version":"1.0","event_id":"sha256:e2651b5ba19533e097934f8adf3e817e8a288c622e79e35c5eb16ed89dee06e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4ZO2CJ6H72J4A5Z6NFPWGNRUA/bundle.json","state_url":"https://pith.science/pith/Z4ZO2CJ6H72J4A5Z6NFPWGNRUA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4ZO2CJ6H72J4A5Z6NFPWGNRUA/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-27T20:16:07Z","links":{"resolver":"https://pith.science/pith/Z4ZO2CJ6H72J4A5Z6NFPWGNRUA","bundle":"https://pith.science/pith/Z4ZO2CJ6H72J4A5Z6NFPWGNRUA/bundle.json","state":"https://pith.science/pith/Z4ZO2CJ6H72J4A5Z6NFPWGNRUA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4ZO2CJ6H72J4A5Z6NFPWGNRUA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z4ZO2CJ6H72J4A5Z6NFPWGNRUA","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":"411ff16fcea27a272fe1fa10357827dc2a8cd1e846c32a08d4ca22db7dda8f61","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:37Z","title_canon_sha256":"daf0a1ebe021e1ee7f1956a2636a70753ac6e06a573b469fef6a72a17b69f59a"},"schema_version":"1.0","source":{"id":"1212.2485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2485","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2485v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2485","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"Z4ZO2CJ6H72J","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z4ZO2CJ6H72J4A5Z","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z4ZO2CJ6","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:e2651b5ba19533e097934f8adf3e817e8a288c622e79e35c5eb16ed89dee06e3","target":"graph","created_at":"2026-05-18T03:38:44Z","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":"There has been great interest in identifying tractable subclasses of NP     complete problems and designing efficient algorithms for these tractable     classes. Constraint satisfaction and Bayesian network inference are two     examples of such problems that are of great importance in AI and algorithms. In     this paper we study, under the frameworks of random constraint satisfaction     problems and random Bayesian networks, a typical tractable subclass     characterized by the treewidth of the problems. We show that the property of     having a bounded treewidth for CSPs and Bayesian netwo","authors_text":"Yong Gao","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:37Z","title":"Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2485","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:f26f1e2a6b5230bb2acc4e92fc88095c2524e012bb4fc4e66320611eae8c9b7f","target":"record","created_at":"2026-05-18T03:38:44Z","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":"411ff16fcea27a272fe1fa10357827dc2a8cd1e846c32a08d4ca22db7dda8f61","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:37Z","title_canon_sha256":"daf0a1ebe021e1ee7f1956a2636a70753ac6e06a573b469fef6a72a17b69f59a"},"schema_version":"1.0","source":{"id":"1212.2485","kind":"arxiv","version":1}},"canonical_sha256":"cf32ed093e3ff49e03b9f34afb19b1a010dd0c9d0493fbf53f1c27ad9063dc50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf32ed093e3ff49e03b9f34afb19b1a010dd0c9d0493fbf53f1c27ad9063dc50","first_computed_at":"2026-05-18T03:38:44.635661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:44.635661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iVNupuo3zlYWOHyWmxmRvqhsI19rPxwK/1Hw/3L51tmVfCLGq+CGMg3vBlkQkyvZap4bPhbRKkv+X/6ZxKi2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:44.636285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f26f1e2a6b5230bb2acc4e92fc88095c2524e012bb4fc4e66320611eae8c9b7f","sha256:e2651b5ba19533e097934f8adf3e817e8a288c622e79e35c5eb16ed89dee06e3"],"state_sha256":"2d3702f76f9509b49b9508ea9bcb03277570598a4ee998bda38131a92f0aeccd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWeDW2w3Fpcic4/DeahimUGbAuOcp0GbV5yKzkHg54EKn2UNO4k0ZyMEy3UfW5NivPJvvt5CbzHIi3KKQgT7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:16:07.235582Z","bundle_sha256":"973de3e39f4f52701810181ccf21fb1e155920782aac2cce4b137a35d7f859c3"}}