{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OL5YVV5GSN4W7QJGNZF3QDRCFF","short_pith_number":"pith:OL5YVV5G","canonical_record":{"source":{"id":"1602.07422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:29:06Z","cross_cats_sorted":[],"title_canon_sha256":"27ec9749d4dd9f101c9af69997fa00e196a8ef6a7a9575f6eb505c9650ee8736","abstract_canon_sha256":"57f9b7c9d7a356d7391cca06e727419b49669abac6587ed09e59c585557f3e24"},"schema_version":"1.0"},"canonical_sha256":"72fb8ad7a693796fc1266e4bb80e222943dbb2a8a0a9235deef1f4aae4a3ab94","source":{"kind":"arxiv","id":"1602.07422","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07422","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07422v2","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07422","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"OL5YVV5GSN4W","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OL5YVV5GSN4W7QJG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OL5YVV5G","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OL5YVV5GSN4W7QJGNZF3QDRCFF","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:29:06Z","cross_cats_sorted":[],"title_canon_sha256":"27ec9749d4dd9f101c9af69997fa00e196a8ef6a7a9575f6eb505c9650ee8736","abstract_canon_sha256":"57f9b7c9d7a356d7391cca06e727419b49669abac6587ed09e59c585557f3e24"},"schema_version":"1.0"},"canonical_sha256":"72fb8ad7a693796fc1266e4bb80e222943dbb2a8a0a9235deef1f4aae4a3ab94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:33.709131Z","signature_b64":"JYP/JAULEflSBJRI0pQ3PuZZhK2kG3pPhXEcMRpUpfgWGnMgkNL3+s0Lr9anoX5Lyu5KqxHjJ8OQI8Uh0qXDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72fb8ad7a693796fc1266e4bb80e222943dbb2a8a0a9235deef1f4aae4a3ab94","last_reissued_at":"2026-05-18T01:19:33.708720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:33.708720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07422","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9Sua7fJaxeEE+w+OFo+9JDtr58GoeXoQ1Et4Br8KhYPn03Lro7OusEMrWxBniyRkPjXISK9+44VR1/XpDuvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:21:39.380605Z"},"content_sha256":"6f42ef057e27ba8ec5cf0e9a6d0fd6a661d4deb828a2cbfb28d4e627c9ab0d84","schema_version":"1.0","event_id":"sha256:6f42ef057e27ba8ec5cf0e9a6d0fd6a661d4deb828a2cbfb28d4e627c9ab0d84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OL5YVV5GSN4W7QJGNZF3QDRCFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The robust recoverable spanning tree problem with interval costs is polynomially solvable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Mikita Hradovich, Pawel Zielinski","submitted_at":"2016-02-24T07:29:06Z","abstract_excerpt":"In this paper the robust recoverable spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. It is shown that the problem is polynomially solvable, by using an iterative relaxation method. A generalization of this idea to the robust recoverable matroid basis problem is also presented. Polynomial algorithms for both robust recoverable problems are proposed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07422","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRtV4J/oKrMMquJi8H+Svbhc/v6QFWOF/Neet7OAsuw9P9cwT2fywwrDO6XqByMseGCfJlPSwLjA5t+6bNiSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:21:39.380941Z"},"content_sha256":"ccf3c36971463859f41a7eed5538c217c258b56a1720024fb7c8b3e8e661efe9","schema_version":"1.0","event_id":"sha256:ccf3c36971463859f41a7eed5538c217c258b56a1720024fb7c8b3e8e661efe9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OL5YVV5GSN4W7QJGNZF3QDRCFF/bundle.json","state_url":"https://pith.science/pith/OL5YVV5GSN4W7QJGNZF3QDRCFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OL5YVV5GSN4W7QJGNZF3QDRCFF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T13:21:39Z","links":{"resolver":"https://pith.science/pith/OL5YVV5GSN4W7QJGNZF3QDRCFF","bundle":"https://pith.science/pith/OL5YVV5GSN4W7QJGNZF3QDRCFF/bundle.json","state":"https://pith.science/pith/OL5YVV5GSN4W7QJGNZF3QDRCFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OL5YVV5GSN4W7QJGNZF3QDRCFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OL5YVV5GSN4W7QJGNZF3QDRCFF","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":"57f9b7c9d7a356d7391cca06e727419b49669abac6587ed09e59c585557f3e24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:29:06Z","title_canon_sha256":"27ec9749d4dd9f101c9af69997fa00e196a8ef6a7a9575f6eb505c9650ee8736"},"schema_version":"1.0","source":{"id":"1602.07422","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07422","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07422v2","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07422","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"OL5YVV5GSN4W","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OL5YVV5GSN4W7QJG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OL5YVV5G","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:ccf3c36971463859f41a7eed5538c217c258b56a1720024fb7c8b3e8e661efe9","target":"graph","created_at":"2026-05-18T01:19:33Z","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":"In this paper the robust recoverable spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. It is shown that the problem is polynomially solvable, by using an iterative relaxation method. A generalization of this idea to the robust recoverable matroid basis problem is also presented. Polynomial algorithms for both robust recoverable problems are proposed.","authors_text":"Adam Kasperski, Mikita Hradovich, Pawel Zielinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:29:06Z","title":"The robust recoverable spanning tree problem with interval costs is polynomially solvable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07422","kind":"arxiv","version":2},"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:6f42ef057e27ba8ec5cf0e9a6d0fd6a661d4deb828a2cbfb28d4e627c9ab0d84","target":"record","created_at":"2026-05-18T01:19:33Z","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":"57f9b7c9d7a356d7391cca06e727419b49669abac6587ed09e59c585557f3e24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-24T07:29:06Z","title_canon_sha256":"27ec9749d4dd9f101c9af69997fa00e196a8ef6a7a9575f6eb505c9650ee8736"},"schema_version":"1.0","source":{"id":"1602.07422","kind":"arxiv","version":2}},"canonical_sha256":"72fb8ad7a693796fc1266e4bb80e222943dbb2a8a0a9235deef1f4aae4a3ab94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72fb8ad7a693796fc1266e4bb80e222943dbb2a8a0a9235deef1f4aae4a3ab94","first_computed_at":"2026-05-18T01:19:33.708720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:33.708720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JYP/JAULEflSBJRI0pQ3PuZZhK2kG3pPhXEcMRpUpfgWGnMgkNL3+s0Lr9anoX5Lyu5KqxHjJ8OQI8Uh0qXDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:33.709131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07422","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f42ef057e27ba8ec5cf0e9a6d0fd6a661d4deb828a2cbfb28d4e627c9ab0d84","sha256:ccf3c36971463859f41a7eed5538c217c258b56a1720024fb7c8b3e8e661efe9"],"state_sha256":"4056163414489ef9c006de7e975f764ce13bd3a9fb161d87ab665b6b75507288"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMK7OQG3wXSTeeep9GgDUZVuubrzMpIKJ2dcAriS1qnuCLkvbVyonG+/5O6PGVCAdP298Sg/K0a/sBobtRlJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:21:39.382789Z","bundle_sha256":"b10e705f643288d26a779a1110767df1290a49a66e2e07e9c6c05ecfde900616"}}