{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AWA5IQREHAJT3T6FFKRDO4FEYZ","short_pith_number":"pith:AWA5IQRE","schema_version":"1.0","canonical_sha256":"0581d4422438133dcfc52aa23770a4c64b4a989d551dee090912799fa258a1ff","source":{"kind":"arxiv","id":"1011.3182","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Analysis of a Churn-Tolerant Structured Peer-to-Peer Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Gopal Pandurangan, Tim Jacobs","submitted_at":"2010-11-14T04:05:49Z","abstract_excerpt":"We present and analyze a simple and general scheme to build a churn (fault)-tolerant structured Peer-to-Peer (P2P) network. Our scheme shows how to \"convert\" a static network into a dynamic distributed hash table(DHT)-based P2P network such that all the good properties of the static network are guaranteed with high probability (w.h.p). Applying our scheme to a cube-connected cycles network, for example, yields a $O(\\log N)$ degree connected network, in which every search succeeds in $O(\\log N)$ hops w.h.p., using $O(\\log N)$ messages, where $N$ is the expected stable network size. Our scheme h"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1011.3182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-14T04:05:49Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"5531641459fcd8027953e4bea011f96fef67432632e11aecbb4470fe52c8d7d5","abstract_canon_sha256":"1fd242e8a1ce69d11919f690fa037d71c52462a7544aced05fe2a123205969e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:21.002060Z","signature_b64":"AdvYZKJitvnovUg2qZmGuCcGBcT3hEJSJemGi064VVuFEcTwWamJPqIViQ398OiT3J8f1nyesfHCdE8dNg9lBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0581d4422438133dcfc52aa23770a4c64b4a989d551dee090912799fa258a1ff","last_reissued_at":"2026-05-18T01:35:21.001340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:21.001340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Analysis of a Churn-Tolerant Structured Peer-to-Peer Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Gopal Pandurangan, Tim Jacobs","submitted_at":"2010-11-14T04:05:49Z","abstract_excerpt":"We present and analyze a simple and general scheme to build a churn (fault)-tolerant structured Peer-to-Peer (P2P) network. Our scheme shows how to \"convert\" a static network into a dynamic distributed hash table(DHT)-based P2P network such that all the good properties of the static network are guaranteed with high probability (w.h.p). Applying our scheme to a cube-connected cycles network, for example, yields a $O(\\log N)$ degree connected network, in which every search succeeds in $O(\\log N)$ hops w.h.p., using $O(\\log N)$ messages, where $N$ is the expected stable network size. Our scheme h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3182","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.3182","created_at":"2026-05-18T01:35:21.001470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3182v2","created_at":"2026-05-18T01:35:21.001470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3182","created_at":"2026-05-18T01:35:21.001470+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWA5IQREHAJT","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWA5IQREHAJT3T6F","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWA5IQRE","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AWA5IQREHAJT3T6FFKRDO4FEYZ","json":"https://pith.science/pith/AWA5IQREHAJT3T6FFKRDO4FEYZ.json","graph_json":"https://pith.science/api/pith-number/AWA5IQREHAJT3T6FFKRDO4FEYZ/graph.json","events_json":"https://pith.science/api/pith-number/AWA5IQREHAJT3T6FFKRDO4FEYZ/events.json","paper":"https://pith.science/paper/AWA5IQRE"},"agent_actions":{"view_html":"https://pith.science/pith/AWA5IQREHAJT3T6FFKRDO4FEYZ","download_json":"https://pith.science/pith/AWA5IQREHAJT3T6FFKRDO4FEYZ.json","view_paper":"https://pith.science/paper/AWA5IQRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3182&json=true","fetch_graph":"https://pith.science/api/pith-number/AWA5IQREHAJT3T6FFKRDO4FEYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/AWA5IQREHAJT3T6FFKRDO4FEYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWA5IQREHAJT3T6FFKRDO4FEYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWA5IQREHAJT3T6FFKRDO4FEYZ/action/storage_attestation","attest_author":"https://pith.science/pith/AWA5IQREHAJT3T6FFKRDO4FEYZ/action/author_attestation","sign_citation":"https://pith.science/pith/AWA5IQREHAJT3T6FFKRDO4FEYZ/action/citation_signature","submit_replication":"https://pith.science/pith/AWA5IQREHAJT3T6FFKRDO4FEYZ/action/replication_record"}},"created_at":"2026-05-18T01:35:21.001470+00:00","updated_at":"2026-05-18T01:35:21.001470+00:00"}