{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TSJB25LW47HLSNTFPFPIHQTRY4","short_pith_number":"pith:TSJB25LW","schema_version":"1.0","canonical_sha256":"9c921d7576e7ceb93665795e83c271c72e355616a39153dc6b328a69503ffecd","source":{"kind":"arxiv","id":"1009.0862","version":1},"attestation_state":"computed","paper":{"title":"Brief Announcement: Decentralized Construction of Multicast Trees Embedded into P2P Overlay Networks based on Virtual Geometric Coordinates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ana-Delia Sambotin, Andrei Dragus, Mugurel Ionut Andreica, Nicolae Tapus","submitted_at":"2010-09-04T19:28:13Z","abstract_excerpt":"In this paper we consider the problem of efficiently constructing in a fully distributed manner multicast trees which are embedded into P2P overlays using virtual geometric node coordinates. We consider two objectives: to minimize the number of messages required for constructing a multicast tree by using the geometric properties of the P2P overlay, and to construct stable multicast trees when the lifetime durations of the peers are known."},"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":"1009.0862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-09-04T19:28:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"35cb6443aafd0abb7ebb6ba79804bc501676f952545fbafb8a0cf4ec8f5c3adf","abstract_canon_sha256":"85c5e4752ad378024c63559ce08e4fe3e47ba403cd6bd024f28d78ab6b3d79ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:24.416414Z","signature_b64":"Ylx3+9GdI6guaCdnPVzKdb4PeaTl7aBMcfqIBRDIvYPyhxQIojAe9/8BFGrRwwiHZD9VHvYP9pxjMP+dt9/sDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c921d7576e7ceb93665795e83c271c72e355616a39153dc6b328a69503ffecd","last_reissued_at":"2026-05-18T04:41:24.415890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:24.415890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Brief Announcement: Decentralized Construction of Multicast Trees Embedded into P2P Overlay Networks based on Virtual Geometric Coordinates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ana-Delia Sambotin, Andrei Dragus, Mugurel Ionut Andreica, Nicolae Tapus","submitted_at":"2010-09-04T19:28:13Z","abstract_excerpt":"In this paper we consider the problem of efficiently constructing in a fully distributed manner multicast trees which are embedded into P2P overlays using virtual geometric node coordinates. We consider two objectives: to minimize the number of messages required for constructing a multicast tree by using the geometric properties of the P2P overlay, and to construct stable multicast trees when the lifetime durations of the peers are known."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0862","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.0862","created_at":"2026-05-18T04:41:24.415974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.0862v1","created_at":"2026-05-18T04:41:24.415974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0862","created_at":"2026-05-18T04:41:24.415974+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSJB25LW47HL","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSJB25LW47HLSNTF","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSJB25LW","created_at":"2026-05-18T12:26:15.391820+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/TSJB25LW47HLSNTFPFPIHQTRY4","json":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4.json","graph_json":"https://pith.science/api/pith-number/TSJB25LW47HLSNTFPFPIHQTRY4/graph.json","events_json":"https://pith.science/api/pith-number/TSJB25LW47HLSNTFPFPIHQTRY4/events.json","paper":"https://pith.science/paper/TSJB25LW"},"agent_actions":{"view_html":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4","download_json":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4.json","view_paper":"https://pith.science/paper/TSJB25LW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.0862&json=true","fetch_graph":"https://pith.science/api/pith-number/TSJB25LW47HLSNTFPFPIHQTRY4/graph.json","fetch_events":"https://pith.science/api/pith-number/TSJB25LW47HLSNTFPFPIHQTRY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4/action/storage_attestation","attest_author":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4/action/author_attestation","sign_citation":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4/action/citation_signature","submit_replication":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4/action/replication_record"}},"created_at":"2026-05-18T04:41:24.415974+00:00","updated_at":"2026-05-18T04:41:24.415974+00:00"}