{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A2U7OMIZF7BOGGLHRGLYKCTB7M","short_pith_number":"pith:A2U7OMIZ","schema_version":"1.0","canonical_sha256":"06a9f731192fc2e319678997850a61fb16c152a50021afd15a9990be552da8bf","source":{"kind":"arxiv","id":"2406.19164","version":1},"attestation_state":"computed","paper":{"title":"Exact Minimum Weight Spanners via Column Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Fritz B\\\"okler, Henning Jasper, Markus Chimani, Mirko H. Wagner","submitted_at":"2024-06-27T13:32:23Z","abstract_excerpt":"Given a weighted graph $G$, a minimum weight $\\alpha$-spanner is a least-weight subgraph $H\\subseteq G$ that preserves minimum distances between all node pairs up to a factor of $\\alpha$. There are many results on heuristics and approximation algorithms, including a recent investigation of their practical performance [20]. Exact approaches, in contrast, have long been denounced as impractical: The first exact ILP (integer linear program) method [48] from 2004 is based on a model with exponentially many path variables, solved via column generation. A second approach [2], modeling via arc-based "},"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":"2406.19164","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-27T13:32:23Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e99bd675dfa933e42226b8577ebbbb3575541ceb3c9a819541b1daf8d63431ca","abstract_canon_sha256":"53cb456fca439156ef0cf4e53101161914f0a7edd75c7083608d57efc42a50d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:31.102350Z","signature_b64":"vvpJQ4ZNSnDrajVqjHc76GI6OFL/UKcCt4LltMPH05BH2Vj6r4S8j0IB10jXTFZFW1r5wc2fWckR+/sBqsrpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06a9f731192fc2e319678997850a61fb16c152a50021afd15a9990be552da8bf","last_reissued_at":"2026-07-05T08:37:31.101904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:31.101904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Minimum Weight Spanners via Column Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Fritz B\\\"okler, Henning Jasper, Markus Chimani, Mirko H. Wagner","submitted_at":"2024-06-27T13:32:23Z","abstract_excerpt":"Given a weighted graph $G$, a minimum weight $\\alpha$-spanner is a least-weight subgraph $H\\subseteq G$ that preserves minimum distances between all node pairs up to a factor of $\\alpha$. There are many results on heuristics and approximation algorithms, including a recent investigation of their practical performance [20]. Exact approaches, in contrast, have long been denounced as impractical: The first exact ILP (integer linear program) method [48] from 2004 is based on a model with exponentially many path variables, solved via column generation. A second approach [2], modeling via arc-based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19164","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/2406.19164/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":"2406.19164","created_at":"2026-07-05T08:37:31.101961+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.19164v1","created_at":"2026-07-05T08:37:31.101961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19164","created_at":"2026-07-05T08:37:31.101961+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2U7OMIZF7BO","created_at":"2026-07-05T08:37:31.101961+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2U7OMIZF7BOGGLH","created_at":"2026-07-05T08:37:31.101961+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2U7OMIZ","created_at":"2026-07-05T08:37:31.101961+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/A2U7OMIZF7BOGGLHRGLYKCTB7M","json":"https://pith.science/pith/A2U7OMIZF7BOGGLHRGLYKCTB7M.json","graph_json":"https://pith.science/api/pith-number/A2U7OMIZF7BOGGLHRGLYKCTB7M/graph.json","events_json":"https://pith.science/api/pith-number/A2U7OMIZF7BOGGLHRGLYKCTB7M/events.json","paper":"https://pith.science/paper/A2U7OMIZ"},"agent_actions":{"view_html":"https://pith.science/pith/A2U7OMIZF7BOGGLHRGLYKCTB7M","download_json":"https://pith.science/pith/A2U7OMIZF7BOGGLHRGLYKCTB7M.json","view_paper":"https://pith.science/paper/A2U7OMIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.19164&json=true","fetch_graph":"https://pith.science/api/pith-number/A2U7OMIZF7BOGGLHRGLYKCTB7M/graph.json","fetch_events":"https://pith.science/api/pith-number/A2U7OMIZF7BOGGLHRGLYKCTB7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2U7OMIZF7BOGGLHRGLYKCTB7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2U7OMIZF7BOGGLHRGLYKCTB7M/action/storage_attestation","attest_author":"https://pith.science/pith/A2U7OMIZF7BOGGLHRGLYKCTB7M/action/author_attestation","sign_citation":"https://pith.science/pith/A2U7OMIZF7BOGGLHRGLYKCTB7M/action/citation_signature","submit_replication":"https://pith.science/pith/A2U7OMIZF7BOGGLHRGLYKCTB7M/action/replication_record"}},"created_at":"2026-07-05T08:37:31.101961+00:00","updated_at":"2026-07-05T08:37:31.101961+00:00"}