{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:27C4GKNMKDFVRSJ2HEBKNYMBP7","short_pith_number":"pith:27C4GKNM","canonical_record":{"source":{"id":"2007.10461","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-20T20:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"7cf6cbd924279e352bac81b9880072d89fb8f33d52afadf85ad61f5331364c31","abstract_canon_sha256":"9c48302f82744f3faf66c2d1eee78b85eb7f0ee58feae9fed3ec25a83ad16576"},"schema_version":"1.0"},"canonical_sha256":"d7c5c329ac50cb58c93a3902a6e1817fda6e665b557665904d1d6d9b5f8a95bb","source":{"kind":"arxiv","id":"2007.10461","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.10461","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"2007.10461v5","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.10461","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"27C4GKNMKDFV","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"pith_short_16","alias_value":"27C4GKNMKDFVRSJ2","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"pith_short_8","alias_value":"27C4GKNM","created_at":"2026-07-05T07:17:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:27C4GKNMKDFVRSJ2HEBKNYMBP7","target":"record","payload":{"canonical_record":{"source":{"id":"2007.10461","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-20T20:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"7cf6cbd924279e352bac81b9880072d89fb8f33d52afadf85ad61f5331364c31","abstract_canon_sha256":"9c48302f82744f3faf66c2d1eee78b85eb7f0ee58feae9fed3ec25a83ad16576"},"schema_version":"1.0"},"canonical_sha256":"d7c5c329ac50cb58c93a3902a6e1817fda6e665b557665904d1d6d9b5f8a95bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:20.749356Z","signature_b64":"nl5znyAc4TSiUn9lRiFrfOnPUJJb4V8DWjvyMWAoBxzKDGKFDj1PuBzzSt3Ax0vCSqVRn6sYGKFJ7sLJGKQIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7c5c329ac50cb58c93a3902a6e1817fda6e665b557665904d1d6d9b5f8a95bb","last_reissued_at":"2026-07-05T07:17:20.748808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:20.748808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.10461","source_version":5,"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-07-05T07:17:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81xie339IvxWU5M1SDzAoWwebEFpZa88dpsiCdjwQYNN1m+bNDQbvkWJ/63SNNQQyYnPqQ5LGo6bqYS9bvpiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:49:42.405258Z"},"content_sha256":"d547ae7771818ab21e15278084aa9a23b4ce252f87519e41a6815dc11b279b4f","schema_version":"1.0","event_id":"sha256:d547ae7771818ab21e15278084aa9a23b4ce252f87519e41a6815dc11b279b4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:27C4GKNMKDFVRSJ2HEBKNYMBP7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Column-Randomized Linear Programs: Performance Guarantees and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Velibor V. Mi\\v{s}i\\'c, Yi-Chun Akchen","submitted_at":"2020-07-20T20:40:54Z","abstract_excerpt":"We propose a randomized method for solving linear programs with a large number of columns but a relatively small number of constraints. Since enumerating all the columns is usually unrealistic, such linear programs are commonly solved by column generation, which is often still computationally challenging due to the intractability of the subproblem in many applications. Instead of iteratively introducing one column at a time as in column generation, our proposed method involves sampling a collection of columns according to a user-specified randomization scheme and solving the linear program con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.10461","kind":"arxiv","version":5},"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/2007.10461/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"},"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-07-05T07:17:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KitCRPYrLxPWkUu0GXRNNh0esGs7ioUGf60hsYP5y1jJjhl3frYa6DDkQxe6uhmUex6bqZSEHoXiZpgd+uuvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:49:42.406210Z"},"content_sha256":"b2c952fb6b4d40daa0ed9bef4f4114685f413ac380ed0df4f639c9c9b3740130","schema_version":"1.0","event_id":"sha256:b2c952fb6b4d40daa0ed9bef4f4114685f413ac380ed0df4f639c9c9b3740130"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27C4GKNMKDFVRSJ2HEBKNYMBP7/bundle.json","state_url":"https://pith.science/pith/27C4GKNMKDFVRSJ2HEBKNYMBP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27C4GKNMKDFVRSJ2HEBKNYMBP7/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-08-03T16:49:42Z","links":{"resolver":"https://pith.science/pith/27C4GKNMKDFVRSJ2HEBKNYMBP7","bundle":"https://pith.science/pith/27C4GKNMKDFVRSJ2HEBKNYMBP7/bundle.json","state":"https://pith.science/pith/27C4GKNMKDFVRSJ2HEBKNYMBP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27C4GKNMKDFVRSJ2HEBKNYMBP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:27C4GKNMKDFVRSJ2HEBKNYMBP7","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":"9c48302f82744f3faf66c2d1eee78b85eb7f0ee58feae9fed3ec25a83ad16576","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-20T20:40:54Z","title_canon_sha256":"7cf6cbd924279e352bac81b9880072d89fb8f33d52afadf85ad61f5331364c31"},"schema_version":"1.0","source":{"id":"2007.10461","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.10461","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"2007.10461v5","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.10461","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"27C4GKNMKDFV","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"pith_short_16","alias_value":"27C4GKNMKDFVRSJ2","created_at":"2026-07-05T07:17:20Z"},{"alias_kind":"pith_short_8","alias_value":"27C4GKNM","created_at":"2026-07-05T07:17:20Z"}],"graph_snapshots":[{"event_id":"sha256:b2c952fb6b4d40daa0ed9bef4f4114685f413ac380ed0df4f639c9c9b3740130","target":"graph","created_at":"2026-07-05T07:17:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.10461/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a randomized method for solving linear programs with a large number of columns but a relatively small number of constraints. Since enumerating all the columns is usually unrealistic, such linear programs are commonly solved by column generation, which is often still computationally challenging due to the intractability of the subproblem in many applications. Instead of iteratively introducing one column at a time as in column generation, our proposed method involves sampling a collection of columns according to a user-specified randomization scheme and solving the linear program con","authors_text":"Velibor V. Mi\\v{s}i\\'c, Yi-Chun Akchen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-20T20:40:54Z","title":"Column-Randomized Linear Programs: Performance Guarantees and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.10461","kind":"arxiv","version":5},"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:d547ae7771818ab21e15278084aa9a23b4ce252f87519e41a6815dc11b279b4f","target":"record","created_at":"2026-07-05T07:17:20Z","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":"9c48302f82744f3faf66c2d1eee78b85eb7f0ee58feae9fed3ec25a83ad16576","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-20T20:40:54Z","title_canon_sha256":"7cf6cbd924279e352bac81b9880072d89fb8f33d52afadf85ad61f5331364c31"},"schema_version":"1.0","source":{"id":"2007.10461","kind":"arxiv","version":5}},"canonical_sha256":"d7c5c329ac50cb58c93a3902a6e1817fda6e665b557665904d1d6d9b5f8a95bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7c5c329ac50cb58c93a3902a6e1817fda6e665b557665904d1d6d9b5f8a95bb","first_computed_at":"2026-07-05T07:17:20.748808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:17:20.748808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nl5znyAc4TSiUn9lRiFrfOnPUJJb4V8DWjvyMWAoBxzKDGKFDj1PuBzzSt3Ax0vCSqVRn6sYGKFJ7sLJGKQIAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:17:20.749356Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.10461","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d547ae7771818ab21e15278084aa9a23b4ce252f87519e41a6815dc11b279b4f","sha256:b2c952fb6b4d40daa0ed9bef4f4114685f413ac380ed0df4f639c9c9b3740130"],"state_sha256":"46cc33a698f45aeaeb8d0d268397bfd47a91b67843f348129b5d0b4319cedc6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/srAqf/vNuKe9CT90IA7q+PEp4XWvyp7U9kkvCXraol8zJMY1l34usN7x1u9Nk8D9Md069KaHAACvQYWfWwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:49:42.419147Z","bundle_sha256":"698f97b4842038e5b146b9c776df9691b3a3c3643ec4733a342707499f744ebd"}}