{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:CH3ANZ2U2GIHYIKYR24EMQUVNA","short_pith_number":"pith:CH3ANZ2U","canonical_record":{"source":{"id":"cs/0605080","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"2006-05-18T15:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"df096f599e091bb76914a1950fd5bcacf4f9d2003d67c52e1e44cefe2b026f32","abstract_canon_sha256":"5036506efd8e53f95513e0c2b45fa935c19bbeb02cf00ddecf35f4568878b4d4"},"schema_version":"1.0"},"canonical_sha256":"11f606e754d1907c21588eb8464295683ed2c61ce25a69f17aa76986bf1e470e","source":{"kind":"arxiv","id":"cs/0605080","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605080","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605080v1","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605080","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"CH3ANZ2U2GIH","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"CH3ANZ2U2GIHYIKY","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"CH3ANZ2U","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:CH3ANZ2U2GIHYIKYR24EMQUVNA","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0605080","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"2006-05-18T15:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"df096f599e091bb76914a1950fd5bcacf4f9d2003d67c52e1e44cefe2b026f32","abstract_canon_sha256":"5036506efd8e53f95513e0c2b45fa935c19bbeb02cf00ddecf35f4568878b4d4"},"schema_version":"1.0"},"canonical_sha256":"11f606e754d1907c21588eb8464295683ed2c61ce25a69f17aa76986bf1e470e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:54.769914Z","signature_b64":"790p+SqNfdFc1WigjQ27ueMsqMp+QxBvI/7E5HZ3PdHzMhzd2qbgrgjtcuxWhN48wrb72wCOjSr2m51aqikWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11f606e754d1907c21588eb8464295683ed2c61ce25a69f17aa76986bf1e470e","last_reissued_at":"2026-05-18T01:08:54.769347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:54.769347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0605080","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-18T01:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z02Ssqc4u00dAi4/1Utc3FCEhzuwx/PiHjBxCAUDHbbM2boaIGuG4I5oGwOYdMiFCD4oHCqW+w36/CnoSUJsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:42:50.325069Z"},"content_sha256":"c515fb49680ceb8364533d938b75cfdeca16f87d31a1c9534bdf147ed0e6e4f2","schema_version":"1.0","event_id":"sha256:c515fb49680ceb8364533d938b75cfdeca16f87d31a1c9534bdf147ed0e6e4f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:CH3ANZ2U2GIHYIKYR24EMQUVNA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Locating-First Approach for Scalable Overlay Multicast","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Mohamed Ali Dali Kaafar (INRIA Sophia Antipolis / INRIA Rh\\^one-Alpes), Thierry Turletti (INRIA Sophia Antipolis / INRIA Rh\\^one-Alpes), Walid Dabbous (INRIA Sophia Antipolis / INRIA Rh\\^one-Alpes)","submitted_at":"2006-05-18T15:40:04Z","abstract_excerpt":"Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rely on incremental and periodic refinements to improve the system performance. These approaches are therefore neither scalable, as they induce high communication cost due to refinement overhead, nor efficient because long convergence time is necessary to obtain a stabilized structure. In this paper, we propose a highly scalable locating algorithm that gradually directs newcomers to their a set of their closest nodes withou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605080","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-18T01:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+P00NkDGG8S4VDbeR9mWgpTO3906AmRYjIEbkswQ52lqKrP0Kv4UoNmqAZG5P+9GFf5+/D8YsS2l8jKubW6sDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:42:50.325433Z"},"content_sha256":"62b5c51a3c795f698b4418baa0a1eef90c37d7ad6a82ed467329c04b95865ebb","schema_version":"1.0","event_id":"sha256:62b5c51a3c795f698b4418baa0a1eef90c37d7ad6a82ed467329c04b95865ebb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CH3ANZ2U2GIHYIKYR24EMQUVNA/bundle.json","state_url":"https://pith.science/pith/CH3ANZ2U2GIHYIKYR24EMQUVNA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CH3ANZ2U2GIHYIKYR24EMQUVNA/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-21T00:42:50Z","links":{"resolver":"https://pith.science/pith/CH3ANZ2U2GIHYIKYR24EMQUVNA","bundle":"https://pith.science/pith/CH3ANZ2U2GIHYIKYR24EMQUVNA/bundle.json","state":"https://pith.science/pith/CH3ANZ2U2GIHYIKYR24EMQUVNA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CH3ANZ2U2GIHYIKYR24EMQUVNA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:CH3ANZ2U2GIHYIKYR24EMQUVNA","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":"5036506efd8e53f95513e0c2b45fa935c19bbeb02cf00ddecf35f4568878b4d4","cross_cats_sorted":[],"license":"","primary_cat":"cs.NI","submitted_at":"2006-05-18T15:40:04Z","title_canon_sha256":"df096f599e091bb76914a1950fd5bcacf4f9d2003d67c52e1e44cefe2b026f32"},"schema_version":"1.0","source":{"id":"cs/0605080","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605080","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605080v1","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605080","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"CH3ANZ2U2GIH","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"CH3ANZ2U2GIHYIKY","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"CH3ANZ2U","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:62b5c51a3c795f698b4418baa0a1eef90c37d7ad6a82ed467329c04b95865ebb","target":"graph","created_at":"2026-05-18T01:08:54Z","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":"Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rely on incremental and periodic refinements to improve the system performance. These approaches are therefore neither scalable, as they induce high communication cost due to refinement overhead, nor efficient because long convergence time is necessary to obtain a stabilized structure. In this paper, we propose a highly scalable locating algorithm that gradually directs newcomers to their a set of their closest nodes withou","authors_text":"Mohamed Ali Dali Kaafar (INRIA Sophia Antipolis / INRIA Rh\\^one-Alpes), Thierry Turletti (INRIA Sophia Antipolis / INRIA Rh\\^one-Alpes), Walid Dabbous (INRIA Sophia Antipolis / INRIA Rh\\^one-Alpes)","cross_cats":[],"headline":"","license":"","primary_cat":"cs.NI","submitted_at":"2006-05-18T15:40:04Z","title":"A Locating-First Approach for Scalable Overlay Multicast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605080","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:c515fb49680ceb8364533d938b75cfdeca16f87d31a1c9534bdf147ed0e6e4f2","target":"record","created_at":"2026-05-18T01:08:54Z","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":"5036506efd8e53f95513e0c2b45fa935c19bbeb02cf00ddecf35f4568878b4d4","cross_cats_sorted":[],"license":"","primary_cat":"cs.NI","submitted_at":"2006-05-18T15:40:04Z","title_canon_sha256":"df096f599e091bb76914a1950fd5bcacf4f9d2003d67c52e1e44cefe2b026f32"},"schema_version":"1.0","source":{"id":"cs/0605080","kind":"arxiv","version":1}},"canonical_sha256":"11f606e754d1907c21588eb8464295683ed2c61ce25a69f17aa76986bf1e470e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11f606e754d1907c21588eb8464295683ed2c61ce25a69f17aa76986bf1e470e","first_computed_at":"2026-05-18T01:08:54.769347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:54.769347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"790p+SqNfdFc1WigjQ27ueMsqMp+QxBvI/7E5HZ3PdHzMhzd2qbgrgjtcuxWhN48wrb72wCOjSr2m51aqikWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:54.769914Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0605080","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c515fb49680ceb8364533d938b75cfdeca16f87d31a1c9534bdf147ed0e6e4f2","sha256:62b5c51a3c795f698b4418baa0a1eef90c37d7ad6a82ed467329c04b95865ebb"],"state_sha256":"e61256280784ba2f1e7259d87bfa4af7aaed7ca33dac17389cdf2dcfbae16930"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uniLS1INoHl9ggx/KEOUAvJGUUsEHmxbRrWD6y9r1IkR7aZQRH4AEfo5hL2RgmrPkA//zMg+5PB5PNtIRFFTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T00:42:50.327333Z","bundle_sha256":"f6ac08073fd54d48a00a7e7d4854aa4ea9cc6795ba2379ab2cee16f35246be51"}}