{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:7SR2BCAHYPQD7BKRMN2T77MIHB","short_pith_number":"pith:7SR2BCAH","canonical_record":{"source":{"id":"2206.12500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-06-24T22:02:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"824c7c311ad2a9bb842dafd9366d9db9beddd56421378df54ecd021bd7681c2b","abstract_canon_sha256":"4f127699d9ea989fca180b2f20eadabbb46288b0aaa5db0b294084fa374bd722"},"schema_version":"1.0"},"canonical_sha256":"fca3a08807c3e03f855163753ffd883847095d49021e703690446f5154e5a646","source":{"kind":"arxiv","id":"2206.12500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.12500","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"2206.12500v1","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.12500","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"7SR2BCAHYPQD","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"pith_short_16","alias_value":"7SR2BCAHYPQD7BKR","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"pith_short_8","alias_value":"7SR2BCAH","created_at":"2026-07-05T04:34:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:7SR2BCAHYPQD7BKRMN2T77MIHB","target":"record","payload":{"canonical_record":{"source":{"id":"2206.12500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-06-24T22:02:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"824c7c311ad2a9bb842dafd9366d9db9beddd56421378df54ecd021bd7681c2b","abstract_canon_sha256":"4f127699d9ea989fca180b2f20eadabbb46288b0aaa5db0b294084fa374bd722"},"schema_version":"1.0"},"canonical_sha256":"fca3a08807c3e03f855163753ffd883847095d49021e703690446f5154e5a646","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:55.858396Z","signature_b64":"xkluTamTMP2/gVT/y6o2diw7xasllb7DWFA8oP246TINFye+r1s6cqjBWGVNx/yk0y+G90hZ9VFSDgHLiiVoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fca3a08807c3e03f855163753ffd883847095d49021e703690446f5154e5a646","last_reissued_at":"2026-07-05T04:34:55.857918Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:55.857918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.12500","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-07-05T04:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiG3RE4i+XEoSwUGsiJCtpmag5cicWoInS0vEqD+VhR1Rv1Yc2TRcguFJtGaKCN7TO6H+tcRlCCUNMCC2aqqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:56:50.979032Z"},"content_sha256":"8a3fc12d979af961da3f5f0828396ec117931d1691e4cba159eac882d63c641d","schema_version":"1.0","event_id":"sha256:8a3fc12d979af961da3f5f0828396ec117931d1691e4cba159eac882d63c641d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:7SR2BCAHYPQD7BKRMN2T77MIHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the Minimum Bottleneck Moving Spanning Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Yiming Zhao","submitted_at":"2022-06-24T22:02:45Z","abstract_excerpt":"Given a set $P$ of $n$ points that are moving in the plane, we consider the problem of computing a spanning tree for these moving points that does not change its combinatorial structure during the point movement. The objective is to minimize the bottleneck weight of the spanning tree (i.e., the largest Euclidean length of all edges) during the whole movement. The problem was solved in $O(n^2)$ time previously [Akitaya, Biniaz, Bose, De Carufel, Maheshwari, Silveira, and Smid, WADS 2021]. In this paper, we present a new algorithm of $O(n^{4/3} \\log^3 n)$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.12500","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.12500/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnGJIzAzJLSil6IFJBNnrIFijft65smZX2oorsuH0eKpWkx6B5pSwbO3WneENG6lBsr/01Jo9/LWX/IxS6c8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:56:50.979375Z"},"content_sha256":"ce3ccb329c8d557ddb2fc15480483eb17477318c6060a31ba049fc218339b0aa","schema_version":"1.0","event_id":"sha256:ce3ccb329c8d557ddb2fc15480483eb17477318c6060a31ba049fc218339b0aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SR2BCAHYPQD7BKRMN2T77MIHB/bundle.json","state_url":"https://pith.science/pith/7SR2BCAHYPQD7BKRMN2T77MIHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SR2BCAHYPQD7BKRMN2T77MIHB/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-08-13T15:56:50Z","links":{"resolver":"https://pith.science/pith/7SR2BCAHYPQD7BKRMN2T77MIHB","bundle":"https://pith.science/pith/7SR2BCAHYPQD7BKRMN2T77MIHB/bundle.json","state":"https://pith.science/pith/7SR2BCAHYPQD7BKRMN2T77MIHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SR2BCAHYPQD7BKRMN2T77MIHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7SR2BCAHYPQD7BKRMN2T77MIHB","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":"4f127699d9ea989fca180b2f20eadabbb46288b0aaa5db0b294084fa374bd722","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-06-24T22:02:45Z","title_canon_sha256":"824c7c311ad2a9bb842dafd9366d9db9beddd56421378df54ecd021bd7681c2b"},"schema_version":"1.0","source":{"id":"2206.12500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.12500","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"2206.12500v1","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.12500","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"7SR2BCAHYPQD","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"pith_short_16","alias_value":"7SR2BCAHYPQD7BKR","created_at":"2026-07-05T04:34:55Z"},{"alias_kind":"pith_short_8","alias_value":"7SR2BCAH","created_at":"2026-07-05T04:34:55Z"}],"graph_snapshots":[{"event_id":"sha256:ce3ccb329c8d557ddb2fc15480483eb17477318c6060a31ba049fc218339b0aa","target":"graph","created_at":"2026-07-05T04:34:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.12500/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a set $P$ of $n$ points that are moving in the plane, we consider the problem of computing a spanning tree for these moving points that does not change its combinatorial structure during the point movement. The objective is to minimize the bottleneck weight of the spanning tree (i.e., the largest Euclidean length of all edges) during the whole movement. The problem was solved in $O(n^2)$ time previously [Akitaya, Biniaz, Bose, De Carufel, Maheshwari, Silveira, and Smid, WADS 2021]. In this paper, we present a new algorithm of $O(n^{4/3} \\log^3 n)$ time.","authors_text":"Haitao Wang, Yiming Zhao","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-06-24T22:02:45Z","title":"Computing the Minimum Bottleneck Moving Spanning Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.12500","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:8a3fc12d979af961da3f5f0828396ec117931d1691e4cba159eac882d63c641d","target":"record","created_at":"2026-07-05T04:34:55Z","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":"4f127699d9ea989fca180b2f20eadabbb46288b0aaa5db0b294084fa374bd722","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-06-24T22:02:45Z","title_canon_sha256":"824c7c311ad2a9bb842dafd9366d9db9beddd56421378df54ecd021bd7681c2b"},"schema_version":"1.0","source":{"id":"2206.12500","kind":"arxiv","version":1}},"canonical_sha256":"fca3a08807c3e03f855163753ffd883847095d49021e703690446f5154e5a646","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fca3a08807c3e03f855163753ffd883847095d49021e703690446f5154e5a646","first_computed_at":"2026-07-05T04:34:55.857918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:34:55.857918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xkluTamTMP2/gVT/y6o2diw7xasllb7DWFA8oP246TINFye+r1s6cqjBWGVNx/yk0y+G90hZ9VFSDgHLiiVoAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:34:55.858396Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.12500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a3fc12d979af961da3f5f0828396ec117931d1691e4cba159eac882d63c641d","sha256:ce3ccb329c8d557ddb2fc15480483eb17477318c6060a31ba049fc218339b0aa"],"state_sha256":"6875372ef25dea9e164f6209956b579e644fd983e3dd5317810a49e193d942c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8z/4gRA2EUUw6Z65rwvWYA5MzlUoF7LvOe5peZ837UPk3Qsacrua1MeP1VrAEjN5lTFrarXfUVTMEsA/7oOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T15:56:50.998873Z","bundle_sha256":"6de365252f18cbd16db6d5e9c73fdefb008bb949bb67993e22027d8d043c4389"}}