{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:6YHN3ZZDQNANQCGCWRAIYYPM4Q","short_pith_number":"pith:6YHN3ZZD","canonical_record":{"source":{"id":"0811.4511","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2008-11-27T11:19:56Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"e5469fd95a9ace481bc5a87681bca602bb510dd91a637737fe0cf4c2312cb79f","abstract_canon_sha256":"7f47655d2505cf11e17950e56d027367120ad7ac6f74723fed3e52d49aadae41"},"schema_version":"1.0"},"canonical_sha256":"f60edde7238340d808c2b4408c61ece40e7873b8e1a9cc3228a043402d5fe9f5","source":{"kind":"arxiv","id":"0811.4511","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.4511","created_at":"2026-05-18T03:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"0811.4511v2","created_at":"2026-05-18T03:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.4511","created_at":"2026-05-18T03:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"6YHN3ZZDQNAN","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"6YHN3ZZDQNANQCGC","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"6YHN3ZZD","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:6YHN3ZZDQNANQCGCWRAIYYPM4Q","target":"record","payload":{"canonical_record":{"source":{"id":"0811.4511","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2008-11-27T11:19:56Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"e5469fd95a9ace481bc5a87681bca602bb510dd91a637737fe0cf4c2312cb79f","abstract_canon_sha256":"7f47655d2505cf11e17950e56d027367120ad7ac6f74723fed3e52d49aadae41"},"schema_version":"1.0"},"canonical_sha256":"f60edde7238340d808c2b4408c61ece40e7873b8e1a9cc3228a043402d5fe9f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:45.994383Z","signature_b64":"8Ov3lPNt8uM1AWFkLemzXYRw/emMVIujO58Ae+QbMO+qFZtmJDiwZv+a+dkQGRXWfbhCJN7fDUso8QDrXEYBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60edde7238340d808c2b4408c61ece40e7873b8e1a9cc3228a043402d5fe9f5","last_reissued_at":"2026-05-18T03:21:45.993649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:45.993649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.4511","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-18T03:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTpxjXlbJAwuuQ4q5cBdU+TINHTVzcgx5KtasI07PYbH7ImqsSNvgj3LhR2NLuHvpwUce5933eNgd43yMxiQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:01:27.251710Z"},"content_sha256":"856186630999b3f74a140e17a8ca72ab79c6f8c3d53dedd4dbb8a019128e4ba1","schema_version":"1.0","event_id":"sha256:856186630999b3f74a140e17a8ca72ab79c6f8c3d53dedd4dbb8a019128e4ba1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:6YHN3ZZDQNANQCGCWRAIYYPM4Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analytical results for bond percolation and k-core sizes on clustered networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"James P. Gleeson, Sergey Melnik","submitted_at":"2008-11-27T11:19:56Z","abstract_excerpt":"An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a generalization of Trapman's [P. Trapman, Theor. Pop. Biol. {\\bf 71}, 160 (2007)] model of cliques embedded in tree-like random graphs. The resulting networks have arbitrary degree distributions and tunable degree-dependent clustering. The effect of clustering on the bond percolation thresholds for networks of this type is examined and contrasted with some recent resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.4511","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-18T03:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wloIHezgv+bKzAxwNnYZumi7jo2JjvSVLXBJazLoxjuK72DOXXHpzc3pbhb5NRIVkRIJ5Igis3AoMFhG7xtOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:01:27.252379Z"},"content_sha256":"c3c536810ede2a4e19f16f8f9e9ecfb7856f1c04692d0a3f1f8c92a854958da4","schema_version":"1.0","event_id":"sha256:c3c536810ede2a4e19f16f8f9e9ecfb7856f1c04692d0a3f1f8c92a854958da4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YHN3ZZDQNANQCGCWRAIYYPM4Q/bundle.json","state_url":"https://pith.science/pith/6YHN3ZZDQNANQCGCWRAIYYPM4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YHN3ZZDQNANQCGCWRAIYYPM4Q/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-30T18:01:27Z","links":{"resolver":"https://pith.science/pith/6YHN3ZZDQNANQCGCWRAIYYPM4Q","bundle":"https://pith.science/pith/6YHN3ZZDQNANQCGCWRAIYYPM4Q/bundle.json","state":"https://pith.science/pith/6YHN3ZZDQNANQCGCWRAIYYPM4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YHN3ZZDQNANQCGCWRAIYYPM4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:6YHN3ZZDQNANQCGCWRAIYYPM4Q","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":"7f47655d2505cf11e17950e56d027367120ad7ac6f74723fed3e52d49aadae41","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2008-11-27T11:19:56Z","title_canon_sha256":"e5469fd95a9ace481bc5a87681bca602bb510dd91a637737fe0cf4c2312cb79f"},"schema_version":"1.0","source":{"id":"0811.4511","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.4511","created_at":"2026-05-18T03:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"0811.4511v2","created_at":"2026-05-18T03:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.4511","created_at":"2026-05-18T03:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"6YHN3ZZDQNAN","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"6YHN3ZZDQNANQCGC","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"6YHN3ZZD","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:c3c536810ede2a4e19f16f8f9e9ecfb7856f1c04692d0a3f1f8c92a854958da4","target":"graph","created_at":"2026-05-18T03:21:45Z","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":"An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a generalization of Trapman's [P. Trapman, Theor. Pop. Biol. {\\bf 71}, 160 (2007)] model of cliques embedded in tree-like random graphs. The resulting networks have arbitrary degree distributions and tunable degree-dependent clustering. The effect of clustering on the bond percolation thresholds for networks of this type is examined and contrasted with some recent resu","authors_text":"James P. Gleeson, Sergey Melnik","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2008-11-27T11:19:56Z","title":"Analytical results for bond percolation and k-core sizes on clustered networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.4511","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:856186630999b3f74a140e17a8ca72ab79c6f8c3d53dedd4dbb8a019128e4ba1","target":"record","created_at":"2026-05-18T03:21:45Z","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":"7f47655d2505cf11e17950e56d027367120ad7ac6f74723fed3e52d49aadae41","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2008-11-27T11:19:56Z","title_canon_sha256":"e5469fd95a9ace481bc5a87681bca602bb510dd91a637737fe0cf4c2312cb79f"},"schema_version":"1.0","source":{"id":"0811.4511","kind":"arxiv","version":2}},"canonical_sha256":"f60edde7238340d808c2b4408c61ece40e7873b8e1a9cc3228a043402d5fe9f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f60edde7238340d808c2b4408c61ece40e7873b8e1a9cc3228a043402d5fe9f5","first_computed_at":"2026-05-18T03:21:45.993649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:45.993649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Ov3lPNt8uM1AWFkLemzXYRw/emMVIujO58Ae+QbMO+qFZtmJDiwZv+a+dkQGRXWfbhCJN7fDUso8QDrXEYBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:45.994383Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.4511","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:856186630999b3f74a140e17a8ca72ab79c6f8c3d53dedd4dbb8a019128e4ba1","sha256:c3c536810ede2a4e19f16f8f9e9ecfb7856f1c04692d0a3f1f8c92a854958da4"],"state_sha256":"09a38dbfdd99fd5463fd6944762fbb2fd622a9f7e312f473527452f87e59354c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SRGXKpgjCqBcHDC25Vfwjo/9QdwkUeYfKsfgShY+nyug6rX6T7U15V3N8IQBr5q1pmHZfp3VvZcVbGdEfysBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:01:27.255612Z","bundle_sha256":"702398280af07cb36f6930c733d51757cd8dd6b7137d4797465c1db543379718"}}