{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GWVQDBXUVIAD6XTWVZZUP44XJY","short_pith_number":"pith:GWVQDBXU","schema_version":"1.0","canonical_sha256":"35ab0186f4aa003f5e76ae7347f3974e260d8f0c6c492521193043c827ace766","source":{"kind":"arxiv","id":"2505.03812","version":1},"attestation_state":"computed","paper":{"title":"Information Filtering Networks: Theoretical Foundations, Generative Methodologies, and Real-World Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Tomaso Aste","submitted_at":"2025-05-02T12:30:17Z","abstract_excerpt":"Information Filtering Networks (IFNs) provide a powerful framework for modeling complex systems through globally sparse yet locally dense and interpretable structures that capture multivariate dependencies. This review offers a comprehensive account of IFNs, covering their theoretical foundations, construction methodologies, and diverse applications. Tracing their origins from early network-based models to advanced formulations such as the Triangulated Maximally Filtered Graph (TMFG) and the Maximally Filtered Clique Forest (MFCF), the paper highlights how IFNs address key challenges in high-d"},"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":"2505.03812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-02T12:30:17Z","cross_cats_sorted":[],"title_canon_sha256":"cda01d40e0f8926c593213f860f29485554058db5c53c90565c3ecb3042f17cb","abstract_canon_sha256":"ae5e9ce0c8259a195c04b0ffb34780a8770c4c5811e18863080888cc44a886dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:31.943223Z","signature_b64":"vfL33S7IlMxSswMjXccbnud+oam23eAIq5zL7FkAnWyHJ8zZ2lHhBeI+DtHfLH7KZFxVaKaZ0xmqm5qBpPTDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35ab0186f4aa003f5e76ae7347f3974e260d8f0c6c492521193043c827ace766","last_reissued_at":"2026-07-05T10:59:31.942747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:31.942747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Filtering Networks: Theoretical Foundations, Generative Methodologies, and Real-World Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Tomaso Aste","submitted_at":"2025-05-02T12:30:17Z","abstract_excerpt":"Information Filtering Networks (IFNs) provide a powerful framework for modeling complex systems through globally sparse yet locally dense and interpretable structures that capture multivariate dependencies. This review offers a comprehensive account of IFNs, covering their theoretical foundations, construction methodologies, and diverse applications. Tracing their origins from early network-based models to advanced formulations such as the Triangulated Maximally Filtered Graph (TMFG) and the Maximally Filtered Clique Forest (MFCF), the paper highlights how IFNs address key challenges in high-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03812","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.03812/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":"2505.03812","created_at":"2026-07-05T10:59:31.942806+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.03812v1","created_at":"2026-07-05T10:59:31.942806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03812","created_at":"2026-07-05T10:59:31.942806+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWVQDBXUVIAD","created_at":"2026-07-05T10:59:31.942806+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWVQDBXUVIAD6XTW","created_at":"2026-07-05T10:59:31.942806+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWVQDBXU","created_at":"2026-07-05T10:59:31.942806+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":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GWVQDBXUVIAD6XTWVZZUP44XJY","json":"https://pith.science/pith/GWVQDBXUVIAD6XTWVZZUP44XJY.json","graph_json":"https://pith.science/api/pith-number/GWVQDBXUVIAD6XTWVZZUP44XJY/graph.json","events_json":"https://pith.science/api/pith-number/GWVQDBXUVIAD6XTWVZZUP44XJY/events.json","paper":"https://pith.science/paper/GWVQDBXU"},"agent_actions":{"view_html":"https://pith.science/pith/GWVQDBXUVIAD6XTWVZZUP44XJY","download_json":"https://pith.science/pith/GWVQDBXUVIAD6XTWVZZUP44XJY.json","view_paper":"https://pith.science/paper/GWVQDBXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.03812&json=true","fetch_graph":"https://pith.science/api/pith-number/GWVQDBXUVIAD6XTWVZZUP44XJY/graph.json","fetch_events":"https://pith.science/api/pith-number/GWVQDBXUVIAD6XTWVZZUP44XJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWVQDBXUVIAD6XTWVZZUP44XJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWVQDBXUVIAD6XTWVZZUP44XJY/action/storage_attestation","attest_author":"https://pith.science/pith/GWVQDBXUVIAD6XTWVZZUP44XJY/action/author_attestation","sign_citation":"https://pith.science/pith/GWVQDBXUVIAD6XTWVZZUP44XJY/action/citation_signature","submit_replication":"https://pith.science/pith/GWVQDBXUVIAD6XTWVZZUP44XJY/action/replication_record"}},"created_at":"2026-07-05T10:59:31.942806+00:00","updated_at":"2026-07-05T10:59:31.942806+00:00"}