{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TSJB25LW47HLSNTFPFPIHQTRY4","short_pith_number":"pith:TSJB25LW","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"},"canonical_sha256":"9c921d7576e7ceb93665795e83c271c72e355616a39153dc6b328a69503ffecd","source":{"kind":"arxiv","id":"1009.0862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0862","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0862v1","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0862","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"TSJB25LW47HL","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TSJB25LW47HLSNTF","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TSJB25LW","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TSJB25LW47HLSNTFPFPIHQTRY4","target":"record","payload":{"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"},"canonical_sha256":"9c921d7576e7ceb93665795e83c271c72e355616a39153dc6b328a69503ffecd","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"},"source_kind":"arxiv","source_id":"1009.0862","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-18T04:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThqjUUgWTrBqmeF0NxDuUqsrX/sLP3HJgEwPynl6XEKXuHWzzsWQzU6xl7jixHxHTmCps3meLF/symQPRe5FDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:02:16.301870Z"},"content_sha256":"54a5020b6b5793611256897acb1213d72bc8f5ee982eaf97acc73edfb7ab0443","schema_version":"1.0","event_id":"sha256:54a5020b6b5793611256897acb1213d72bc8f5ee982eaf97acc73edfb7ab0443"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TSJB25LW47HLSNTFPFPIHQTRY4","target":"graph","payload":{"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"},"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-18T04:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXx4/ukvVEyBswRf+bA6P0J+g2VtXXx8Z9s1ZOHiYR4WH15SRGnApotjBkTtXxrOS+eoaAnO7Lvp626kmDpmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:02:16.302584Z"},"content_sha256":"5798adf24ee99b59eabdc2749de09009246fe1142cdb8bbd2bccda8b76d16554","schema_version":"1.0","event_id":"sha256:5798adf24ee99b59eabdc2749de09009246fe1142cdb8bbd2bccda8b76d16554"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4/bundle.json","state_url":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSJB25LW47HLSNTFPFPIHQTRY4/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-07T21:02:16Z","links":{"resolver":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4","bundle":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4/bundle.json","state":"https://pith.science/pith/TSJB25LW47HLSNTFPFPIHQTRY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSJB25LW47HLSNTFPFPIHQTRY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TSJB25LW47HLSNTFPFPIHQTRY4","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":"85c5e4752ad378024c63559ce08e4fe3e47ba403cd6bd024f28d78ab6b3d79ac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-09-04T19:28:13Z","title_canon_sha256":"35cb6443aafd0abb7ebb6ba79804bc501676f952545fbafb8a0cf4ec8f5c3adf"},"schema_version":"1.0","source":{"id":"1009.0862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0862","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0862v1","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0862","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"TSJB25LW47HL","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TSJB25LW47HLSNTF","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TSJB25LW","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:5798adf24ee99b59eabdc2749de09009246fe1142cdb8bbd2bccda8b76d16554","target":"graph","created_at":"2026-05-18T04:41: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":"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.","authors_text":"Ana-Delia Sambotin, Andrei Dragus, Mugurel Ionut Andreica, Nicolae Tapus","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-09-04T19:28:13Z","title":"Brief Announcement: Decentralized Construction of Multicast Trees Embedded into P2P Overlay Networks based on Virtual Geometric Coordinates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0862","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:54a5020b6b5793611256897acb1213d72bc8f5ee982eaf97acc73edfb7ab0443","target":"record","created_at":"2026-05-18T04:41: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":"85c5e4752ad378024c63559ce08e4fe3e47ba403cd6bd024f28d78ab6b3d79ac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-09-04T19:28:13Z","title_canon_sha256":"35cb6443aafd0abb7ebb6ba79804bc501676f952545fbafb8a0cf4ec8f5c3adf"},"schema_version":"1.0","source":{"id":"1009.0862","kind":"arxiv","version":1}},"canonical_sha256":"9c921d7576e7ceb93665795e83c271c72e355616a39153dc6b328a69503ffecd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c921d7576e7ceb93665795e83c271c72e355616a39153dc6b328a69503ffecd","first_computed_at":"2026-05-18T04:41:24.415890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:24.415890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ylx3+9GdI6guaCdnPVzKdb4PeaTl7aBMcfqIBRDIvYPyhxQIojAe9/8BFGrRwwiHZD9VHvYP9pxjMP+dt9/sDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:24.416414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.0862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54a5020b6b5793611256897acb1213d72bc8f5ee982eaf97acc73edfb7ab0443","sha256:5798adf24ee99b59eabdc2749de09009246fe1142cdb8bbd2bccda8b76d16554"],"state_sha256":"a6ed734b0e9044753c6a4b58ad1d13d36bde678c0320b8d3fbcc307657bc8f9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mp8GdAPplxavGLYhL7iRYtV4qld/sF9Je+iqZ81NTKMcA5L71UnOVZuOHlZgql9THR3+0kKbSfArpQRSTrpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:02:16.306275Z","bundle_sha256":"6b6ac55b3b232f521f2c36057222c8759af85597d858b9014b591e222ea2580d"}}