{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3G6H44CSFHY27K23R5HCPP7UIC","short_pith_number":"pith:3G6H44CS","schema_version":"1.0","canonical_sha256":"d9bc7e705229f1afab5b8f4e27bff440b77a5aa2b72f3d2e80e0f2d412ce9852","source":{"kind":"arxiv","id":"1301.0552","version":1},"attestation_state":"computed","paper":{"title":"A constraint satisfaction approach to the robust spanning tree problem with interval data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ionut Aron, Pascal Van Hentenryck","submitted_at":"2012-12-12T15:55:09Z","abstract_excerpt":"Robust optimization is one of the fundamental approaches to deal with uncertainty in combinatorial optimization. This paper considers the robust spanning tree problem with interval data, which arises in a variety of telecommunication applications. It proposes a constraint satisfaction approach using a combinatorial lower bound, a pruning component that removes infeasible and suboptimal edges, as well as a search strategy exploring the most uncertain edges first.  The resulting algorithm is shown to produce very dramatic improvements over the mathematical programming approach of Yaman et al. an"},"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":"1301.0552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:09Z","cross_cats_sorted":[],"title_canon_sha256":"ab0f60ee5ef95d5b8823e13e9b4571b6fcc283735566d6578edafc293cb94a8c","abstract_canon_sha256":"1f4c4e633628f303c992aa95a7accf2d95ebc131e39063d84e9c41447cc8f138"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.633877Z","signature_b64":"KQHuA7/YYsj/QPQ4Qa5UWaq5y5vHEsgGg/UCg/sDjQmCqTBQoEID+Ewb+TMv/LL6/EFvx1CPgHiAsFFhazKEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9bc7e705229f1afab5b8f4e27bff440b77a5aa2b72f3d2e80e0f2d412ce9852","last_reissued_at":"2026-05-18T03:37:18.633042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.633042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A constraint satisfaction approach to the robust spanning tree problem with interval data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ionut Aron, Pascal Van Hentenryck","submitted_at":"2012-12-12T15:55:09Z","abstract_excerpt":"Robust optimization is one of the fundamental approaches to deal with uncertainty in combinatorial optimization. This paper considers the robust spanning tree problem with interval data, which arises in a variety of telecommunication applications. It proposes a constraint satisfaction approach using a combinatorial lower bound, a pruning component that removes infeasible and suboptimal edges, as well as a search strategy exploring the most uncertain edges first.  The resulting algorithm is shown to produce very dramatic improvements over the mathematical programming approach of Yaman et al. an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0552","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":""},"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":"1301.0552","created_at":"2026-05-18T03:37:18.633178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0552v1","created_at":"2026-05-18T03:37:18.633178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0552","created_at":"2026-05-18T03:37:18.633178+00:00"},{"alias_kind":"pith_short_12","alias_value":"3G6H44CSFHY2","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3G6H44CSFHY27K23","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3G6H44CS","created_at":"2026-05-18T12:26:50.516681+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/3G6H44CSFHY27K23R5HCPP7UIC","json":"https://pith.science/pith/3G6H44CSFHY27K23R5HCPP7UIC.json","graph_json":"https://pith.science/api/pith-number/3G6H44CSFHY27K23R5HCPP7UIC/graph.json","events_json":"https://pith.science/api/pith-number/3G6H44CSFHY27K23R5HCPP7UIC/events.json","paper":"https://pith.science/paper/3G6H44CS"},"agent_actions":{"view_html":"https://pith.science/pith/3G6H44CSFHY27K23R5HCPP7UIC","download_json":"https://pith.science/pith/3G6H44CSFHY27K23R5HCPP7UIC.json","view_paper":"https://pith.science/paper/3G6H44CS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0552&json=true","fetch_graph":"https://pith.science/api/pith-number/3G6H44CSFHY27K23R5HCPP7UIC/graph.json","fetch_events":"https://pith.science/api/pith-number/3G6H44CSFHY27K23R5HCPP7UIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3G6H44CSFHY27K23R5HCPP7UIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3G6H44CSFHY27K23R5HCPP7UIC/action/storage_attestation","attest_author":"https://pith.science/pith/3G6H44CSFHY27K23R5HCPP7UIC/action/author_attestation","sign_citation":"https://pith.science/pith/3G6H44CSFHY27K23R5HCPP7UIC/action/citation_signature","submit_replication":"https://pith.science/pith/3G6H44CSFHY27K23R5HCPP7UIC/action/replication_record"}},"created_at":"2026-05-18T03:37:18.633178+00:00","updated_at":"2026-05-18T03:37:18.633178+00:00"}