{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IRT2Z2ILOL5RW24A2YWHEGH6K2","short_pith_number":"pith:IRT2Z2IL","canonical_record":{"source":{"id":"1405.2233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-05-09T14:02:59Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"40d5644be567c0ff7a1d392e919458ed054bc1a4630baa3d9653990adb19da2f","abstract_canon_sha256":"c8452c67c1430a6ef197e60b916a984ae73ea68e6de14ee3de960c951a45b285"},"schema_version":"1.0"},"canonical_sha256":"4467ace90b72fb1b6b80d62c7218fe56bf1d78c4d18e7a702c4b29446d158108","source":{"kind":"arxiv","id":"1405.2233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2233","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2233v1","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2233","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"IRT2Z2ILOL5R","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IRT2Z2ILOL5RW24A","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IRT2Z2IL","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IRT2Z2ILOL5RW24A2YWHEGH6K2","target":"record","payload":{"canonical_record":{"source":{"id":"1405.2233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-05-09T14:02:59Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"40d5644be567c0ff7a1d392e919458ed054bc1a4630baa3d9653990adb19da2f","abstract_canon_sha256":"c8452c67c1430a6ef197e60b916a984ae73ea68e6de14ee3de960c951a45b285"},"schema_version":"1.0"},"canonical_sha256":"4467ace90b72fb1b6b80d62c7218fe56bf1d78c4d18e7a702c4b29446d158108","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:13.330953Z","signature_b64":"HufDmut2CF+sT/F2n7cgi8rYNwRsqUFwVaSBkAEdHYYM18q3PTPE6qSO/JXwoGvdZM/1tZYpno5W1+Tc7/sRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4467ace90b72fb1b6b80d62c7218fe56bf1d78c4d18e7a702c4b29446d158108","last_reissued_at":"2026-05-18T02:52:13.330442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:13.330442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.2233","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-18T02:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDvA1zsslqNGz9eWLeVac347B8Vz2Epx94KECRKU9guBYiWyOYTWpTNEYH/vAvvfMPSiqTe6ZcqCY6CSDfd2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:47:10.769883Z"},"content_sha256":"dd3409391cf8de8adab13ef3d58d666f0ce1d1fa155bb3b31e4d9854311c1799","schema_version":"1.0","event_id":"sha256:dd3409391cf8de8adab13ef3d58d666f0ce1d1fa155bb3b31e4d9854311c1799"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IRT2Z2ILOL5RW24A2YWHEGH6K2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Percolation in Random Graphs: A Finite Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cond-mat.stat-mech","authors_text":"Lyle E. Muller, Michelle Rudolph-Lilith","submitted_at":"2014-05-09T14:02:59Z","abstract_excerpt":"We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which scales in accordance with results obtained for infinite random graphs using the emergence of a giant connected component as marking the percolation transition. Our approach is general and can be applied to all graph models for which an algebraic formulation of the adjacency matrix is available."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2233","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-18T02:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/HUWED2XgCgiqW/C0h5QyT0Bfl1TbCZTv0uMJK1NY+5nNokQdChjTT6o7JZeaaj7k6xFz/B7YLRv+qELV9KtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:47:10.770230Z"},"content_sha256":"a1a5bab829d8b568eac64bc5eec00ea3e2ee07b19d8bd7f0f91e86b07b93c518","schema_version":"1.0","event_id":"sha256:a1a5bab829d8b568eac64bc5eec00ea3e2ee07b19d8bd7f0f91e86b07b93c518"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRT2Z2ILOL5RW24A2YWHEGH6K2/bundle.json","state_url":"https://pith.science/pith/IRT2Z2ILOL5RW24A2YWHEGH6K2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRT2Z2ILOL5RW24A2YWHEGH6K2/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-23T06:47:10Z","links":{"resolver":"https://pith.science/pith/IRT2Z2ILOL5RW24A2YWHEGH6K2","bundle":"https://pith.science/pith/IRT2Z2ILOL5RW24A2YWHEGH6K2/bundle.json","state":"https://pith.science/pith/IRT2Z2ILOL5RW24A2YWHEGH6K2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRT2Z2ILOL5RW24A2YWHEGH6K2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IRT2Z2ILOL5RW24A2YWHEGH6K2","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":"c8452c67c1430a6ef197e60b916a984ae73ea68e6de14ee3de960c951a45b285","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-05-09T14:02:59Z","title_canon_sha256":"40d5644be567c0ff7a1d392e919458ed054bc1a4630baa3d9653990adb19da2f"},"schema_version":"1.0","source":{"id":"1405.2233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2233","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2233v1","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2233","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"IRT2Z2ILOL5R","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IRT2Z2ILOL5RW24A","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IRT2Z2IL","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:a1a5bab829d8b568eac64bc5eec00ea3e2ee07b19d8bd7f0f91e86b07b93c518","target":"graph","created_at":"2026-05-18T02:52:13Z","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 an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which scales in accordance with results obtained for infinite random graphs using the emergence of a giant connected component as marking the percolation transition. Our approach is general and can be applied to all graph models for which an algebraic formulation of the adjacency matrix is available.","authors_text":"Lyle E. Muller, Michelle Rudolph-Lilith","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-05-09T14:02:59Z","title":"Percolation in Random Graphs: A Finite Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2233","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:dd3409391cf8de8adab13ef3d58d666f0ce1d1fa155bb3b31e4d9854311c1799","target":"record","created_at":"2026-05-18T02:52:13Z","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":"c8452c67c1430a6ef197e60b916a984ae73ea68e6de14ee3de960c951a45b285","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-05-09T14:02:59Z","title_canon_sha256":"40d5644be567c0ff7a1d392e919458ed054bc1a4630baa3d9653990adb19da2f"},"schema_version":"1.0","source":{"id":"1405.2233","kind":"arxiv","version":1}},"canonical_sha256":"4467ace90b72fb1b6b80d62c7218fe56bf1d78c4d18e7a702c4b29446d158108","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4467ace90b72fb1b6b80d62c7218fe56bf1d78c4d18e7a702c4b29446d158108","first_computed_at":"2026-05-18T02:52:13.330442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:13.330442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HufDmut2CF+sT/F2n7cgi8rYNwRsqUFwVaSBkAEdHYYM18q3PTPE6qSO/JXwoGvdZM/1tZYpno5W1+Tc7/sRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:13.330953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd3409391cf8de8adab13ef3d58d666f0ce1d1fa155bb3b31e4d9854311c1799","sha256:a1a5bab829d8b568eac64bc5eec00ea3e2ee07b19d8bd7f0f91e86b07b93c518"],"state_sha256":"5515c523cda2f20bbb18d9d974be3f3615194aac5c6a2bd2b5f7438f99056816"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDnfwDap+LZAHovqJlTQ6U4i3UsppPfP2zdopmZpVkqsp9ViA3EWBr3v90PYfNpBx5aadvBklJM8s7tfiFdcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T06:47:10.772144Z","bundle_sha256":"4d12f8e45541f2eb4498da9a8cf09060489eee85e45abd53b44b82ae8b715122"}}