{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:T5T2QMGXMXQI3HS6OO2EX3Q2KO","short_pith_number":"pith:T5T2QMGX","canonical_record":{"source":{"id":"1905.02266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T21:15:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f55f99f38f8a0d81ede5eaa937ef6ebd02fa9764799cd2968d2a908698cfbb9f","abstract_canon_sha256":"d96b59a2a8d15c77162deefeb9a9176bc090c96af062bb126dd1862de8f99410"},"schema_version":"1.0"},"canonical_sha256":"9f67a830d765e08d9e5e73b44bee1a538cd1eb9016f6b48559ba592a4656580c","source":{"kind":"arxiv","id":"1905.02266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02266","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02266v2","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02266","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"T5T2QMGXMXQI","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"pith_short_16","alias_value":"T5T2QMGXMXQI3HS6","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"pith_short_8","alias_value":"T5T2QMGX","created_at":"2026-07-05T02:40:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:T5T2QMGXMXQI3HS6OO2EX3Q2KO","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T21:15:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f55f99f38f8a0d81ede5eaa937ef6ebd02fa9764799cd2968d2a908698cfbb9f","abstract_canon_sha256":"d96b59a2a8d15c77162deefeb9a9176bc090c96af062bb126dd1862de8f99410"},"schema_version":"1.0"},"canonical_sha256":"9f67a830d765e08d9e5e73b44bee1a538cd1eb9016f6b48559ba592a4656580c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:25.167156Z","signature_b64":"A/gA+CZaeypn/Jg+1DGacEzZ0KVWgMyjyM778xKy5tVZ3qeu6RHkz07U2L4H22CGslE9gFLquw9QJr1LHNi/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f67a830d765e08d9e5e73b44bee1a538cd1eb9016f6b48559ba592a4656580c","last_reissued_at":"2026-07-05T02:40:25.166716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:25.166716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02266","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-07-05T02:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cj83cGmPcjbZOOln+jAHu+KfhPhypY5X0KJSfB4sP4v2BZUrWF7SkzECBOvMmhTttwVFxxkn8S2qhfASxXR1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:52:10.755227Z"},"content_sha256":"1e090a24acfa3e0e929e696bc04905019907c71b877981e31d72e076788c78c9","schema_version":"1.0","event_id":"sha256:1e090a24acfa3e0e929e696bc04905019907c71b877981e31d72e076788c78c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:T5T2QMGXMXQI3HS6OO2EX3Q2KO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Clique Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Guido Previde Massara, Tomaso Aste","submitted_at":"2019-05-06T21:15:46Z","abstract_excerpt":"We propose a topological learning algorithm for the estimation of the conditional dependency structure of large sets of random variables from sparse and noisy data. The algorithm, named Maximally Filtered Clique Forest (MFCF), produces a clique forest and an associated Markov Random Field (MRF) by generalising Prim's minimum spanning tree algorithm. To the best of our knowledge, the MFCF presents three elements of novelty with respect to existing structure learning approaches. The first is the repeated application of a local topological move, the clique expansion, that preserves the decomposab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02266","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.02266/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhItYnTtmjG61nogeGLm3ltR715rD3qbpQe9nyROKIH/NEEooeMqLYLlqFXaMhnKgFAbQmmajkeYQALAi3r2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:52:10.756018Z"},"content_sha256":"fe849dac2c5dd1b113e8c38e4c31c1e8db072a499ab23c0707f2b1b853369eb1","schema_version":"1.0","event_id":"sha256:fe849dac2c5dd1b113e8c38e4c31c1e8db072a499ab23c0707f2b1b853369eb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/bundle.json","state_url":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/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-08-18T09:52:10Z","links":{"resolver":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO","bundle":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/bundle.json","state":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:T5T2QMGXMXQI3HS6OO2EX3Q2KO","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":"d96b59a2a8d15c77162deefeb9a9176bc090c96af062bb126dd1862de8f99410","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T21:15:46Z","title_canon_sha256":"f55f99f38f8a0d81ede5eaa937ef6ebd02fa9764799cd2968d2a908698cfbb9f"},"schema_version":"1.0","source":{"id":"1905.02266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02266","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02266v2","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02266","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"T5T2QMGXMXQI","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"pith_short_16","alias_value":"T5T2QMGXMXQI3HS6","created_at":"2026-07-05T02:40:25Z"},{"alias_kind":"pith_short_8","alias_value":"T5T2QMGX","created_at":"2026-07-05T02:40:25Z"}],"graph_snapshots":[{"event_id":"sha256:fe849dac2c5dd1b113e8c38e4c31c1e8db072a499ab23c0707f2b1b853369eb1","target":"graph","created_at":"2026-07-05T02:40:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.02266/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a topological learning algorithm for the estimation of the conditional dependency structure of large sets of random variables from sparse and noisy data. The algorithm, named Maximally Filtered Clique Forest (MFCF), produces a clique forest and an associated Markov Random Field (MRF) by generalising Prim's minimum spanning tree algorithm. To the best of our knowledge, the MFCF presents three elements of novelty with respect to existing structure learning approaches. The first is the repeated application of a local topological move, the clique expansion, that preserves the decomposab","authors_text":"Guido Previde Massara, Tomaso Aste","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T21:15:46Z","title":"Learning Clique Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02266","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:1e090a24acfa3e0e929e696bc04905019907c71b877981e31d72e076788c78c9","target":"record","created_at":"2026-07-05T02:40:25Z","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":"d96b59a2a8d15c77162deefeb9a9176bc090c96af062bb126dd1862de8f99410","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T21:15:46Z","title_canon_sha256":"f55f99f38f8a0d81ede5eaa937ef6ebd02fa9764799cd2968d2a908698cfbb9f"},"schema_version":"1.0","source":{"id":"1905.02266","kind":"arxiv","version":2}},"canonical_sha256":"9f67a830d765e08d9e5e73b44bee1a538cd1eb9016f6b48559ba592a4656580c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f67a830d765e08d9e5e73b44bee1a538cd1eb9016f6b48559ba592a4656580c","first_computed_at":"2026-07-05T02:40:25.166716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:40:25.166716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A/gA+CZaeypn/Jg+1DGacEzZ0KVWgMyjyM778xKy5tVZ3qeu6RHkz07U2L4H22CGslE9gFLquw9QJr1LHNi/AA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:40:25.167156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e090a24acfa3e0e929e696bc04905019907c71b877981e31d72e076788c78c9","sha256:fe849dac2c5dd1b113e8c38e4c31c1e8db072a499ab23c0707f2b1b853369eb1"],"state_sha256":"c7a9282c5508aff3403cfd2c8637ba465128f0437b8c88ee246be94fa7c189de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iaCRvxR7gNfTAemls2dSJsintx8NjbiSIEbruiwH26DcoQB+n8IBE5abFdaM1DzO+dDch8sJYhLQfeDsVacrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T09:52:10.762848Z","bundle_sha256":"80593ff83bcd2dd29f200ef96a0bb8a7bdd1b560e391add7536abe1597466f74"}}