{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XYJ3OWQ7WRHXKNIGAWSMPCNOOI","short_pith_number":"pith:XYJ3OWQ7","canonical_record":{"source":{"id":"1207.4109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:41:27Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"69ded1833e5d17c2dd6f5541373f6dd35cb359d9bd5bc4bb2e82078c68929b50","abstract_canon_sha256":"0bfe33eff67bc8b2ca540dc34d9873f25d56c1684225ee21e1efc74ddab19a83"},"schema_version":"1.0"},"canonical_sha256":"be13b75a1fb44f75350605a4c789ae723d69ad06dbd47bbeab23ec598d74555d","source":{"kind":"arxiv","id":"1207.4109","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4109","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4109v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4109","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"XYJ3OWQ7WRHX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XYJ3OWQ7WRHXKNIG","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XYJ3OWQ7","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XYJ3OWQ7WRHXKNIGAWSMPCNOOI","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:41:27Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"69ded1833e5d17c2dd6f5541373f6dd35cb359d9bd5bc4bb2e82078c68929b50","abstract_canon_sha256":"0bfe33eff67bc8b2ca540dc34d9873f25d56c1684225ee21e1efc74ddab19a83"},"schema_version":"1.0"},"canonical_sha256":"be13b75a1fb44f75350605a4c789ae723d69ad06dbd47bbeab23ec598d74555d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.982142Z","signature_b64":"c0X4jAh8C8FhhG3Yhj1r5/myyLXsmGHbOCbvHhg/xr63M3xBHzaKryTJzMubqZcG5kh1RE4sxcU1Egpj4Nv2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be13b75a1fb44f75350605a4c789ae723d69ad06dbd47bbeab23ec598d74555d","last_reissued_at":"2026-05-18T03:50:47.981471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.981471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4109","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QeQ3LBVKGiDLq3zRrkjAdnZGY82CfCb8p3tSZLcgsX2ax3a7RkICKToEpT3TG6WJTn3YtkGMDBY/ypUFKrFnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:28:00.603291Z"},"content_sha256":"a48495c53798b558436d886de78fca83bd6b2667609d69f144b72d65e4ae1714","schema_version":"1.0","event_id":"sha256:a48495c53798b558436d886de78fca83bd6b2667609d69f144b72d65e4ae1714"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XYJ3OWQ7WRHXKNIGAWSMPCNOOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Complete Anytime Algorithm for Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.DS","authors_text":"Rina Dechter, Vibhav Gogate","submitted_at":"2012-07-11T14:41:27Z","abstract_excerpt":"In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect elimination ordering of vertices of the graph. The algorithm uses novel pruning and propagation techniques which are derived from the theory of graph minors and graph isomorphism. We present a new algorithm called minor-min-width for computing a lower bound on treewidth that is used within the branch and bound algorithm and which improves over earlier available lower bounds. Empirical evaluation of QuickBB on randomly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4109","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rucIYA5j4+awTwND9wrIcvE0+l2HxSioVA7kOkQyU88cLCUFMuFqRa2nCDSRXt1EOzQ0I8C1vqatmUxCahvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:28:00.603735Z"},"content_sha256":"c8d2ee98049efdcf3d41fc3aa50061b0bc448e9e60db395d975a52a431f8729d","schema_version":"1.0","event_id":"sha256:c8d2ee98049efdcf3d41fc3aa50061b0bc448e9e60db395d975a52a431f8729d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYJ3OWQ7WRHXKNIGAWSMPCNOOI/bundle.json","state_url":"https://pith.science/pith/XYJ3OWQ7WRHXKNIGAWSMPCNOOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYJ3OWQ7WRHXKNIGAWSMPCNOOI/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-30T22:28:00Z","links":{"resolver":"https://pith.science/pith/XYJ3OWQ7WRHXKNIGAWSMPCNOOI","bundle":"https://pith.science/pith/XYJ3OWQ7WRHXKNIGAWSMPCNOOI/bundle.json","state":"https://pith.science/pith/XYJ3OWQ7WRHXKNIGAWSMPCNOOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYJ3OWQ7WRHXKNIGAWSMPCNOOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XYJ3OWQ7WRHXKNIGAWSMPCNOOI","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":"0bfe33eff67bc8b2ca540dc34d9873f25d56c1684225ee21e1efc74ddab19a83","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:41:27Z","title_canon_sha256":"69ded1833e5d17c2dd6f5541373f6dd35cb359d9bd5bc4bb2e82078c68929b50"},"schema_version":"1.0","source":{"id":"1207.4109","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4109","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4109v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4109","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"XYJ3OWQ7WRHX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XYJ3OWQ7WRHXKNIG","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XYJ3OWQ7","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:c8d2ee98049efdcf3d41fc3aa50061b0bc448e9e60db395d975a52a431f8729d","target":"graph","created_at":"2026-05-18T03:50:47Z","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":"In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect elimination ordering of vertices of the graph. The algorithm uses novel pruning and propagation techniques which are derived from the theory of graph minors and graph isomorphism. We present a new algorithm called minor-min-width for computing a lower bound on treewidth that is used within the branch and bound algorithm and which improves over earlier available lower bounds. Empirical evaluation of QuickBB on randomly","authors_text":"Rina Dechter, Vibhav Gogate","cross_cats":["cs.AI","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:41:27Z","title":"A Complete Anytime Algorithm for Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4109","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:a48495c53798b558436d886de78fca83bd6b2667609d69f144b72d65e4ae1714","target":"record","created_at":"2026-05-18T03:50:47Z","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":"0bfe33eff67bc8b2ca540dc34d9873f25d56c1684225ee21e1efc74ddab19a83","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-11T14:41:27Z","title_canon_sha256":"69ded1833e5d17c2dd6f5541373f6dd35cb359d9bd5bc4bb2e82078c68929b50"},"schema_version":"1.0","source":{"id":"1207.4109","kind":"arxiv","version":1}},"canonical_sha256":"be13b75a1fb44f75350605a4c789ae723d69ad06dbd47bbeab23ec598d74555d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be13b75a1fb44f75350605a4c789ae723d69ad06dbd47bbeab23ec598d74555d","first_computed_at":"2026-05-18T03:50:47.981471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:47.981471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c0X4jAh8C8FhhG3Yhj1r5/myyLXsmGHbOCbvHhg/xr63M3xBHzaKryTJzMubqZcG5kh1RE4sxcU1Egpj4Nv2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:47.982142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4109","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a48495c53798b558436d886de78fca83bd6b2667609d69f144b72d65e4ae1714","sha256:c8d2ee98049efdcf3d41fc3aa50061b0bc448e9e60db395d975a52a431f8729d"],"state_sha256":"6b7d54595b9fab94c658bde492fa5daebd0001ca9eb19027622b6ce13b7fa23d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oL8BCQDESACFbNR7pkG94nBVsZTS78c7MXoaNly9tN+kS0qmbV3QIoe57faQfZN/l2ZvReNs14Mg7JG5RzV+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:28:00.606896Z","bundle_sha256":"5542eb5c11e940b85378d18926a40611acf9cb84fcd17b1ca7548acd3bdac61f"}}