{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3POGRTXCNH4BUIPK6ADJK7NHPC","short_pith_number":"pith:3POGRTXC","schema_version":"1.0","canonical_sha256":"dbdc68cee269f81a21eaf006957da778b499fcc1c47cd6bd1743a34d632e85a4","source":{"kind":"arxiv","id":"1505.02445","version":2},"attestation_state":"computed","paper":{"title":"Network Filtering for Big Data: Triangulated Maximally Filtered Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IR"],"primary_cat":"cs.DS","authors_text":"Guido Previde Massara, T. Di Matteo, Tomaso Aste","submitted_at":"2015-05-10T21:47:38Z","abstract_excerpt":"We propose a network-filtering method, the Triangulated Maximally Filtered Graph (TMFG), that provides an approximate solution to the Weighted Maximal Planar Graph problem. The underlying idea of TMFG consists in building a triangulation that maximizes a score function associated with the amount of information retained by the network. TMFG uses as weights any arbitrary similarity measure to arrange data into a meaningful network structure that can be used for clustering, community detection and modeling. The method is fast, adaptable and scalable to very large datasets, it allows online updati"},"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":"1505.02445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-10T21:47:38Z","cross_cats_sorted":["cond-mat.stat-mech","cs.IR"],"title_canon_sha256":"b9378cbe1e75643dcb6613b2706e6225b72a9884bcaca9bb8be8919720bde64b","abstract_canon_sha256":"9a1a32776aaecc3a58b91465905b5d724be9396a1de02620d14073707b2d5e83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:49.803932Z","signature_b64":"jvPG8CsUNQ/IeZpENWziW1JRZC0jyWS8yj/FwZ+F/3mbivHNL31+pMgW2rqVaoNesJWcl+qstB073c86G9QQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbdc68cee269f81a21eaf006957da778b499fcc1c47cd6bd1743a34d632e85a4","last_reissued_at":"2026-05-18T01:34:49.803366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:49.803366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Filtering for Big Data: Triangulated Maximally Filtered Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IR"],"primary_cat":"cs.DS","authors_text":"Guido Previde Massara, T. Di Matteo, Tomaso Aste","submitted_at":"2015-05-10T21:47:38Z","abstract_excerpt":"We propose a network-filtering method, the Triangulated Maximally Filtered Graph (TMFG), that provides an approximate solution to the Weighted Maximal Planar Graph problem. The underlying idea of TMFG consists in building a triangulation that maximizes a score function associated with the amount of information retained by the network. TMFG uses as weights any arbitrary similarity measure to arrange data into a meaningful network structure that can be used for clustering, community detection and modeling. The method is fast, adaptable and scalable to very large datasets, it allows online updati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02445","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.02445","created_at":"2026-05-18T01:34:49.803456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02445v2","created_at":"2026-05-18T01:34:49.803456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02445","created_at":"2026-05-18T01:34:49.803456+00:00"},{"alias_kind":"pith_short_12","alias_value":"3POGRTXCNH4B","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3POGRTXCNH4BUIPK","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3POGRTXC","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC","json":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC.json","graph_json":"https://pith.science/api/pith-number/3POGRTXCNH4BUIPK6ADJK7NHPC/graph.json","events_json":"https://pith.science/api/pith-number/3POGRTXCNH4BUIPK6ADJK7NHPC/events.json","paper":"https://pith.science/paper/3POGRTXC"},"agent_actions":{"view_html":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC","download_json":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC.json","view_paper":"https://pith.science/paper/3POGRTXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02445&json=true","fetch_graph":"https://pith.science/api/pith-number/3POGRTXCNH4BUIPK6ADJK7NHPC/graph.json","fetch_events":"https://pith.science/api/pith-number/3POGRTXCNH4BUIPK6ADJK7NHPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/action/storage_attestation","attest_author":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/action/author_attestation","sign_citation":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/action/citation_signature","submit_replication":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/action/replication_record"}},"created_at":"2026-05-18T01:34:49.803456+00:00","updated_at":"2026-05-18T01:34:49.803456+00:00"}