{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HJR2OQUW5CBCJWC6O7SHOFLXLB","short_pith_number":"pith:HJR2OQUW","canonical_record":{"source":{"id":"2302.12029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-23T13:43:24Z","cross_cats_sorted":[],"title_canon_sha256":"0250468b8fa5da9e7f4ba64df82c2648a5fb3a30c70aa96a9c75b7b1d3552bf4","abstract_canon_sha256":"61e0d9f318fc7ee4e88452db73b9fe58eacb2e19877382d103214c3b6a0d0a1d"},"schema_version":"1.0"},"canonical_sha256":"3a63a74296e88224d85e77e4771577587cb0875d5040f8d6f07c8c4d26475137","source":{"kind":"arxiv","id":"2302.12029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.12029","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"2302.12029v1","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12029","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"HJR2OQUW5CBC","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"pith_short_16","alias_value":"HJR2OQUW5CBCJWC6","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"pith_short_8","alias_value":"HJR2OQUW","created_at":"2026-07-05T05:44:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HJR2OQUW5CBCJWC6O7SHOFLXLB","target":"record","payload":{"canonical_record":{"source":{"id":"2302.12029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-23T13:43:24Z","cross_cats_sorted":[],"title_canon_sha256":"0250468b8fa5da9e7f4ba64df82c2648a5fb3a30c70aa96a9c75b7b1d3552bf4","abstract_canon_sha256":"61e0d9f318fc7ee4e88452db73b9fe58eacb2e19877382d103214c3b6a0d0a1d"},"schema_version":"1.0"},"canonical_sha256":"3a63a74296e88224d85e77e4771577587cb0875d5040f8d6f07c8c4d26475137","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:59.181250Z","signature_b64":"YfGWH4pYvEek89qBzcNES0yXNwbmLl4Nc5Z/V4CI9ZwfC3NpOhdYCAVf+So4lBRoJo0YPwnvlUH7sXV5WNo6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a63a74296e88224d85e77e4771577587cb0875d5040f8d6f07c8c4d26475137","last_reissued_at":"2026-07-05T05:44:59.180765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:59.180765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.12029","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-05T05:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBIhp+RQ9/JkweII8LomoGqeaN1W4hM5dcT98wof7Tr9GqdWVq78qQT1BVK5/wKODR3h4fdpNfQ3xsBF4eYlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:02:46.193220Z"},"content_sha256":"ef75478154eb1083e35e1390b353da57f3e504c7ec7ee709f290ea72f0d7cb44","schema_version":"1.0","event_id":"sha256:ef75478154eb1083e35e1390b353da57f3e504c7ec7ee709f290ea72f0d7cb44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HJR2OQUW5CBCJWC6O7SHOFLXLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Minimum Spanning Trees with Weight Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joan Boyar, Kim S. Larsen, Lene M. Favrholdt, Magnus Berg","submitted_at":"2023-02-23T13:43:24Z","abstract_excerpt":"We consider the minimum spanning tree problem with predictions, using the weight-arrival model, i.e., the graph is given, together with predictions for the weights of all edges. Then the actual weights arrive one at a time and an irrevocable decision must be made regarding whether or not the edge should be included into the spanning tree. In order to assess the quality of our algorithms, we define an appropriate error measure and analyze the performance of the algorithms as a function of the error. We prove that, according to competitive analysis, the simplest algorithm, Follow-the-Predictions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12029","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/2302.12029/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-05T05:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+PoCLVI+WigLAfZhv7PD2KM9BgooETEua2J8ELuS0RDw/yYB4+ULtYkjTLk5CBnnaEcME7snj5amjGximEoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:02:46.193743Z"},"content_sha256":"4a90d8c6f3e0dc866be086519e6e7cea3b653db7e78fb8af1f34ae17b271cb96","schema_version":"1.0","event_id":"sha256:4a90d8c6f3e0dc866be086519e6e7cea3b653db7e78fb8af1f34ae17b271cb96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/bundle.json","state_url":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/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-23T22:02:46Z","links":{"resolver":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB","bundle":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/bundle.json","state":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HJR2OQUW5CBCJWC6O7SHOFLXLB","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":"61e0d9f318fc7ee4e88452db73b9fe58eacb2e19877382d103214c3b6a0d0a1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-23T13:43:24Z","title_canon_sha256":"0250468b8fa5da9e7f4ba64df82c2648a5fb3a30c70aa96a9c75b7b1d3552bf4"},"schema_version":"1.0","source":{"id":"2302.12029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.12029","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"2302.12029v1","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12029","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"HJR2OQUW5CBC","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"pith_short_16","alias_value":"HJR2OQUW5CBCJWC6","created_at":"2026-07-05T05:44:59Z"},{"alias_kind":"pith_short_8","alias_value":"HJR2OQUW","created_at":"2026-07-05T05:44:59Z"}],"graph_snapshots":[{"event_id":"sha256:4a90d8c6f3e0dc866be086519e6e7cea3b653db7e78fb8af1f34ae17b271cb96","target":"graph","created_at":"2026-07-05T05:44:59Z","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/2302.12029/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the minimum spanning tree problem with predictions, using the weight-arrival model, i.e., the graph is given, together with predictions for the weights of all edges. Then the actual weights arrive one at a time and an irrevocable decision must be made regarding whether or not the edge should be included into the spanning tree. In order to assess the quality of our algorithms, we define an appropriate error measure and analyze the performance of the algorithms as a function of the error. We prove that, according to competitive analysis, the simplest algorithm, Follow-the-Predictions","authors_text":"Joan Boyar, Kim S. Larsen, Lene M. Favrholdt, Magnus Berg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-23T13:43:24Z","title":"Online Minimum Spanning Trees with Weight Predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12029","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:ef75478154eb1083e35e1390b353da57f3e504c7ec7ee709f290ea72f0d7cb44","target":"record","created_at":"2026-07-05T05:44:59Z","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":"61e0d9f318fc7ee4e88452db73b9fe58eacb2e19877382d103214c3b6a0d0a1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-23T13:43:24Z","title_canon_sha256":"0250468b8fa5da9e7f4ba64df82c2648a5fb3a30c70aa96a9c75b7b1d3552bf4"},"schema_version":"1.0","source":{"id":"2302.12029","kind":"arxiv","version":1}},"canonical_sha256":"3a63a74296e88224d85e77e4771577587cb0875d5040f8d6f07c8c4d26475137","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a63a74296e88224d85e77e4771577587cb0875d5040f8d6f07c8c4d26475137","first_computed_at":"2026-07-05T05:44:59.180765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:44:59.180765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YfGWH4pYvEek89qBzcNES0yXNwbmLl4Nc5Z/V4CI9ZwfC3NpOhdYCAVf+So4lBRoJo0YPwnvlUH7sXV5WNo6BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:44:59.181250Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.12029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef75478154eb1083e35e1390b353da57f3e504c7ec7ee709f290ea72f0d7cb44","sha256:4a90d8c6f3e0dc866be086519e6e7cea3b653db7e78fb8af1f34ae17b271cb96"],"state_sha256":"60be93db2588dbd1f50a70b3f6151f4f7c9e1ca3175211d0ec02d3e3c917f5b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZM/uqmH8zRP91VJ//IB4aBoTSpLVfDJFanilylP2TZIIFD4oWmLMxXJCD/3+aAk1erfdLeys3ciZ2JURGp+gCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T22:02:46.198768Z","bundle_sha256":"b639225a182d8feef11ac142c732e39b37c7aed32f3488579ed84ce0dde3f7bf"}}