{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FTL4ERUAZCL4EMN4DTXZBIICIM","short_pith_number":"pith:FTL4ERUA","canonical_record":{"source":{"id":"1202.3744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"fc7a6fdc9d11697fd2606eb78a7c76784e6ca9db04d22cfa2b9a5ee0f34fb437","abstract_canon_sha256":"389c56b772d2876cf18073018c5528e068cc267784fc3ae65a14c4676155c3fc"},"schema_version":"1.0"},"canonical_sha256":"2cd7c24680c897c231bc1cef90a102430c1a2b7646a3f545732e6265b0ea516f","source":{"kind":"arxiv","id":"1202.3744","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3744","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3744v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3744","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"FTL4ERUAZCL4","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FTL4ERUAZCL4EMN4","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FTL4ERUA","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FTL4ERUAZCL4EMN4DTXZBIICIM","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"fc7a6fdc9d11697fd2606eb78a7c76784e6ca9db04d22cfa2b9a5ee0f34fb437","abstract_canon_sha256":"389c56b772d2876cf18073018c5528e068cc267784fc3ae65a14c4676155c3fc"},"schema_version":"1.0"},"canonical_sha256":"2cd7c24680c897c231bc1cef90a102430c1a2b7646a3f545732e6265b0ea516f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.142342Z","signature_b64":"P/nTR+8z3bFjYP2W6gbjLbUAKaAuoAMUutLbVALXIIA6BnxaP0qRwuUgOMdH14i9ysV7u5h7xsvtAGkJFqTGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cd7c24680c897c231bc1cef90a102430c1a2b7646a3f545732e6265b0ea516f","last_reissued_at":"2026-05-18T04:02:03.141593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.141593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3744","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0F40rLjYd4GOcYCEMOWm7/DQCeOGl72s9ERBeGwHCruucKr8PRABXu+8nncJOFHPzEJxwd2xSNhWzAijVUROAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:36:56.951803Z"},"content_sha256":"90b8f7d05b7d6129bd46038ea2c0033cad95e75e77c3e14b5af4e2bd16280aeb","schema_version":"1.0","event_id":"sha256:90b8f7d05b7d6129bd46038ea2c0033cad95e75e77c3e14b5af4e2bd16280aeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FTL4ERUAZCL4EMN4DTXZBIICIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Brandon Malone, Changhe Yuan, Eric A. Hansen, Susan Bridges","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Previous work has shown that the problem of learning the optimal structure of a Bayesian network can be formulated as a shortest path finding problem in a graph and solved using A* search. In this paper, we improve the scalability of this approach by developing a memory-efficient heuristic search algorithm for learning the structure of a Bayesian network. Instead of using A*, we propose a frontier breadth-first branch and bound search that leverages the layered structure of the search graph of this problem so that no more than two layers of the graph, plus solution reconstruction information, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3744","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wsKhztzalWkR3SpLjXXHtUu9KFDXSvwF2y/iA8tcz3s2DC/2TeLpSo+dk71+n/dCt50ddGlLqLYf1IEnEHDQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:36:56.952292Z"},"content_sha256":"12df84e099b47db47041514857c293a403a77a03545643d1df16f60761db114a","schema_version":"1.0","event_id":"sha256:12df84e099b47db47041514857c293a403a77a03545643d1df16f60761db114a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTL4ERUAZCL4EMN4DTXZBIICIM/bundle.json","state_url":"https://pith.science/pith/FTL4ERUAZCL4EMN4DTXZBIICIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTL4ERUAZCL4EMN4DTXZBIICIM/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-27T21:36:56Z","links":{"resolver":"https://pith.science/pith/FTL4ERUAZCL4EMN4DTXZBIICIM","bundle":"https://pith.science/pith/FTL4ERUAZCL4EMN4DTXZBIICIM/bundle.json","state":"https://pith.science/pith/FTL4ERUAZCL4EMN4DTXZBIICIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTL4ERUAZCL4EMN4DTXZBIICIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FTL4ERUAZCL4EMN4DTXZBIICIM","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":"389c56b772d2876cf18073018c5528e068cc267784fc3ae65a14c4676155c3fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"fc7a6fdc9d11697fd2606eb78a7c76784e6ca9db04d22cfa2b9a5ee0f34fb437"},"schema_version":"1.0","source":{"id":"1202.3744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3744","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3744v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3744","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"FTL4ERUAZCL4","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FTL4ERUAZCL4EMN4","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FTL4ERUA","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:12df84e099b47db47041514857c293a403a77a03545643d1df16f60761db114a","target":"graph","created_at":"2026-05-18T04:02:03Z","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":"Previous work has shown that the problem of learning the optimal structure of a Bayesian network can be formulated as a shortest path finding problem in a graph and solved using A* search. In this paper, we improve the scalability of this approach by developing a memory-efficient heuristic search algorithm for learning the structure of a Bayesian network. Instead of using A*, we propose a frontier breadth-first branch and bound search that leverages the layered structure of the search graph of this problem so that no more than two layers of the graph, plus solution reconstruction information, ","authors_text":"Brandon Malone, Changhe Yuan, Eric A. Hansen, Susan Bridges","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title":"Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3744","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:90b8f7d05b7d6129bd46038ea2c0033cad95e75e77c3e14b5af4e2bd16280aeb","target":"record","created_at":"2026-05-18T04:02:03Z","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":"389c56b772d2876cf18073018c5528e068cc267784fc3ae65a14c4676155c3fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"fc7a6fdc9d11697fd2606eb78a7c76784e6ca9db04d22cfa2b9a5ee0f34fb437"},"schema_version":"1.0","source":{"id":"1202.3744","kind":"arxiv","version":1}},"canonical_sha256":"2cd7c24680c897c231bc1cef90a102430c1a2b7646a3f545732e6265b0ea516f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cd7c24680c897c231bc1cef90a102430c1a2b7646a3f545732e6265b0ea516f","first_computed_at":"2026-05-18T04:02:03.141593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:03.141593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P/nTR+8z3bFjYP2W6gbjLbUAKaAuoAMUutLbVALXIIA6BnxaP0qRwuUgOMdH14i9ysV7u5h7xsvtAGkJFqTGDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:03.142342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90b8f7d05b7d6129bd46038ea2c0033cad95e75e77c3e14b5af4e2bd16280aeb","sha256:12df84e099b47db47041514857c293a403a77a03545643d1df16f60761db114a"],"state_sha256":"494c23245da44c9deb8b2fbd712a2b97677b5e35d13c3baa24931501c8fc8d20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/z3zyTuJEgWQxWQaFnvbZzAPRQ7kY54U6Ir0f+gantao+EPTk3ZBHqytmZceUDKRTKg2/S3zOHQJJuXfcbpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:36:56.955165Z","bundle_sha256":"ad18846ae61ea8bf9c414193c78b1a309dc46457763548461eccd6f8940f177a"}}