{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:72IBLY74KFRRGMVU3NT6CA5WND","short_pith_number":"pith:72IBLY74","canonical_record":{"source":{"id":"1806.05743","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-06-14T21:18:06Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"77499acc680f74943b5d1b755e50db14de35131669be4dd0e6956c03f1a5489a","abstract_canon_sha256":"1e338d1b39ec824ff337bc8b3ce5e1f41924f8b6c3d1918552e0748f7ebd63cc"},"schema_version":"1.0"},"canonical_sha256":"fe9015e3fc51631332b4db67e103b668ec464eaa6d2f8bf780a436b6fd77624c","source":{"kind":"arxiv","id":"1806.05743","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05743","created_at":"2026-05-18T00:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05743v2","created_at":"2026-05-18T00:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05743","created_at":"2026-05-18T00:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"72IBLY74KFRR","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"72IBLY74KFRRGMVU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"72IBLY74","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:72IBLY74KFRRGMVU3NT6CA5WND","target":"record","payload":{"canonical_record":{"source":{"id":"1806.05743","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-06-14T21:18:06Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"77499acc680f74943b5d1b755e50db14de35131669be4dd0e6956c03f1a5489a","abstract_canon_sha256":"1e338d1b39ec824ff337bc8b3ce5e1f41924f8b6c3d1918552e0748f7ebd63cc"},"schema_version":"1.0"},"canonical_sha256":"fe9015e3fc51631332b4db67e103b668ec464eaa6d2f8bf780a436b6fd77624c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:46.582496Z","signature_b64":"KeyUnvnBAM/qIQSPxngjcvH/oT+gickLpRMB1r6uQHq7tUvUpNYDb29FqJoOpwdkTSo30sCE55QdOjeKCtWWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe9015e3fc51631332b4db67e103b668ec464eaa6d2f8bf780a436b6fd77624c","last_reissued_at":"2026-05-18T00:11:46.581712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:46.581712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.05743","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-18T00:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xark8SAmDuFZmMwKKAShRVxHD8xH861PtdyNu2aUjkY3YfJkvTOWHT524N0w5ewfr5+sQQq9Iu/hRfPMZcRPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:02:31.951043Z"},"content_sha256":"cf2ab59f3de9470eccffa22ce086f00280f1b1c8e931695978107c0751a9eb97","schema_version":"1.0","event_id":"sha256:cf2ab59f3de9470eccffa22ce086f00280f1b1c8e931695978107c0751a9eb97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:72IBLY74KFRRGMVU3NT6CA5WND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The distribution of shortest path lengths in subcritical Erd\\H{o}s-R\\'enyi networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alexander K. Hartmann, Eytan Katzav, Ofer Biham","submitted_at":"2018-06-14T21:18:06Z","abstract_excerpt":"Networks that are fragmented into small disconnected components are prevalent in a large variety of systems. These include the secure communication networks of commercial enterprises, government agencies and illicit organizations, as well as networks that suffered multiple failures, attacks or epidemics. The properties of such networks resemble those of subcritical random networks, which consist of finite components, whose sizes are non-extensive. Surprisingly, such networks do not exhibit the small-world property that is typical in supercritical random networks, where the mean distance betwee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05743","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-18T00:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AdQ2izEUPZfLPGParnp54nsnRIi9il6lFWJqGayPyi45Kbtkk+Ya/F76o5dH+MyaEZg2wu+6DG6lEo1nZl3pAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:02:31.951405Z"},"content_sha256":"23a23a9596f0804d005732ae15c4b7f8af40301358206f129f9a462deee3ece2","schema_version":"1.0","event_id":"sha256:23a23a9596f0804d005732ae15c4b7f8af40301358206f129f9a462deee3ece2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72IBLY74KFRRGMVU3NT6CA5WND/bundle.json","state_url":"https://pith.science/pith/72IBLY74KFRRGMVU3NT6CA5WND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72IBLY74KFRRGMVU3NT6CA5WND/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-02T20:02:31Z","links":{"resolver":"https://pith.science/pith/72IBLY74KFRRGMVU3NT6CA5WND","bundle":"https://pith.science/pith/72IBLY74KFRRGMVU3NT6CA5WND/bundle.json","state":"https://pith.science/pith/72IBLY74KFRRGMVU3NT6CA5WND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72IBLY74KFRRGMVU3NT6CA5WND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:72IBLY74KFRRGMVU3NT6CA5WND","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":"1e338d1b39ec824ff337bc8b3ce5e1f41924f8b6c3d1918552e0748f7ebd63cc","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-06-14T21:18:06Z","title_canon_sha256":"77499acc680f74943b5d1b755e50db14de35131669be4dd0e6956c03f1a5489a"},"schema_version":"1.0","source":{"id":"1806.05743","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05743","created_at":"2026-05-18T00:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05743v2","created_at":"2026-05-18T00:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05743","created_at":"2026-05-18T00:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"72IBLY74KFRR","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"72IBLY74KFRRGMVU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"72IBLY74","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:23a23a9596f0804d005732ae15c4b7f8af40301358206f129f9a462deee3ece2","target":"graph","created_at":"2026-05-18T00:11:46Z","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":"Networks that are fragmented into small disconnected components are prevalent in a large variety of systems. These include the secure communication networks of commercial enterprises, government agencies and illicit organizations, as well as networks that suffered multiple failures, attacks or epidemics. The properties of such networks resemble those of subcritical random networks, which consist of finite components, whose sizes are non-extensive. Surprisingly, such networks do not exhibit the small-world property that is typical in supercritical random networks, where the mean distance betwee","authors_text":"Alexander K. Hartmann, Eytan Katzav, Ofer Biham","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-06-14T21:18:06Z","title":"The distribution of shortest path lengths in subcritical Erd\\H{o}s-R\\'enyi networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05743","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:cf2ab59f3de9470eccffa22ce086f00280f1b1c8e931695978107c0751a9eb97","target":"record","created_at":"2026-05-18T00:11:46Z","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":"1e338d1b39ec824ff337bc8b3ce5e1f41924f8b6c3d1918552e0748f7ebd63cc","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-06-14T21:18:06Z","title_canon_sha256":"77499acc680f74943b5d1b755e50db14de35131669be4dd0e6956c03f1a5489a"},"schema_version":"1.0","source":{"id":"1806.05743","kind":"arxiv","version":2}},"canonical_sha256":"fe9015e3fc51631332b4db67e103b668ec464eaa6d2f8bf780a436b6fd77624c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe9015e3fc51631332b4db67e103b668ec464eaa6d2f8bf780a436b6fd77624c","first_computed_at":"2026-05-18T00:11:46.581712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:46.581712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KeyUnvnBAM/qIQSPxngjcvH/oT+gickLpRMB1r6uQHq7tUvUpNYDb29FqJoOpwdkTSo30sCE55QdOjeKCtWWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:46.582496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.05743","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf2ab59f3de9470eccffa22ce086f00280f1b1c8e931695978107c0751a9eb97","sha256:23a23a9596f0804d005732ae15c4b7f8af40301358206f129f9a462deee3ece2"],"state_sha256":"d29f4662a6a50ad5d518d84a5ed61b1447550526a981aafc273416ab904f45b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Huz+sIh2rLOBYjAFe0wJmL/Tx0HcYe+38SP0Od9sNS24Psk4uE5UQSObCi9Hx/tL2LatJdCqFnLDmy3xbFzSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:02:31.953466Z","bundle_sha256":"d809429ad8fb6ab18dc613ba2ddadc899bd08e880f9885f440771a586639c707"}}