{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DXGPGH7WW7QKPQ26USPCMCMU2M","short_pith_number":"pith:DXGPGH7W","canonical_record":{"source":{"id":"1305.0172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-01T13:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"30fff18f81ff2e3123bef96db77d8b3b5e0b39dccd358bb3d5b24a6b94b002d8","abstract_canon_sha256":"3b1d736066f2c95cd1fda2ba03d7dc776dc6f04eb1ad7806f8c3abc6dca22f11"},"schema_version":"1.0"},"canonical_sha256":"1dccf31ff6b7e0a7c35ea49e260994d33b07860a5c18edb7b733283895dce18e","source":{"kind":"arxiv","id":"1305.0172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0172","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0172v1","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0172","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"DXGPGH7WW7QK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DXGPGH7WW7QKPQ26","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DXGPGH7W","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DXGPGH7WW7QKPQ26USPCMCMU2M","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-01T13:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"30fff18f81ff2e3123bef96db77d8b3b5e0b39dccd358bb3d5b24a6b94b002d8","abstract_canon_sha256":"3b1d736066f2c95cd1fda2ba03d7dc776dc6f04eb1ad7806f8c3abc6dca22f11"},"schema_version":"1.0"},"canonical_sha256":"1dccf31ff6b7e0a7c35ea49e260994d33b07860a5c18edb7b733283895dce18e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:41.766941Z","signature_b64":"bsTpCVliJllPtKU0npw8FRFDtJD9IYvPx6ARiHr3vVMl/X30uZYvAZ/4OzIyTd10ST5RGEtL/6leoh0JpvtWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dccf31ff6b7e0a7c35ea49e260994d33b07860a5c18edb7b733283895dce18e","last_reissued_at":"2026-05-18T03:26:41.766202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:41.766202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0172","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-18T03:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJHfSJ0K5SrSIH6O+6PZqZ8dQQq67DQOPgKXLfXTSqfnYdVtzCFM19G5Ii9kPHscTdHlP15lP2gKBt1UpqFvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:39:46.771098Z"},"content_sha256":"319f6a44321f927512f784a0e729bbe1568fbedaae29dbdd792f69c97e92d1fd","schema_version":"1.0","event_id":"sha256:319f6a44321f927512f784a0e729bbe1568fbedaae29dbdd792f69c97e92d1fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DXGPGH7WW7QKPQ26USPCMCMU2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Michiel Smid","submitted_at":"2013-05-01T13:55:25Z","abstract_excerpt":"Let $P$ and $S$ be two disjoint sets of $n$ and $m$ points in the plane, respectively. We consider the problem of computing a Steiner tree whose Steiner vertices belong to $S$, in which each point of $P$ is a leaf, and whose longest edge length is minimum. We present an algorithm that computes such a tree in $O((n+m)\\log m)$ time, improving the previously best result by a logarithmic factor. We also prove a matching lower bound in the algebraic computation tree model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0172","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-18T03:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYpIZg2nZwuRhLtzhZVFdIHfw5Aaq/7YogqUaTVCo+dGasuyUn8aRpKwb8Il+VtGQ+gPN4VCBP7m2tg87JbIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:39:46.771479Z"},"content_sha256":"e398e2c3e54836464a0ab278a3f765f26f91cd3b4606f38c43486ff14bc4a64d","schema_version":"1.0","event_id":"sha256:e398e2c3e54836464a0ab278a3f765f26f91cd3b4606f38c43486ff14bc4a64d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXGPGH7WW7QKPQ26USPCMCMU2M/bundle.json","state_url":"https://pith.science/pith/DXGPGH7WW7QKPQ26USPCMCMU2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXGPGH7WW7QKPQ26USPCMCMU2M/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-05T17:39:46Z","links":{"resolver":"https://pith.science/pith/DXGPGH7WW7QKPQ26USPCMCMU2M","bundle":"https://pith.science/pith/DXGPGH7WW7QKPQ26USPCMCMU2M/bundle.json","state":"https://pith.science/pith/DXGPGH7WW7QKPQ26USPCMCMU2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXGPGH7WW7QKPQ26USPCMCMU2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DXGPGH7WW7QKPQ26USPCMCMU2M","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":"3b1d736066f2c95cd1fda2ba03d7dc776dc6f04eb1ad7806f8c3abc6dca22f11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-01T13:55:25Z","title_canon_sha256":"30fff18f81ff2e3123bef96db77d8b3b5e0b39dccd358bb3d5b24a6b94b002d8"},"schema_version":"1.0","source":{"id":"1305.0172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0172","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0172v1","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0172","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"DXGPGH7WW7QK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DXGPGH7WW7QKPQ26","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DXGPGH7W","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:e398e2c3e54836464a0ab278a3f765f26f91cd3b4606f38c43486ff14bc4a64d","target":"graph","created_at":"2026-05-18T03:26:41Z","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":"Let $P$ and $S$ be two disjoint sets of $n$ and $m$ points in the plane, respectively. We consider the problem of computing a Steiner tree whose Steiner vertices belong to $S$, in which each point of $P$ is a leaf, and whose longest edge length is minimum. We present an algorithm that computes such a tree in $O((n+m)\\log m)$ time, improving the previously best result by a logarithmic factor. We also prove a matching lower bound in the algebraic computation tree model.","authors_text":"Ahmad Biniaz, Anil Maheshwari, Michiel Smid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-01T13:55:25Z","title":"An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0172","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:319f6a44321f927512f784a0e729bbe1568fbedaae29dbdd792f69c97e92d1fd","target":"record","created_at":"2026-05-18T03:26:41Z","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":"3b1d736066f2c95cd1fda2ba03d7dc776dc6f04eb1ad7806f8c3abc6dca22f11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-01T13:55:25Z","title_canon_sha256":"30fff18f81ff2e3123bef96db77d8b3b5e0b39dccd358bb3d5b24a6b94b002d8"},"schema_version":"1.0","source":{"id":"1305.0172","kind":"arxiv","version":1}},"canonical_sha256":"1dccf31ff6b7e0a7c35ea49e260994d33b07860a5c18edb7b733283895dce18e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dccf31ff6b7e0a7c35ea49e260994d33b07860a5c18edb7b733283895dce18e","first_computed_at":"2026-05-18T03:26:41.766202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:41.766202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsTpCVliJllPtKU0npw8FRFDtJD9IYvPx6ARiHr3vVMl/X30uZYvAZ/4OzIyTd10ST5RGEtL/6leoh0JpvtWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:41.766941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:319f6a44321f927512f784a0e729bbe1568fbedaae29dbdd792f69c97e92d1fd","sha256:e398e2c3e54836464a0ab278a3f765f26f91cd3b4606f38c43486ff14bc4a64d"],"state_sha256":"3973daff45e875fdf636f05c9a99cebd50baa9e850df35c1590c01c00f97e8c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juMC82/JsUJqaPvJ4CEwaUPbDpgy0RUWYX7bQeH4cvVHYaeXQ6Qx91YY3wsU+W/e2G8JvRmj2JGuCpB5ETL6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:39:46.773555Z","bundle_sha256":"5689766a6e0415820b94b0776fe0b00d651592d363e05081c199677d6bf83b69"}}