{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZTH3QB5TKSMZOKIVD323KXB246","short_pith_number":"pith:ZTH3QB5T","canonical_record":{"source":{"id":"1504.08265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T15:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"10e236dcc25c1c2d860da741a6dcdcc6cc2b05abb8bfd179ccecaf8180e52c66","abstract_canon_sha256":"b843d83a0234ad886871754db30247dd1df54eb3578b5799975746e78d4b6666"},"schema_version":"1.0"},"canonical_sha256":"cccfb807b354999729151ef5b55c3ae78875540f83fff84a251873e568871ff3","source":{"kind":"arxiv","id":"1504.08265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08265","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08265v1","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08265","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZTH3QB5TKSMZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZTH3QB5TKSMZOKIV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZTH3QB5T","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZTH3QB5TKSMZOKIVD323KXB246","target":"record","payload":{"canonical_record":{"source":{"id":"1504.08265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T15:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"10e236dcc25c1c2d860da741a6dcdcc6cc2b05abb8bfd179ccecaf8180e52c66","abstract_canon_sha256":"b843d83a0234ad886871754db30247dd1df54eb3578b5799975746e78d4b6666"},"schema_version":"1.0"},"canonical_sha256":"cccfb807b354999729151ef5b55c3ae78875540f83fff84a251873e568871ff3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:22.838017Z","signature_b64":"TtyK7sw/K7H2Wz6Vub/O+3yPgF6HFVyS9qO5/YRKRlhB4VL0kBvfAAPt9d6T/N/8pILbkqEdcfsZUpIe9zxQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cccfb807b354999729151ef5b55c3ae78875540f83fff84a251873e568871ff3","last_reissued_at":"2026-05-18T02:17:22.837409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:22.837409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.08265","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:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YVMYgKT39ruBJ3aBjcpc+o1W7syEX48r/6iep41V5CyIJDT7JCE8qP3guamCtBvja7FFS0EzQ3atFqE7TW8iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:49:40.589847Z"},"content_sha256":"373e249b44ba79515a560e5220655b6674abbffc0ec66ef61b1de056af3d3eb4","schema_version":"1.0","event_id":"sha256:373e249b44ba79515a560e5220655b6674abbffc0ec66ef61b1de056af3d3eb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZTH3QB5TKSMZOKIVD323KXB246","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal competitiveness for the Rectilinear Steiner Arborescence problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erez Kantor, Shay Kutten","submitted_at":"2015-04-30T15:18:08Z","abstract_excerpt":"We present optimal online algorithms for two related known problems involving Steiner Arborescence, improving both the lower and the upper bounds. One of them is the well studied continuous problem of the {\\em Rectilinear Steiner Arborescence} ($RSA$). We improve the lower bound and the upper bound on the competitive ratio for $RSA$ from $O(\\log N)$ and $\\Omega(\\sqrt{\\log N})$ to $\\Theta(\\frac{\\log N}{\\log \\log N})$, where $N$ is the number of Steiner points. This separates the competitive ratios of $RSA$ and the Symetric-$RSA$, two problems for which the bounds of Berman and Coulston is STOC "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08265","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:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/kPxTWbQzuxZ4EMS7CRbJQG/Q7x68XMyZAKBcDHNrCNWLRTq1QjOGQNtDipIeRyPpfb0kw6b0yoeTLfFdepDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:49:40.590210Z"},"content_sha256":"6d1eb6daee4aec1d52fc9f12ee76750965da75f134c87cc8e4cd1dc30ddb1b14","schema_version":"1.0","event_id":"sha256:6d1eb6daee4aec1d52fc9f12ee76750965da75f134c87cc8e4cd1dc30ddb1b14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTH3QB5TKSMZOKIVD323KXB246/bundle.json","state_url":"https://pith.science/pith/ZTH3QB5TKSMZOKIVD323KXB246/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTH3QB5TKSMZOKIVD323KXB246/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-07-03T19:49:40Z","links":{"resolver":"https://pith.science/pith/ZTH3QB5TKSMZOKIVD323KXB246","bundle":"https://pith.science/pith/ZTH3QB5TKSMZOKIVD323KXB246/bundle.json","state":"https://pith.science/pith/ZTH3QB5TKSMZOKIVD323KXB246/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTH3QB5TKSMZOKIVD323KXB246/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZTH3QB5TKSMZOKIVD323KXB246","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":"b843d83a0234ad886871754db30247dd1df54eb3578b5799975746e78d4b6666","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T15:18:08Z","title_canon_sha256":"10e236dcc25c1c2d860da741a6dcdcc6cc2b05abb8bfd179ccecaf8180e52c66"},"schema_version":"1.0","source":{"id":"1504.08265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08265","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08265v1","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08265","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZTH3QB5TKSMZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZTH3QB5TKSMZOKIV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZTH3QB5T","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:6d1eb6daee4aec1d52fc9f12ee76750965da75f134c87cc8e4cd1dc30ddb1b14","target":"graph","created_at":"2026-05-18T02:17:22Z","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":"We present optimal online algorithms for two related known problems involving Steiner Arborescence, improving both the lower and the upper bounds. One of them is the well studied continuous problem of the {\\em Rectilinear Steiner Arborescence} ($RSA$). We improve the lower bound and the upper bound on the competitive ratio for $RSA$ from $O(\\log N)$ and $\\Omega(\\sqrt{\\log N})$ to $\\Theta(\\frac{\\log N}{\\log \\log N})$, where $N$ is the number of Steiner points. This separates the competitive ratios of $RSA$ and the Symetric-$RSA$, two problems for which the bounds of Berman and Coulston is STOC ","authors_text":"Erez Kantor, Shay Kutten","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T15:18:08Z","title":"Optimal competitiveness for the Rectilinear Steiner Arborescence problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08265","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:373e249b44ba79515a560e5220655b6674abbffc0ec66ef61b1de056af3d3eb4","target":"record","created_at":"2026-05-18T02:17:22Z","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":"b843d83a0234ad886871754db30247dd1df54eb3578b5799975746e78d4b6666","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T15:18:08Z","title_canon_sha256":"10e236dcc25c1c2d860da741a6dcdcc6cc2b05abb8bfd179ccecaf8180e52c66"},"schema_version":"1.0","source":{"id":"1504.08265","kind":"arxiv","version":1}},"canonical_sha256":"cccfb807b354999729151ef5b55c3ae78875540f83fff84a251873e568871ff3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cccfb807b354999729151ef5b55c3ae78875540f83fff84a251873e568871ff3","first_computed_at":"2026-05-18T02:17:22.837409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:22.837409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TtyK7sw/K7H2Wz6Vub/O+3yPgF6HFVyS9qO5/YRKRlhB4VL0kBvfAAPt9d6T/N/8pILbkqEdcfsZUpIe9zxQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:22.838017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:373e249b44ba79515a560e5220655b6674abbffc0ec66ef61b1de056af3d3eb4","sha256:6d1eb6daee4aec1d52fc9f12ee76750965da75f134c87cc8e4cd1dc30ddb1b14"],"state_sha256":"e5203acc28b610c60cc05481d8ad44d2810d70c960abba3a0d837f61945a0912"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQtRyGomdKQJ0aPVc+w2PKuhXcaLEGN8SpBEhr/cavmHWCS4b6ZsQBmI/31P0XnJK/3ZcrtGt/j1GL70uMCABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T19:49:40.592113Z","bundle_sha256":"a554053d9543cb1d88977ca134b63c131e824209b88751d3a26ceda11aa82e3b"}}