{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RL2LDUMKO5APH3FGIOJA57MROK","short_pith_number":"pith:RL2LDUMK","schema_version":"1.0","canonical_sha256":"8af4b1d18a7740f3eca643920efd917292c06fc76d6a9170c21a344c89d7b6b3","source":{"kind":"arxiv","id":"1207.3110","version":5},"attestation_state":"computed","paper":{"title":"Real-Time Peer-to-Peer Streaming Over Multiple Random Hamiltonian Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.SI"],"primary_cat":"cs.NI","authors_text":"Joohwan Kim, R. Srikant","submitted_at":"2012-07-12T22:12:52Z","abstract_excerpt":"We are motivated by the problem of designing a simple distributed algorithm for Peer-to-Peer streaming applications that can achieve high throughput and low delay, while allowing the neighbor set maintained by each peer to be small. While previous works have mostly used tree structures, our algorithm constructs multiple random directed Hamiltonian cycles and disseminates content over the superposed graph of the cycles. We show that it is possible to achieve the maximum streaming capacity even when each peer only transmits to and receives from Theta(1) neighbors. Further, we show that the propo"},"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":"1207.3110","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-12T22:12:52Z","cross_cats_sorted":["cs.MM","cs.SI"],"title_canon_sha256":"fa5f84cd59f1ab22c2b9c2aadd8f93c78197af5034e90d406890268aac838641","abstract_canon_sha256":"6d17eb08a5c413527592e6828b4efa9dcb965d0e98983277ba7695ff4e474e6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.767693Z","signature_b64":"VfAuHvpqpGNUUdsTxTTf5ACXLPfA/HKu1RhNQvvP+F2FN0JaZB+JlNMkL/fFu1s2n9fkwJyCB/AhaYKcdj4mAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8af4b1d18a7740f3eca643920efd917292c06fc76d6a9170c21a344c89d7b6b3","last_reissued_at":"2026-05-18T03:27:32.767229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.767229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Real-Time Peer-to-Peer Streaming Over Multiple Random Hamiltonian Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.SI"],"primary_cat":"cs.NI","authors_text":"Joohwan Kim, R. Srikant","submitted_at":"2012-07-12T22:12:52Z","abstract_excerpt":"We are motivated by the problem of designing a simple distributed algorithm for Peer-to-Peer streaming applications that can achieve high throughput and low delay, while allowing the neighbor set maintained by each peer to be small. While previous works have mostly used tree structures, our algorithm constructs multiple random directed Hamiltonian cycles and disseminates content over the superposed graph of the cycles. We show that it is possible to achieve the maximum streaming capacity even when each peer only transmits to and receives from Theta(1) neighbors. Further, we show that the propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3110","kind":"arxiv","version":5},"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":"1207.3110","created_at":"2026-05-18T03:27:32.767303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3110v5","created_at":"2026-05-18T03:27:32.767303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3110","created_at":"2026-05-18T03:27:32.767303+00:00"},{"alias_kind":"pith_short_12","alias_value":"RL2LDUMKO5AP","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RL2LDUMKO5APH3FG","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RL2LDUMK","created_at":"2026-05-18T12:27:20.899486+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/RL2LDUMKO5APH3FGIOJA57MROK","json":"https://pith.science/pith/RL2LDUMKO5APH3FGIOJA57MROK.json","graph_json":"https://pith.science/api/pith-number/RL2LDUMKO5APH3FGIOJA57MROK/graph.json","events_json":"https://pith.science/api/pith-number/RL2LDUMKO5APH3FGIOJA57MROK/events.json","paper":"https://pith.science/paper/RL2LDUMK"},"agent_actions":{"view_html":"https://pith.science/pith/RL2LDUMKO5APH3FGIOJA57MROK","download_json":"https://pith.science/pith/RL2LDUMKO5APH3FGIOJA57MROK.json","view_paper":"https://pith.science/paper/RL2LDUMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3110&json=true","fetch_graph":"https://pith.science/api/pith-number/RL2LDUMKO5APH3FGIOJA57MROK/graph.json","fetch_events":"https://pith.science/api/pith-number/RL2LDUMKO5APH3FGIOJA57MROK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RL2LDUMKO5APH3FGIOJA57MROK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RL2LDUMKO5APH3FGIOJA57MROK/action/storage_attestation","attest_author":"https://pith.science/pith/RL2LDUMKO5APH3FGIOJA57MROK/action/author_attestation","sign_citation":"https://pith.science/pith/RL2LDUMKO5APH3FGIOJA57MROK/action/citation_signature","submit_replication":"https://pith.science/pith/RL2LDUMKO5APH3FGIOJA57MROK/action/replication_record"}},"created_at":"2026-05-18T03:27:32.767303+00:00","updated_at":"2026-05-18T03:27:32.767303+00:00"}