{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HJR2OQUW5CBCJWC6O7SHOFLXLB","short_pith_number":"pith:HJR2OQUW","schema_version":"1.0","canonical_sha256":"3a63a74296e88224d85e77e4771577587cb0875d5040f8d6f07c8c4d26475137","source":{"kind":"arxiv","id":"2302.12029","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.12029","created_at":"2026-07-05T05:44:59.180824+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.12029v1","created_at":"2026-07-05T05:44:59.180824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12029","created_at":"2026-07-05T05:44:59.180824+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJR2OQUW5CBC","created_at":"2026-07-05T05:44:59.180824+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJR2OQUW5CBCJWC6","created_at":"2026-07-05T05:44:59.180824+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJR2OQUW","created_at":"2026-07-05T05:44:59.180824+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB","json":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB.json","graph_json":"https://pith.science/api/pith-number/HJR2OQUW5CBCJWC6O7SHOFLXLB/graph.json","events_json":"https://pith.science/api/pith-number/HJR2OQUW5CBCJWC6O7SHOFLXLB/events.json","paper":"https://pith.science/paper/HJR2OQUW"},"agent_actions":{"view_html":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB","download_json":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB.json","view_paper":"https://pith.science/paper/HJR2OQUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.12029&json=true","fetch_graph":"https://pith.science/api/pith-number/HJR2OQUW5CBCJWC6O7SHOFLXLB/graph.json","fetch_events":"https://pith.science/api/pith-number/HJR2OQUW5CBCJWC6O7SHOFLXLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/action/storage_attestation","attest_author":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/action/author_attestation","sign_citation":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/action/citation_signature","submit_replication":"https://pith.science/pith/HJR2OQUW5CBCJWC6O7SHOFLXLB/action/replication_record"}},"created_at":"2026-07-05T05:44:59.180824+00:00","updated_at":"2026-07-05T05:44:59.180824+00:00"}