{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KI67C3DFPXDR7P74L7OQZZOSKL","short_pith_number":"pith:KI67C3DF","canonical_record":{"source":{"id":"2508.20039","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-27T16:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"458ae74a44052aee4888f4601a4990a0cc46dfcca45b0d07a41cd84bdd6120b9","abstract_canon_sha256":"566f02ff92b4b1bcadbb5104cf0f08191904468617a5afd2bfceef23ba8e7210"},"schema_version":"1.0"},"canonical_sha256":"523df16c657dc71fbffc5fdd0ce5d252c1a540a5d2344e42440aba2485c18313","source":{"kind":"arxiv","id":"2508.20039","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20039","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20039v1","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20039","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"pith_short_12","alias_value":"KI67C3DFPXDR","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"pith_short_16","alias_value":"KI67C3DFPXDR7P74","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"pith_short_8","alias_value":"KI67C3DF","created_at":"2026-07-05T12:00:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KI67C3DFPXDR7P74L7OQZZOSKL","target":"record","payload":{"canonical_record":{"source":{"id":"2508.20039","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-27T16:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"458ae74a44052aee4888f4601a4990a0cc46dfcca45b0d07a41cd84bdd6120b9","abstract_canon_sha256":"566f02ff92b4b1bcadbb5104cf0f08191904468617a5afd2bfceef23ba8e7210"},"schema_version":"1.0"},"canonical_sha256":"523df16c657dc71fbffc5fdd0ce5d252c1a540a5d2344e42440aba2485c18313","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:22.754507Z","signature_b64":"xgHoIKAYHcbWr5sKmoARbY+xIXb0CS09HHzvW/WBSo9kGP2/IVO/rH3xk6+6NC6kri/qFNfDedclyLxGNBQfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523df16c657dc71fbffc5fdd0ce5d252c1a540a5d2344e42440aba2485c18313","last_reissued_at":"2026-07-05T12:00:22.753937Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:22.753937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.20039","source_version":1,"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-05T12:00:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"coj2RcFug6KCM14CbfSuRM+1rFv8rEVi1zK4nG5QKzce0jLIlCR6bu7DNGzM9aUJkffvwr8au3c4QnAoIy/oCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:07:20.675471Z"},"content_sha256":"413a7744c06b12f21fbb0f0bf53550ec9daff61f6e68852dbe6aff2b66179d15","schema_version":"1.0","event_id":"sha256:413a7744c06b12f21fbb0f0bf53550ec9daff61f6e68852dbe6aff2b66179d15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KI67C3DFPXDR7P74L7OQZZOSKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Paths: Geometry and Computation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Hao, Peter Zhang","submitted_at":"2025-08-27T16:46:53Z","abstract_excerpt":"Applying robust optimization often requires selecting an appropriate uncertainty set both in shape and size, a choice that directly affects the trade-off between average-case and worst-case performances. In practice, this calibration is usually done via trial-and-error: solving the robust optimization problem many times with different uncertainty set shapes and sizes, and examining their performance trade-off. This process is computationally expensive and ad hoc. In this work, we take a principled approach to study this issue for robust optimization problems with linear objective functions, co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20039","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/2508.20039/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-05T12:00:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16+aF2ffWdHXkADmkjS2W5vJApFwtsWiZSPt7V3nOIvWQLIga+iwdlMZZocBtwXCwCMdxG3VduuMuFLgqc60Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:07:20.676346Z"},"content_sha256":"58f0bbdb520d3c67f9b61a564dd93b31d4f4642c639ae561385de6aa2812e739","schema_version":"1.0","event_id":"sha256:58f0bbdb520d3c67f9b61a564dd93b31d4f4642c639ae561385de6aa2812e739"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KI67C3DFPXDR7P74L7OQZZOSKL/bundle.json","state_url":"https://pith.science/pith/KI67C3DFPXDR7P74L7OQZZOSKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KI67C3DFPXDR7P74L7OQZZOSKL/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-24T03:07:20Z","links":{"resolver":"https://pith.science/pith/KI67C3DFPXDR7P74L7OQZZOSKL","bundle":"https://pith.science/pith/KI67C3DFPXDR7P74L7OQZZOSKL/bundle.json","state":"https://pith.science/pith/KI67C3DFPXDR7P74L7OQZZOSKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KI67C3DFPXDR7P74L7OQZZOSKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KI67C3DFPXDR7P74L7OQZZOSKL","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":"566f02ff92b4b1bcadbb5104cf0f08191904468617a5afd2bfceef23ba8e7210","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-27T16:46:53Z","title_canon_sha256":"458ae74a44052aee4888f4601a4990a0cc46dfcca45b0d07a41cd84bdd6120b9"},"schema_version":"1.0","source":{"id":"2508.20039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20039","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20039v1","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20039","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"pith_short_12","alias_value":"KI67C3DFPXDR","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"pith_short_16","alias_value":"KI67C3DFPXDR7P74","created_at":"2026-07-05T12:00:22Z"},{"alias_kind":"pith_short_8","alias_value":"KI67C3DF","created_at":"2026-07-05T12:00:22Z"}],"graph_snapshots":[{"event_id":"sha256:58f0bbdb520d3c67f9b61a564dd93b31d4f4642c639ae561385de6aa2812e739","target":"graph","created_at":"2026-07-05T12:00:22Z","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/2508.20039/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Applying robust optimization often requires selecting an appropriate uncertainty set both in shape and size, a choice that directly affects the trade-off between average-case and worst-case performances. In practice, this calibration is usually done via trial-and-error: solving the robust optimization problem many times with different uncertainty set shapes and sizes, and examining their performance trade-off. This process is computationally expensive and ad hoc. In this work, we take a principled approach to study this issue for robust optimization problems with linear objective functions, co","authors_text":"Hao Hao, Peter Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-27T16:46:53Z","title":"Robust Paths: Geometry and Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20039","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:413a7744c06b12f21fbb0f0bf53550ec9daff61f6e68852dbe6aff2b66179d15","target":"record","created_at":"2026-07-05T12:00:22Z","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":"566f02ff92b4b1bcadbb5104cf0f08191904468617a5afd2bfceef23ba8e7210","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-27T16:46:53Z","title_canon_sha256":"458ae74a44052aee4888f4601a4990a0cc46dfcca45b0d07a41cd84bdd6120b9"},"schema_version":"1.0","source":{"id":"2508.20039","kind":"arxiv","version":1}},"canonical_sha256":"523df16c657dc71fbffc5fdd0ce5d252c1a540a5d2344e42440aba2485c18313","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"523df16c657dc71fbffc5fdd0ce5d252c1a540a5d2344e42440aba2485c18313","first_computed_at":"2026-07-05T12:00:22.753937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:00:22.753937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xgHoIKAYHcbWr5sKmoARbY+xIXb0CS09HHzvW/WBSo9kGP2/IVO/rH3xk6+6NC6kri/qFNfDedclyLxGNBQfBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:00:22.754507Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.20039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:413a7744c06b12f21fbb0f0bf53550ec9daff61f6e68852dbe6aff2b66179d15","sha256:58f0bbdb520d3c67f9b61a564dd93b31d4f4642c639ae561385de6aa2812e739"],"state_sha256":"0ac0284c220171ead442d8bea0664c6f47ffeba406f95092804834402cfcc174"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5zCX7DxL4XrAXIpefbdZ63PND24JN4WC4NvvPE82rXCq4P+6pwPEN+3YjpR/dSTN7U+OaCkkkL20fHBNsCFDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:07:20.681389Z","bundle_sha256":"8fce32a5a0098471ebbb0590d7528585f9156607f4fe6a97381f7f48fe662f14"}}