{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:H2JPCCZ7MUFCIBENDH3A4CEH7G","short_pith_number":"pith:H2JPCCZ7","canonical_record":{"source":{"id":"0902.3528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-02-20T07:40:44Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"9d2d72462d13bb83f43f65f633c9ff059390ee9f61cf8b7f6d5e988f6c863ab5","abstract_canon_sha256":"05396811727554f14c975476695e92cc801c636227ccbbb2feb4142c0e3a6ce2"},"schema_version":"1.0"},"canonical_sha256":"3e92f10b3f650a24048d19f60e0887f9a370543edabc88dd6b641d2977d56ade","source":{"kind":"arxiv","id":"0902.3528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.3528","created_at":"2026-05-18T02:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"0902.3528v1","created_at":"2026-05-18T02:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3528","created_at":"2026-05-18T02:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"H2JPCCZ7MUFC","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"H2JPCCZ7MUFCIBEN","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"H2JPCCZ7","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:H2JPCCZ7MUFCIBENDH3A4CEH7G","target":"record","payload":{"canonical_record":{"source":{"id":"0902.3528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-02-20T07:40:44Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"9d2d72462d13bb83f43f65f633c9ff059390ee9f61cf8b7f6d5e988f6c863ab5","abstract_canon_sha256":"05396811727554f14c975476695e92cc801c636227ccbbb2feb4142c0e3a6ce2"},"schema_version":"1.0"},"canonical_sha256":"3e92f10b3f650a24048d19f60e0887f9a370543edabc88dd6b641d2977d56ade","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:46.755926Z","signature_b64":"wx8KWI0u9ZrDifeNk60ZaQBOr3wxqTPDnLfyQuHrFgbUVVjRBRTd2+RLVCLCRfoCaCHdYD1jc0f+ZmKcwGH0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e92f10b3f650a24048d19f60e0887f9a370543edabc88dd6b641d2977d56ade","last_reissued_at":"2026-05-18T02:14:46.755382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:46.755382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0902.3528","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-18T02:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MwtKHwyQejGd+mjIT54r0J02jan8EYzGqtm/RBC5sM4MkSJqo8SFPfbukZEzikuFViC6+fQiqZ6KFi6EEOLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:32:06.911834Z"},"content_sha256":"6547f9fd5d123030099d636f33023912660dddc9f6f38f8286380d6766e53d72","schema_version":"1.0","event_id":"sha256:6547f9fd5d123030099d636f33023912660dddc9f6f38f8286380d6766e53d72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:H2JPCCZ7MUFCIBENDH3A4CEH7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Superstabilizing $\\log(n)$-Approximation Algorithm for Dynamic Steiner Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"L\\'elia Blin (IBISC), Maria Gradinariu Potop-Butucaru (LIP6), Stephane Rovedakis (IBISC)","submitted_at":"2009-02-20T07:40:44Z","abstract_excerpt":"In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group) . Steiner trees are good candidates to efficiently implement communication primitives such as publish/subscribe or multicast, essential building blocks for the new emergent networks (e.g. P2P, sensor or adhoc networks). The cost of the solution returned by our algorithm is at most $\\log |S|$ times the cost of an optimal solution, where $S$ is the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.3528","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-18T02:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/1ssQSB01Bcf63EOfvdwaiddCyrpH3UyHkg2GWVoWZG85artgIOgZ3FKcNsCvr12vdYoUAbSgu3qFt3yeEjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:32:06.912487Z"},"content_sha256":"5564f20c180a04fa0ce962bc5153e498320b409ab0951d7b26cd3674c85e2293","schema_version":"1.0","event_id":"sha256:5564f20c180a04fa0ce962bc5153e498320b409ab0951d7b26cd3674c85e2293"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2JPCCZ7MUFCIBENDH3A4CEH7G/bundle.json","state_url":"https://pith.science/pith/H2JPCCZ7MUFCIBENDH3A4CEH7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2JPCCZ7MUFCIBENDH3A4CEH7G/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-07T06:32:06Z","links":{"resolver":"https://pith.science/pith/H2JPCCZ7MUFCIBENDH3A4CEH7G","bundle":"https://pith.science/pith/H2JPCCZ7MUFCIBENDH3A4CEH7G/bundle.json","state":"https://pith.science/pith/H2JPCCZ7MUFCIBENDH3A4CEH7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2JPCCZ7MUFCIBENDH3A4CEH7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:H2JPCCZ7MUFCIBENDH3A4CEH7G","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":"05396811727554f14c975476695e92cc801c636227ccbbb2feb4142c0e3a6ce2","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-02-20T07:40:44Z","title_canon_sha256":"9d2d72462d13bb83f43f65f633c9ff059390ee9f61cf8b7f6d5e988f6c863ab5"},"schema_version":"1.0","source":{"id":"0902.3528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.3528","created_at":"2026-05-18T02:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"0902.3528v1","created_at":"2026-05-18T02:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3528","created_at":"2026-05-18T02:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"H2JPCCZ7MUFC","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"H2JPCCZ7MUFCIBEN","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"H2JPCCZ7","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:5564f20c180a04fa0ce962bc5153e498320b409ab0951d7b26cd3674c85e2293","target":"graph","created_at":"2026-05-18T02:14:46Z","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 design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group) . Steiner trees are good candidates to efficiently implement communication primitives such as publish/subscribe or multicast, essential building blocks for the new emergent networks (e.g. P2P, sensor or adhoc networks). The cost of the solution returned by our algorithm is at most $\\log |S|$ times the cost of an optimal solution, where $S$ is the ","authors_text":"L\\'elia Blin (IBISC), Maria Gradinariu Potop-Butucaru (LIP6), Stephane Rovedakis (IBISC)","cross_cats":["cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-02-20T07:40:44Z","title":"A Superstabilizing $\\log(n)$-Approximation Algorithm for Dynamic Steiner Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.3528","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:6547f9fd5d123030099d636f33023912660dddc9f6f38f8286380d6766e53d72","target":"record","created_at":"2026-05-18T02:14:46Z","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":"05396811727554f14c975476695e92cc801c636227ccbbb2feb4142c0e3a6ce2","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-02-20T07:40:44Z","title_canon_sha256":"9d2d72462d13bb83f43f65f633c9ff059390ee9f61cf8b7f6d5e988f6c863ab5"},"schema_version":"1.0","source":{"id":"0902.3528","kind":"arxiv","version":1}},"canonical_sha256":"3e92f10b3f650a24048d19f60e0887f9a370543edabc88dd6b641d2977d56ade","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e92f10b3f650a24048d19f60e0887f9a370543edabc88dd6b641d2977d56ade","first_computed_at":"2026-05-18T02:14:46.755382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:14:46.755382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wx8KWI0u9ZrDifeNk60ZaQBOr3wxqTPDnLfyQuHrFgbUVVjRBRTd2+RLVCLCRfoCaCHdYD1jc0f+ZmKcwGH0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:14:46.755926Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.3528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6547f9fd5d123030099d636f33023912660dddc9f6f38f8286380d6766e53d72","sha256:5564f20c180a04fa0ce962bc5153e498320b409ab0951d7b26cd3674c85e2293"],"state_sha256":"15e8b490a4649e36342c584c0be22d5bfd79621ba12e40a99dd2f5470401e767"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEyMYhLjsSleEMQn49CE9V+cpdibrMrs8IQS18qULQI08j/qIYMdXSZw07Dzr1itSfvDpHRF+tdFE1E0UU0/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:32:06.915781Z","bundle_sha256":"6076cbb19e6680b3c3d6d78af63e2dc1a4494dfdc1810dce1f8cc200e2fed266"}}