{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HGB4FDENYOPKAKA26CFW4RQC5I","short_pith_number":"pith:HGB4FDEN","canonical_record":{"source":{"id":"1602.07140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-02-23T13:11:53Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"62053a4fec3092d676c7d13c2c4fd4358dc14ad55487b5bc092d8652ffa57234","abstract_canon_sha256":"fa741894f3d4acd9d469ab4a375b0c741eb0e34de8be00eee701f4488ca4da3f"},"schema_version":"1.0"},"canonical_sha256":"3983c28c8dc39ea0281af08b6e4602ea328159a679f2477e135877ff92a711fb","source":{"kind":"arxiv","id":"1602.07140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07140","created_at":"2026-05-18T01:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07140v1","created_at":"2026-05-18T01:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07140","created_at":"2026-05-18T01:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"HGB4FDENYOPK","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HGB4FDENYOPKAKA2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HGB4FDEN","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HGB4FDENYOPKAKA26CFW4RQC5I","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-02-23T13:11:53Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"62053a4fec3092d676c7d13c2c4fd4358dc14ad55487b5bc092d8652ffa57234","abstract_canon_sha256":"fa741894f3d4acd9d469ab4a375b0c741eb0e34de8be00eee701f4488ca4da3f"},"schema_version":"1.0"},"canonical_sha256":"3983c28c8dc39ea0281af08b6e4602ea328159a679f2477e135877ff92a711fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:06.511424Z","signature_b64":"o5XGTx9M0wbFv31rntdSPzSXQf3yRAqrPqOxuuEgEJ+57pXiTQa/aEeKB4Ye0gODlnd+GpXJM6hTf3Ci1oijBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3983c28c8dc39ea0281af08b6e4602ea328159a679f2477e135877ff92a711fb","last_reissued_at":"2026-05-18T01:18:06.510862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:06.510862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07140","source_version":1,"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:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x8KYUtevShNsxuteMAzlWrhGjYPS2mGngYWkpp6FP/X3gEW6QBAoSJTwb5fm2dpqPuB7hNUOb33sqeGH4rqNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:53:33.983611Z"},"content_sha256":"bd2d6221dc235822cd0348ae6c27c51d4bedc611b2ec7eac47184d7dfb013654","schema_version":"1.0","event_id":"sha256:bd2d6221dc235822cd0348ae6c27c51d4bedc611b2ec7eac47184d7dfb013654"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HGB4FDENYOPKAKA26CFW4RQC5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond the locally tree-like approximation for percolation on real networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Claudio Castellano, Filippo Radicchi","submitted_at":"2016-02-23T13:11:53Z","abstract_excerpt":"Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often characterized by high frequencies of short loops. We present here a theoretical framework able to overcome such a limitation for the case of site percolation. Our method is based on a message passing algorithm that discounts redundant paths along triangles in the graph. We systematically test the approach on 98 real-world graphs and on synthetic networks. We find exce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07140","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":""},"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:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7GUjlJHGJfToreMPI/F2GwUMY/tEV7MMFbwTYbrbG8edhNFlVj7E5S88fnoHLhw2cy/CrXyssqpdjC9eD+zCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:53:33.984042Z"},"content_sha256":"fde7f97f45741e9242d4036bda8c46a5a1c566c915f14e45eb4c61cfd284b4d8","schema_version":"1.0","event_id":"sha256:fde7f97f45741e9242d4036bda8c46a5a1c566c915f14e45eb4c61cfd284b4d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGB4FDENYOPKAKA26CFW4RQC5I/bundle.json","state_url":"https://pith.science/pith/HGB4FDENYOPKAKA26CFW4RQC5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGB4FDENYOPKAKA26CFW4RQC5I/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-30T15:53:33Z","links":{"resolver":"https://pith.science/pith/HGB4FDENYOPKAKA26CFW4RQC5I","bundle":"https://pith.science/pith/HGB4FDENYOPKAKA26CFW4RQC5I/bundle.json","state":"https://pith.science/pith/HGB4FDENYOPKAKA26CFW4RQC5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGB4FDENYOPKAKA26CFW4RQC5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HGB4FDENYOPKAKA26CFW4RQC5I","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":"fa741894f3d4acd9d469ab4a375b0c741eb0e34de8be00eee701f4488ca4da3f","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-02-23T13:11:53Z","title_canon_sha256":"62053a4fec3092d676c7d13c2c4fd4358dc14ad55487b5bc092d8652ffa57234"},"schema_version":"1.0","source":{"id":"1602.07140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07140","created_at":"2026-05-18T01:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07140v1","created_at":"2026-05-18T01:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07140","created_at":"2026-05-18T01:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"HGB4FDENYOPK","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HGB4FDENYOPKAKA2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HGB4FDEN","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:fde7f97f45741e9242d4036bda8c46a5a1c566c915f14e45eb4c61cfd284b4d8","target":"graph","created_at":"2026-05-18T01:18:06Z","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":"Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often characterized by high frequencies of short loops. We present here a theoretical framework able to overcome such a limitation for the case of site percolation. Our method is based on a message passing algorithm that discounts redundant paths along triangles in the graph. We systematically test the approach on 98 real-world graphs and on synthetic networks. We find exce","authors_text":"Claudio Castellano, Filippo Radicchi","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-02-23T13:11:53Z","title":"Beyond the locally tree-like approximation for percolation on real networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07140","kind":"arxiv","version":1},"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:bd2d6221dc235822cd0348ae6c27c51d4bedc611b2ec7eac47184d7dfb013654","target":"record","created_at":"2026-05-18T01:18:06Z","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":"fa741894f3d4acd9d469ab4a375b0c741eb0e34de8be00eee701f4488ca4da3f","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-02-23T13:11:53Z","title_canon_sha256":"62053a4fec3092d676c7d13c2c4fd4358dc14ad55487b5bc092d8652ffa57234"},"schema_version":"1.0","source":{"id":"1602.07140","kind":"arxiv","version":1}},"canonical_sha256":"3983c28c8dc39ea0281af08b6e4602ea328159a679f2477e135877ff92a711fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3983c28c8dc39ea0281af08b6e4602ea328159a679f2477e135877ff92a711fb","first_computed_at":"2026-05-18T01:18:06.510862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:06.510862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o5XGTx9M0wbFv31rntdSPzSXQf3yRAqrPqOxuuEgEJ+57pXiTQa/aEeKB4Ye0gODlnd+GpXJM6hTf3Ci1oijBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:06.511424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd2d6221dc235822cd0348ae6c27c51d4bedc611b2ec7eac47184d7dfb013654","sha256:fde7f97f45741e9242d4036bda8c46a5a1c566c915f14e45eb4c61cfd284b4d8"],"state_sha256":"4722e16c78cbf3b3565419117c9cf898a644cad65bb9ffc0c163b91ea73c4544"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONTiRA32GaT9LFnYgWMIC+Z0eUWRjJOydl90xk+Ak3LpY/NYFB3xvnODOTQZuqE1DJyGzTPZamqjwzHq2bCiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:53:33.986560Z","bundle_sha256":"9edd2ffec97352c43fdfa413ec54142fb75e34ee96848196fcbb566024f0586d"}}