{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3POGRTXCNH4BUIPK6ADJK7NHPC","short_pith_number":"pith:3POGRTXC","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"},"canonical_sha256":"dbdc68cee269f81a21eaf006957da778b499fcc1c47cd6bd1743a34d632e85a4","source":{"kind":"arxiv","id":"1505.02445","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02445","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02445v2","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02445","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"3POGRTXCNH4B","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3POGRTXCNH4BUIPK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3POGRTXC","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3POGRTXCNH4BUIPK6ADJK7NHPC","target":"record","payload":{"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"},"canonical_sha256":"dbdc68cee269f81a21eaf006957da778b499fcc1c47cd6bd1743a34d632e85a4","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"},"source_kind":"arxiv","source_id":"1505.02445","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-18T01:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/q5lYQGFqHL/0Aa+fVzh4BUpUSOle2QF2CiLf9A3RVgn77m9h2al8rusjl28Qwj1j1ZS+bCOevOjrm9ANRRPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:13:09.900797Z"},"content_sha256":"282222819445d8a3a08fbfb0aad950fd80cbf01ff8d4ad0e1fe91488b8e3d0e8","schema_version":"1.0","event_id":"sha256:282222819445d8a3a08fbfb0aad950fd80cbf01ff8d4ad0e1fe91488b8e3d0e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3POGRTXCNH4BUIPK6ADJK7NHPC","target":"graph","payload":{"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"},"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-18T01:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWBBnT+8U+wZrS8QsAjftp1JSdQtaAG/C9TblS4V17gZaqb+pAQgSQpVG/D4k1IpkXS6cR5kGw5KtzRj9CSLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:13:09.901519Z"},"content_sha256":"52ea2314f79e73acf452743c0d5f18638dc3cca5265e171ba678f511e1dc2aaf","schema_version":"1.0","event_id":"sha256:52ea2314f79e73acf452743c0d5f18638dc3cca5265e171ba678f511e1dc2aaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/bundle.json","state_url":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/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-01T05:13:09Z","links":{"resolver":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC","bundle":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/bundle.json","state":"https://pith.science/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3POGRTXCNH4BUIPK6ADJK7NHPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3POGRTXCNH4BUIPK6ADJK7NHPC","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":"9a1a32776aaecc3a58b91465905b5d724be9396a1de02620d14073707b2d5e83","cross_cats_sorted":["cond-mat.stat-mech","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-10T21:47:38Z","title_canon_sha256":"b9378cbe1e75643dcb6613b2706e6225b72a9884bcaca9bb8be8919720bde64b"},"schema_version":"1.0","source":{"id":"1505.02445","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02445","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02445v2","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02445","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"3POGRTXCNH4B","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3POGRTXCNH4BUIPK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3POGRTXC","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:52ea2314f79e73acf452743c0d5f18638dc3cca5265e171ba678f511e1dc2aaf","target":"graph","created_at":"2026-05-18T01:34:49Z","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":"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","authors_text":"Guido Previde Massara, T. Di Matteo, Tomaso Aste","cross_cats":["cond-mat.stat-mech","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-10T21:47:38Z","title":"Network Filtering for Big Data: Triangulated Maximally Filtered Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02445","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:282222819445d8a3a08fbfb0aad950fd80cbf01ff8d4ad0e1fe91488b8e3d0e8","target":"record","created_at":"2026-05-18T01:34:49Z","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":"9a1a32776aaecc3a58b91465905b5d724be9396a1de02620d14073707b2d5e83","cross_cats_sorted":["cond-mat.stat-mech","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-10T21:47:38Z","title_canon_sha256":"b9378cbe1e75643dcb6613b2706e6225b72a9884bcaca9bb8be8919720bde64b"},"schema_version":"1.0","source":{"id":"1505.02445","kind":"arxiv","version":2}},"canonical_sha256":"dbdc68cee269f81a21eaf006957da778b499fcc1c47cd6bd1743a34d632e85a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbdc68cee269f81a21eaf006957da778b499fcc1c47cd6bd1743a34d632e85a4","first_computed_at":"2026-05-18T01:34:49.803366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:49.803366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jvPG8CsUNQ/IeZpENWziW1JRZC0jyWS8yj/FwZ+F/3mbivHNL31+pMgW2rqVaoNesJWcl+qstB073c86G9QQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:49.803932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02445","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:282222819445d8a3a08fbfb0aad950fd80cbf01ff8d4ad0e1fe91488b8e3d0e8","sha256:52ea2314f79e73acf452743c0d5f18638dc3cca5265e171ba678f511e1dc2aaf"],"state_sha256":"69005f046f89c25cb9cb1b111c346d5df80fece711658827036ffd59c63cfe8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5G72bmLWWIjdps4l3Co3+JD30sMHmNSb11fjs71fCU4QBk1U51RV1lkvyUzYlElpSzAeCGeb5PSWpYDIDvtEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:13:09.905262Z","bundle_sha256":"33651abebcf2b5b65274c177b4d9866aae8bb46e556fa6bbed9a69851345888e"}}