{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3G6H44CSFHY27K23R5HCPP7UIC","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":"1f4c4e633628f303c992aa95a7accf2d95ebc131e39063d84e9c41447cc8f138","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:09Z","title_canon_sha256":"ab0f60ee5ef95d5b8823e13e9b4571b6fcc283735566d6578edafc293cb94a8c"},"schema_version":"1.0","source":{"id":"1301.0552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0552","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0552v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0552","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"3G6H44CSFHY2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3G6H44CSFHY27K23","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3G6H44CS","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:c0de077eb2677827f1229f0714b3c2caba84bdd22ba91ca18c0a253c6dfda3b5","target":"graph","created_at":"2026-05-18T03:37:18Z","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"},"paper":{"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","authors_text":"Ionut Aron, Pascal Van Hentenryck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:09Z","title":"A constraint satisfaction approach to the robust spanning tree problem with interval data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0552","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:26905419e8aae17b7ad0f2a7e07255d8ac29b0fbd590046e10237b4682824639","target":"record","created_at":"2026-05-18T03:37:18Z","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":"1f4c4e633628f303c992aa95a7accf2d95ebc131e39063d84e9c41447cc8f138","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:09Z","title_canon_sha256":"ab0f60ee5ef95d5b8823e13e9b4571b6fcc283735566d6578edafc293cb94a8c"},"schema_version":"1.0","source":{"id":"1301.0552","kind":"arxiv","version":1}},"canonical_sha256":"d9bc7e705229f1afab5b8f4e27bff440b77a5aa2b72f3d2e80e0f2d412ce9852","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9bc7e705229f1afab5b8f4e27bff440b77a5aa2b72f3d2e80e0f2d412ce9852","first_computed_at":"2026-05-18T03:37:18.633042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:18.633042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KQHuA7/YYsj/QPQ4Qa5UWaq5y5vHEsgGg/UCg/sDjQmCqTBQoEID+Ewb+TMv/LL6/EFvx1CPgHiAsFFhazKEDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:18.633877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26905419e8aae17b7ad0f2a7e07255d8ac29b0fbd590046e10237b4682824639","sha256:c0de077eb2677827f1229f0714b3c2caba84bdd22ba91ca18c0a253c6dfda3b5"],"state_sha256":"dbd4e7f5ee21ca740a4841a45159cc42d1f1cde66f6c3141edb6f01d220943a5"}