{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:77NZV54XWZBYISLJG7V6MJ7LKS","short_pith_number":"pith:77NZV54X","canonical_record":{"source":{"id":"1201.0310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-12-31T21:57:54Z","cross_cats_sorted":["math.CO","math.ST","stat.TH"],"title_canon_sha256":"c12085766dc58df4d3ae4c037c22b232303e8f4b80f5f4965b582cf3cfc26c84","abstract_canon_sha256":"0a62b855ed4363a6589ff6f4a61384add30ce2e3fb4f617b4a0bffa357c4be85"},"schema_version":"1.0"},"canonical_sha256":"ffdb9af797b64384496937ebe627eb54916fb661d9d922cade48814b9a3de700","source":{"kind":"arxiv","id":"1201.0310","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0310","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0310v2","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0310","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"pith_short_12","alias_value":"77NZV54XWZBY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"77NZV54XWZBYISLJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"77NZV54X","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:77NZV54XWZBYISLJG7V6MJ7LKS","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-12-31T21:57:54Z","cross_cats_sorted":["math.CO","math.ST","stat.TH"],"title_canon_sha256":"c12085766dc58df4d3ae4c037c22b232303e8f4b80f5f4965b582cf3cfc26c84","abstract_canon_sha256":"0a62b855ed4363a6589ff6f4a61384add30ce2e3fb4f617b4a0bffa357c4be85"},"schema_version":"1.0"},"canonical_sha256":"ffdb9af797b64384496937ebe627eb54916fb661d9d922cade48814b9a3de700","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:39.427623Z","signature_b64":"ZLu6I3W+saJJq6l2qHLz/DXSXDB37luL2RpuglhC6SBHIrO4rLvAe7fsWjzqVtaL/gZKaQEzQ+seVQV8MQSqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffdb9af797b64384496937ebe627eb54916fb661d9d922cade48814b9a3de700","last_reissued_at":"2026-05-18T03:58:39.427116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:39.427116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0310","source_version":2,"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:58:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80ypQoqn633YO3QVot0V2acdnjuo74RXlcTRkySrD52wDDo7HgIGBPhTH3RGQAxBvvE+nTEWxAVpcaMR1EcsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:39:23.459573Z"},"content_sha256":"2be7ac47613612e34d97a761e6a4f9da794886b107fe0d90c1dd4257b4c2e3f1","schema_version":"1.0","event_id":"sha256:2be7ac47613612e34d97a761e6a4f9da794886b107fe0d90c1dd4257b4c2e3f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:77NZV54XWZBYISLJG7V6MJ7LKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Positive definite completion problems for directed acyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.ST","stat.TH"],"primary_cat":"math.RA","authors_text":"Bala Rajaratnam, Emanuel Ben-David","submitted_at":"2011-12-31T21:57:54Z","abstract_excerpt":"A positive definite completion problem pertains to determining whether the unspecified positions of a partial (or incomplete) matrix can be completed in a desired subclass of positive definite matrices. In this paper we study an important and new class of positive definite completion problems where the desired subclasses are the spaces of covariance and inverse-covariance matrices of probabilistic models corresponding to directed acyclic graph models (also known as Bayesian networks). We provide fast procedures that determine whether a partial matrix can be completed in either of these spaces "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0310","kind":"arxiv","version":2},"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:58:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqzIPH7vQ44aXnNq4VZC4Jhk9T/q+dHG/32oy84jq2wy5EYEDGT3PwVFg+eNhjXZNZMbe7jTt63b6xpYvsNICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:39:23.459910Z"},"content_sha256":"dacbf2a45260c3f803f435455658df78fae322f1715747e5beb7c36b0d444099","schema_version":"1.0","event_id":"sha256:dacbf2a45260c3f803f435455658df78fae322f1715747e5beb7c36b0d444099"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77NZV54XWZBYISLJG7V6MJ7LKS/bundle.json","state_url":"https://pith.science/pith/77NZV54XWZBYISLJG7V6MJ7LKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77NZV54XWZBYISLJG7V6MJ7LKS/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-27T16:39:23Z","links":{"resolver":"https://pith.science/pith/77NZV54XWZBYISLJG7V6MJ7LKS","bundle":"https://pith.science/pith/77NZV54XWZBYISLJG7V6MJ7LKS/bundle.json","state":"https://pith.science/pith/77NZV54XWZBYISLJG7V6MJ7LKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77NZV54XWZBYISLJG7V6MJ7LKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:77NZV54XWZBYISLJG7V6MJ7LKS","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":"0a62b855ed4363a6589ff6f4a61384add30ce2e3fb4f617b4a0bffa357c4be85","cross_cats_sorted":["math.CO","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-12-31T21:57:54Z","title_canon_sha256":"c12085766dc58df4d3ae4c037c22b232303e8f4b80f5f4965b582cf3cfc26c84"},"schema_version":"1.0","source":{"id":"1201.0310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0310","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0310v2","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0310","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"pith_short_12","alias_value":"77NZV54XWZBY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"77NZV54XWZBYISLJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"77NZV54X","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:dacbf2a45260c3f803f435455658df78fae322f1715747e5beb7c36b0d444099","target":"graph","created_at":"2026-05-18T03:58:39Z","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":"A positive definite completion problem pertains to determining whether the unspecified positions of a partial (or incomplete) matrix can be completed in a desired subclass of positive definite matrices. In this paper we study an important and new class of positive definite completion problems where the desired subclasses are the spaces of covariance and inverse-covariance matrices of probabilistic models corresponding to directed acyclic graph models (also known as Bayesian networks). We provide fast procedures that determine whether a partial matrix can be completed in either of these spaces ","authors_text":"Bala Rajaratnam, Emanuel Ben-David","cross_cats":["math.CO","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-12-31T21:57:54Z","title":"Positive definite completion problems for directed acyclic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0310","kind":"arxiv","version":2},"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:2be7ac47613612e34d97a761e6a4f9da794886b107fe0d90c1dd4257b4c2e3f1","target":"record","created_at":"2026-05-18T03:58:39Z","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":"0a62b855ed4363a6589ff6f4a61384add30ce2e3fb4f617b4a0bffa357c4be85","cross_cats_sorted":["math.CO","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-12-31T21:57:54Z","title_canon_sha256":"c12085766dc58df4d3ae4c037c22b232303e8f4b80f5f4965b582cf3cfc26c84"},"schema_version":"1.0","source":{"id":"1201.0310","kind":"arxiv","version":2}},"canonical_sha256":"ffdb9af797b64384496937ebe627eb54916fb661d9d922cade48814b9a3de700","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffdb9af797b64384496937ebe627eb54916fb661d9d922cade48814b9a3de700","first_computed_at":"2026-05-18T03:58:39.427116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:39.427116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZLu6I3W+saJJq6l2qHLz/DXSXDB37luL2RpuglhC6SBHIrO4rLvAe7fsWjzqVtaL/gZKaQEzQ+seVQV8MQSqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:39.427623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2be7ac47613612e34d97a761e6a4f9da794886b107fe0d90c1dd4257b4c2e3f1","sha256:dacbf2a45260c3f803f435455658df78fae322f1715747e5beb7c36b0d444099"],"state_sha256":"c14a6011377812445414158dbd636fdb21b3628957ab7a85cd97cc7a98238144"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Iku8BuS5ZEDhNbO0FqUv8LXS5w0JOKhSe95NOA/kXNUQhw90SmvXxnud1hjvuxY4e+eJTPeR0GHbEh2tFCHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:39:23.471021Z","bundle_sha256":"fa50878397928bd7e7611373225c0dd633b47bf2be9ca8330701698d4f574b90"}}