{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B2SU2MD5YKH77JEJP4NPJDIZHQ","short_pith_number":"pith:B2SU2MD5","canonical_record":{"source":{"id":"1305.1121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-06T09:04:39Z","cross_cats_sorted":[],"title_canon_sha256":"36595f4bbfaf4b258990bac1a20210d14e2c1196a895085c02e9230da88f1776","abstract_canon_sha256":"e4141acc7986ccf80cff67731f8e817fd7d0365821e202cededf3a631f737d0d"},"schema_version":"1.0"},"canonical_sha256":"0ea54d307dc28fffa4897f1af48d193c2288bd2d80bb020fd2fc379e8fb854f7","source":{"kind":"arxiv","id":"1305.1121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1121","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1121v1","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1121","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"B2SU2MD5YKH7","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B2SU2MD5YKH77JEJ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B2SU2MD5","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B2SU2MD5YKH77JEJP4NPJDIZHQ","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-06T09:04:39Z","cross_cats_sorted":[],"title_canon_sha256":"36595f4bbfaf4b258990bac1a20210d14e2c1196a895085c02e9230da88f1776","abstract_canon_sha256":"e4141acc7986ccf80cff67731f8e817fd7d0365821e202cededf3a631f737d0d"},"schema_version":"1.0"},"canonical_sha256":"0ea54d307dc28fffa4897f1af48d193c2288bd2d80bb020fd2fc379e8fb854f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:24.101466Z","signature_b64":"oCbeb+wTDhtH2pLHBtS8B0uYTk/idD6xSVpqx0SS11RHVfDsvYoqqZZDBq0+RPSRDe8X8T3bNcVQAC6ZFClbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ea54d307dc28fffa4897f1af48d193c2288bd2d80bb020fd2fc379e8fb854f7","last_reissued_at":"2026-05-18T03:26:24.100890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:24.100890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1121","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-18T03:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3fUiQk57QGGoo1FKYZaSvHQJ75biMA6mXCJYhJEFMoAKT04mQDT2UkE7KhXyFXPranUNv63o6N+k7CsTp0cCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:34:54.092871Z"},"content_sha256":"4096533a4aab8e7e8ba7c60537bb42c7c3121f43f1b51ed600049d0d4e3fbb2d","schema_version":"1.0","event_id":"sha256:4096533a4aab8e7e8ba7c60537bb42c7c3121f43f1b51ed600049d0d4e3fbb2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B2SU2MD5YKH77JEJP4NPJDIZHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Storage and Search in Dynamic Peer-to-Peer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Ehab Morsy, Eli Upfal, Gopal Pandurangan, John Augustine, Peter Robinson","submitted_at":"2013-05-06T09:04:39Z","abstract_excerpt":"We study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to guarantee, despite high node churn rate, that a large number of nodes in the network can store, retrieve, and maintain a large number of data items. Our main contributions are fast randomized distributed algorithms that guarantee the above with high probability (whp) even under high adversarial churn:\n  1. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1121","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-18T03:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsVjcFp2sFO9LT5uoLrqdjVvIZCifGHezvoXGfyhG9lEv/CZTyANJ/KEaQOnWkaETIRpHHJ3fE0ykRd7LPdAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:34:54.093222Z"},"content_sha256":"19336e5dcd7f4e3d3ae8044193b784315a850a3f37adb36d22267924c4aae599","schema_version":"1.0","event_id":"sha256:19336e5dcd7f4e3d3ae8044193b784315a850a3f37adb36d22267924c4aae599"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2SU2MD5YKH77JEJP4NPJDIZHQ/bundle.json","state_url":"https://pith.science/pith/B2SU2MD5YKH77JEJP4NPJDIZHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2SU2MD5YKH77JEJP4NPJDIZHQ/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-11T14:34:54Z","links":{"resolver":"https://pith.science/pith/B2SU2MD5YKH77JEJP4NPJDIZHQ","bundle":"https://pith.science/pith/B2SU2MD5YKH77JEJP4NPJDIZHQ/bundle.json","state":"https://pith.science/pith/B2SU2MD5YKH77JEJP4NPJDIZHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2SU2MD5YKH77JEJP4NPJDIZHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B2SU2MD5YKH77JEJP4NPJDIZHQ","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":"e4141acc7986ccf80cff67731f8e817fd7d0365821e202cededf3a631f737d0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-06T09:04:39Z","title_canon_sha256":"36595f4bbfaf4b258990bac1a20210d14e2c1196a895085c02e9230da88f1776"},"schema_version":"1.0","source":{"id":"1305.1121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1121","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1121v1","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1121","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"B2SU2MD5YKH7","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B2SU2MD5YKH77JEJ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B2SU2MD5","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:19336e5dcd7f4e3d3ae8044193b784315a850a3f37adb36d22267924c4aae599","target":"graph","created_at":"2026-05-18T03:26:24Z","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 study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to guarantee, despite high node churn rate, that a large number of nodes in the network can store, retrieve, and maintain a large number of data items. Our main contributions are fast randomized distributed algorithms that guarantee the above with high probability (whp) even under high adversarial churn:\n  1. ","authors_text":"Anisur Rahaman Molla, Ehab Morsy, Eli Upfal, Gopal Pandurangan, John Augustine, Peter Robinson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-06T09:04:39Z","title":"Storage and Search in Dynamic Peer-to-Peer Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1121","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:4096533a4aab8e7e8ba7c60537bb42c7c3121f43f1b51ed600049d0d4e3fbb2d","target":"record","created_at":"2026-05-18T03:26:24Z","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":"e4141acc7986ccf80cff67731f8e817fd7d0365821e202cededf3a631f737d0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-06T09:04:39Z","title_canon_sha256":"36595f4bbfaf4b258990bac1a20210d14e2c1196a895085c02e9230da88f1776"},"schema_version":"1.0","source":{"id":"1305.1121","kind":"arxiv","version":1}},"canonical_sha256":"0ea54d307dc28fffa4897f1af48d193c2288bd2d80bb020fd2fc379e8fb854f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ea54d307dc28fffa4897f1af48d193c2288bd2d80bb020fd2fc379e8fb854f7","first_computed_at":"2026-05-18T03:26:24.100890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:24.100890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oCbeb+wTDhtH2pLHBtS8B0uYTk/idD6xSVpqx0SS11RHVfDsvYoqqZZDBq0+RPSRDe8X8T3bNcVQAC6ZFClbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:24.101466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4096533a4aab8e7e8ba7c60537bb42c7c3121f43f1b51ed600049d0d4e3fbb2d","sha256:19336e5dcd7f4e3d3ae8044193b784315a850a3f37adb36d22267924c4aae599"],"state_sha256":"1fbb92c30ba24aa0f5b40af67bf890f24760b636374f5a59e4804bdb3adf0d6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3Tmy1M3i5O/5kPoFTXHzEwaK+cf2HjqVQov2G/aPe7WXvBkOeAbo3gj7+IDIsAoC2byxv2VYrAXkDhzvYV3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:34:54.095162Z","bundle_sha256":"8efc755afad4bddea233111d5f28132626a2ebf0266a5815ab76315d8faacf21"}}