{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7BTZNQ6DPR2RZYHVB7FBJR6WYP","short_pith_number":"pith:7BTZNQ6D","schema_version":"1.0","canonical_sha256":"f86796c3c37c751ce0f50fca14c7d6c3e53d61084b64b2fb4a8a40a4217e95a1","source":{"kind":"arxiv","id":"1306.1926","version":3},"attestation_state":"computed","paper":{"title":"Incremental Network Design with Minimum Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Konrad Engel, Martin W.P. Savelsbergh, Thomas Kalinowski","submitted_at":"2013-06-08T14:49:22Z","abstract_excerpt":"Given an edge-weighted graph $G=(V,E)$ and a set $E_0\\subset E$, the incremental network design problem with minimum spanning trees asks for a sequence of edges $e'_1,\\ldots,e'_T\\in E\\setminus E_0$ minimizing $\\sum_{t=1}^Tw(X_t)$ where $w(X_t)$ is the weight of a minimum spanning tree $X_t$ for the subgraph $(V,E_0\\cup\\{e'_1,\\ldots,e'_t\\})$ and $T=\\lvert E\\setminus E_0\\rvert$. We prove that this problem can be solved by a greedy algorithm."},"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":"1306.1926","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-08T14:49:22Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"59326d3beab84f04a7d4e3f8d8fe60b504b61f785a5616c4c6d1ac908bef6404","abstract_canon_sha256":"52a58a47904cb7ad79399c349ffb90c4076be97f84230eba7b818fabb0971b34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:07.732232Z","signature_b64":"myLypgvv5IayJu0ltfBrz07/BN9RedqFvxyL/LugkgAoZG/RXynXb95V3vvHLgVjl87dvUhtsp08j9yJ9gKaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f86796c3c37c751ce0f50fca14c7d6c3e53d61084b64b2fb4a8a40a4217e95a1","last_reissued_at":"2026-05-18T00:51:07.731782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:07.731782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Network Design with Minimum Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Konrad Engel, Martin W.P. Savelsbergh, Thomas Kalinowski","submitted_at":"2013-06-08T14:49:22Z","abstract_excerpt":"Given an edge-weighted graph $G=(V,E)$ and a set $E_0\\subset E$, the incremental network design problem with minimum spanning trees asks for a sequence of edges $e'_1,\\ldots,e'_T\\in E\\setminus E_0$ minimizing $\\sum_{t=1}^Tw(X_t)$ where $w(X_t)$ is the weight of a minimum spanning tree $X_t$ for the subgraph $(V,E_0\\cup\\{e'_1,\\ldots,e'_t\\})$ and $T=\\lvert E\\setminus E_0\\rvert$. We prove that this problem can be solved by a greedy algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1926","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.1926","created_at":"2026-05-18T00:51:07.731855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1926v3","created_at":"2026-05-18T00:51:07.731855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1926","created_at":"2026-05-18T00:51:07.731855+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BTZNQ6DPR2R","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BTZNQ6DPR2RZYHV","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BTZNQ6D","created_at":"2026-05-18T12:27:36.564083+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/7BTZNQ6DPR2RZYHVB7FBJR6WYP","json":"https://pith.science/pith/7BTZNQ6DPR2RZYHVB7FBJR6WYP.json","graph_json":"https://pith.science/api/pith-number/7BTZNQ6DPR2RZYHVB7FBJR6WYP/graph.json","events_json":"https://pith.science/api/pith-number/7BTZNQ6DPR2RZYHVB7FBJR6WYP/events.json","paper":"https://pith.science/paper/7BTZNQ6D"},"agent_actions":{"view_html":"https://pith.science/pith/7BTZNQ6DPR2RZYHVB7FBJR6WYP","download_json":"https://pith.science/pith/7BTZNQ6DPR2RZYHVB7FBJR6WYP.json","view_paper":"https://pith.science/paper/7BTZNQ6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1926&json=true","fetch_graph":"https://pith.science/api/pith-number/7BTZNQ6DPR2RZYHVB7FBJR6WYP/graph.json","fetch_events":"https://pith.science/api/pith-number/7BTZNQ6DPR2RZYHVB7FBJR6WYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BTZNQ6DPR2RZYHVB7FBJR6WYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BTZNQ6DPR2RZYHVB7FBJR6WYP/action/storage_attestation","attest_author":"https://pith.science/pith/7BTZNQ6DPR2RZYHVB7FBJR6WYP/action/author_attestation","sign_citation":"https://pith.science/pith/7BTZNQ6DPR2RZYHVB7FBJR6WYP/action/citation_signature","submit_replication":"https://pith.science/pith/7BTZNQ6DPR2RZYHVB7FBJR6WYP/action/replication_record"}},"created_at":"2026-05-18T00:51:07.731855+00:00","updated_at":"2026-05-18T00:51:07.731855+00:00"}