{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T5T2QMGXMXQI3HS6OO2EX3Q2KO","short_pith_number":"pith:T5T2QMGX","schema_version":"1.0","canonical_sha256":"9f67a830d765e08d9e5e73b44bee1a538cd1eb9016f6b48559ba592a4656580c","source":{"kind":"arxiv","id":"1905.02266","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.02266","created_at":"2026-07-05T02:40:25.166779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02266v2","created_at":"2026-07-05T02:40:25.166779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02266","created_at":"2026-07-05T02:40:25.166779+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5T2QMGXMXQI","created_at":"2026-07-05T02:40:25.166779+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5T2QMGXMXQI3HS6","created_at":"2026-07-05T02:40:25.166779+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5T2QMGX","created_at":"2026-07-05T02:40:25.166779+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14764","citing_title":"Compositional Sparsity as an Inductive Bias for Neural Architecture Design","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO","json":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO.json","graph_json":"https://pith.science/api/pith-number/T5T2QMGXMXQI3HS6OO2EX3Q2KO/graph.json","events_json":"https://pith.science/api/pith-number/T5T2QMGXMXQI3HS6OO2EX3Q2KO/events.json","paper":"https://pith.science/paper/T5T2QMGX"},"agent_actions":{"view_html":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO","download_json":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO.json","view_paper":"https://pith.science/paper/T5T2QMGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02266&json=true","fetch_graph":"https://pith.science/api/pith-number/T5T2QMGXMXQI3HS6OO2EX3Q2KO/graph.json","fetch_events":"https://pith.science/api/pith-number/T5T2QMGXMXQI3HS6OO2EX3Q2KO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/action/storage_attestation","attest_author":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/action/author_attestation","sign_citation":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/action/citation_signature","submit_replication":"https://pith.science/pith/T5T2QMGXMXQI3HS6OO2EX3Q2KO/action/replication_record"}},"created_at":"2026-07-05T02:40:25.166779+00:00","updated_at":"2026-07-05T02:40:25.166779+00:00"}