{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:66GFKIAV77AQBGL27XSPMLH6IT","short_pith_number":"pith:66GFKIAV","canonical_record":{"source":{"id":"1602.07349","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T23:03:56Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"7076465750cd6cf41b1a22ca2d52f8c68d7a1d740ac7fe7b069f17177550502d","abstract_canon_sha256":"d92a0a12207da46fe313f866962b3aee8bacb3dcefec2c9118a3d5b414fcbbda"},"schema_version":"1.0"},"canonical_sha256":"f78c552015ffc100997afde4f62cfe44fecf37e3b55fde7082a28b59b32eae0a","source":{"kind":"arxiv","id":"1602.07349","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07349","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07349v3","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07349","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"66GFKIAV77AQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"66GFKIAV77AQBGL2","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"66GFKIAV","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:66GFKIAV77AQBGL27XSPMLH6IT","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07349","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T23:03:56Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"7076465750cd6cf41b1a22ca2d52f8c68d7a1d740ac7fe7b069f17177550502d","abstract_canon_sha256":"d92a0a12207da46fe313f866962b3aee8bacb3dcefec2c9118a3d5b414fcbbda"},"schema_version":"1.0"},"canonical_sha256":"f78c552015ffc100997afde4f62cfe44fecf37e3b55fde7082a28b59b32eae0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:29.699329Z","signature_b64":"X82RttonRlauSE30Eu6c2LU5m6O1VVsVCZY7/VCqn62q4i9cbAP/Cdikfqza3jSLL4vS/jREatXj/hX8STcvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f78c552015ffc100997afde4f62cfe44fecf37e3b55fde7082a28b59b32eae0a","last_reissued_at":"2026-05-18T00:50:29.698545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:29.698545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07349","source_version":3,"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-18T00:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZS4ezacMjDvZE7NDB8QwNjSanvWC3wcRuHa7uIZ64xsWKLuhJbfvQF3rFLZfBHLbZB47RM6K2WbU5avWph2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:11:23.503472Z"},"content_sha256":"e88e8dec9aef59e6ebfd4b43abd2d0367611256771c3b66b05297870c3d7e775","schema_version":"1.0","event_id":"sha256:e88e8dec9aef59e6ebfd4b43abd2d0367611256771c3b66b05297870c3d7e775"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:66GFKIAV77AQBGL27XSPMLH6IT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parsimonious modeling with Information Filtering Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Guido Previde Massara, T. Di Matteo, Tomaso Aste, Wolfram Barfuss","submitted_at":"2016-02-23T23:03:56Z","abstract_excerpt":"We introduce a methodology to construct parsimonious probabilistic models. This method makes use of Information Filtering Networks to produce a robust estimate of the global sparse inverse covariance from a simple sum of local inverse covariances computed on small sub-parts of the network. Being based on local and low-dimensional inversions, this method is computationally very efficient and statistically robust even for the estimation of inverse covariance of high-dimensional, noisy and short time-series. Applied to financial data our method results computationally more efficient than state-of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07349","kind":"arxiv","version":3},"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-18T00:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPSl8lOQ6JX8mkeVCqajXp5IdJG6jitAK8gmqyGHfD43ldigiXaVL8CXKPeFyLf3D7btbOHgW/gaobmJbWMBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:11:23.503897Z"},"content_sha256":"bc0615f77287bbf11ed172b6badee2497f5102ced2650179002ce5a15eac7ff7","schema_version":"1.0","event_id":"sha256:bc0615f77287bbf11ed172b6badee2497f5102ced2650179002ce5a15eac7ff7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66GFKIAV77AQBGL27XSPMLH6IT/bundle.json","state_url":"https://pith.science/pith/66GFKIAV77AQBGL27XSPMLH6IT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66GFKIAV77AQBGL27XSPMLH6IT/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-05-31T18:11:23Z","links":{"resolver":"https://pith.science/pith/66GFKIAV77AQBGL27XSPMLH6IT","bundle":"https://pith.science/pith/66GFKIAV77AQBGL27XSPMLH6IT/bundle.json","state":"https://pith.science/pith/66GFKIAV77AQBGL27XSPMLH6IT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66GFKIAV77AQBGL27XSPMLH6IT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:66GFKIAV77AQBGL27XSPMLH6IT","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":"d92a0a12207da46fe313f866962b3aee8bacb3dcefec2c9118a3d5b414fcbbda","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T23:03:56Z","title_canon_sha256":"7076465750cd6cf41b1a22ca2d52f8c68d7a1d740ac7fe7b069f17177550502d"},"schema_version":"1.0","source":{"id":"1602.07349","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07349","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07349v3","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07349","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"66GFKIAV77AQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"66GFKIAV77AQBGL2","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"66GFKIAV","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:bc0615f77287bbf11ed172b6badee2497f5102ced2650179002ce5a15eac7ff7","target":"graph","created_at":"2026-05-18T00:50:29Z","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 introduce a methodology to construct parsimonious probabilistic models. This method makes use of Information Filtering Networks to produce a robust estimate of the global sparse inverse covariance from a simple sum of local inverse covariances computed on small sub-parts of the network. Being based on local and low-dimensional inversions, this method is computationally very efficient and statistically robust even for the estimation of inverse covariance of high-dimensional, noisy and short time-series. Applied to financial data our method results computationally more efficient than state-of","authors_text":"Guido Previde Massara, T. Di Matteo, Tomaso Aste, Wolfram Barfuss","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T23:03:56Z","title":"Parsimonious modeling with Information Filtering Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07349","kind":"arxiv","version":3},"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:e88e8dec9aef59e6ebfd4b43abd2d0367611256771c3b66b05297870c3d7e775","target":"record","created_at":"2026-05-18T00:50:29Z","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":"d92a0a12207da46fe313f866962b3aee8bacb3dcefec2c9118a3d5b414fcbbda","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T23:03:56Z","title_canon_sha256":"7076465750cd6cf41b1a22ca2d52f8c68d7a1d740ac7fe7b069f17177550502d"},"schema_version":"1.0","source":{"id":"1602.07349","kind":"arxiv","version":3}},"canonical_sha256":"f78c552015ffc100997afde4f62cfe44fecf37e3b55fde7082a28b59b32eae0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f78c552015ffc100997afde4f62cfe44fecf37e3b55fde7082a28b59b32eae0a","first_computed_at":"2026-05-18T00:50:29.698545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:29.698545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X82RttonRlauSE30Eu6c2LU5m6O1VVsVCZY7/VCqn62q4i9cbAP/Cdikfqza3jSLL4vS/jREatXj/hX8STcvBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:29.699329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07349","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e88e8dec9aef59e6ebfd4b43abd2d0367611256771c3b66b05297870c3d7e775","sha256:bc0615f77287bbf11ed172b6badee2497f5102ced2650179002ce5a15eac7ff7"],"state_sha256":"360b8f2ef7488c4e74f5979cb6ceb1fd4803b55daaec34b3efe1e95b9a83d633"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxPuj763H+kZEmP3cfDgY86f3fyarq28czoe7myQtZd063zVtRd+u6LncpYSQTUVylOFJKluDbhpRHtxdr43Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:11:23.506772Z","bundle_sha256":"a4dd7cea6d17936f15c0a19a85868a6be7c3fcff13b1fa6a497166ee0d313f85"}}