{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N5C4YB7H4LAKQ3JS7MZXR4ZUAX","short_pith_number":"pith:N5C4YB7H","canonical_record":{"source":{"id":"1810.10169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-24T03:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"91654a01bc27a79573bd4564e7ef5d013c1592f3c222bbe5de3cb3a16ad2059a","abstract_canon_sha256":"38ae0f6bf1f6a5ca488e22519859f72fde3e34fa3312f058bc8951460253a4b2"},"schema_version":"1.0"},"canonical_sha256":"6f45cc07e7e2c0a86d32fb3378f33405c13020f2e1622afd0054fda652ae4de8","source":{"kind":"arxiv","id":"1810.10169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10169","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10169v1","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10169","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"N5C4YB7H4LAK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N5C4YB7H4LAKQ3JS","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N5C4YB7H","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N5C4YB7H4LAKQ3JS7MZXR4ZUAX","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-24T03:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"91654a01bc27a79573bd4564e7ef5d013c1592f3c222bbe5de3cb3a16ad2059a","abstract_canon_sha256":"38ae0f6bf1f6a5ca488e22519859f72fde3e34fa3312f058bc8951460253a4b2"},"schema_version":"1.0"},"canonical_sha256":"6f45cc07e7e2c0a86d32fb3378f33405c13020f2e1622afd0054fda652ae4de8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.025061Z","signature_b64":"zOi9hAhkjcuir6a8iIyqQcaBJQE6Q3QGzrnLky3YcMnClHqH8dIHwI1H5Wh7lgdP6+ep+YhFuQWWlxPyUJlGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f45cc07e7e2c0a86d32fb3378f33405c13020f2e1622afd0054fda652ae4de8","last_reissued_at":"2026-05-18T00:02:24.024409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.024409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10169","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-05-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwUsMceVwl7F2t1vir4G043qdd9K9UbLWwzEeKZM7NJ8vuZV3wxCKZX2bPhAd0fzzm3ebr0bXO2fw7guZErmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:56:04.563447Z"},"content_sha256":"98da38f616eafd7a87f46f7aa5c96ebd11fa3ed903535a37dd87631fecc7ac2b","schema_version":"1.0","event_id":"sha256:98da38f616eafd7a87f46f7aa5c96ebd11fa3ed903535a37dd87631fecc7ac2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N5C4YB7H4LAKQ3JS7MZXR4ZUAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Partial Correlations in Distributionally Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Divya Padmanabhan, Karthik Natarajan, Karthyek R. A. Murthy","submitted_at":"2018-10-24T03:39:46Z","abstract_excerpt":"In this paper, we identify partial correlation information structures that allow for simpler reformulations in evaluating the maximum expected value of mixed integer linear programs with random objective coefficients. To this end, assuming only the knowledge of the mean and the covariance matrix entries restricted to block-diagonal patterns, we develop a reduced semidefinite programming formulation, the complexity of solving which is related to characterizing a suitable projection of the convex hull of the set $\\{(\\bold{x}, \\bold{x}\\bold{x}'): \\bold{x} \\in \\mathcal{X}\\}$ where $\\mathcal{X}$ is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10169","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"},"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-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aniBk6vXMSqykl0BBr0ZujfpcJnYncvyGYU0ilY5BEwU4kic2bzOvFaWgPNekWC1UT+srxu5vjiO9NMGNwwnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:56:04.564197Z"},"content_sha256":"1d1c0e953e630257f17da76e1b9cde7f690788766b0234f6f87049af43266879","schema_version":"1.0","event_id":"sha256:1d1c0e953e630257f17da76e1b9cde7f690788766b0234f6f87049af43266879"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5C4YB7H4LAKQ3JS7MZXR4ZUAX/bundle.json","state_url":"https://pith.science/pith/N5C4YB7H4LAKQ3JS7MZXR4ZUAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5C4YB7H4LAKQ3JS7MZXR4ZUAX/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-09T04:56:04Z","links":{"resolver":"https://pith.science/pith/N5C4YB7H4LAKQ3JS7MZXR4ZUAX","bundle":"https://pith.science/pith/N5C4YB7H4LAKQ3JS7MZXR4ZUAX/bundle.json","state":"https://pith.science/pith/N5C4YB7H4LAKQ3JS7MZXR4ZUAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5C4YB7H4LAKQ3JS7MZXR4ZUAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N5C4YB7H4LAKQ3JS7MZXR4ZUAX","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":"38ae0f6bf1f6a5ca488e22519859f72fde3e34fa3312f058bc8951460253a4b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-24T03:39:46Z","title_canon_sha256":"91654a01bc27a79573bd4564e7ef5d013c1592f3c222bbe5de3cb3a16ad2059a"},"schema_version":"1.0","source":{"id":"1810.10169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10169","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10169v1","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10169","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"N5C4YB7H4LAK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N5C4YB7H4LAKQ3JS","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N5C4YB7H","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:1d1c0e953e630257f17da76e1b9cde7f690788766b0234f6f87049af43266879","target":"graph","created_at":"2026-05-18T00:02:24Z","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, we identify partial correlation information structures that allow for simpler reformulations in evaluating the maximum expected value of mixed integer linear programs with random objective coefficients. To this end, assuming only the knowledge of the mean and the covariance matrix entries restricted to block-diagonal patterns, we develop a reduced semidefinite programming formulation, the complexity of solving which is related to characterizing a suitable projection of the convex hull of the set $\\{(\\bold{x}, \\bold{x}\\bold{x}'): \\bold{x} \\in \\mathcal{X}\\}$ where $\\mathcal{X}$ is","authors_text":"Divya Padmanabhan, Karthik Natarajan, Karthyek R. A. Murthy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-24T03:39:46Z","title":"Exploiting Partial Correlations in Distributionally Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10169","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:98da38f616eafd7a87f46f7aa5c96ebd11fa3ed903535a37dd87631fecc7ac2b","target":"record","created_at":"2026-05-18T00:02:24Z","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":"38ae0f6bf1f6a5ca488e22519859f72fde3e34fa3312f058bc8951460253a4b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-24T03:39:46Z","title_canon_sha256":"91654a01bc27a79573bd4564e7ef5d013c1592f3c222bbe5de3cb3a16ad2059a"},"schema_version":"1.0","source":{"id":"1810.10169","kind":"arxiv","version":1}},"canonical_sha256":"6f45cc07e7e2c0a86d32fb3378f33405c13020f2e1622afd0054fda652ae4de8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f45cc07e7e2c0a86d32fb3378f33405c13020f2e1622afd0054fda652ae4de8","first_computed_at":"2026-05-18T00:02:24.024409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:24.024409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zOi9hAhkjcuir6a8iIyqQcaBJQE6Q3QGzrnLky3YcMnClHqH8dIHwI1H5Wh7lgdP6+ep+YhFuQWWlxPyUJlGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:24.025061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98da38f616eafd7a87f46f7aa5c96ebd11fa3ed903535a37dd87631fecc7ac2b","sha256:1d1c0e953e630257f17da76e1b9cde7f690788766b0234f6f87049af43266879"],"state_sha256":"205e3d6621996add8db21cd316ea6c0d4ec1fc980755fe235c9fc419022d8071"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYAY8/iRYwbs7khlQNabOIcHfJQpyR2xDRy2CwHUyBgfkk3wQwuVWhrS8bUXLAiAFT+BIK4TgADSGffz2CJsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:56:04.568119Z","bundle_sha256":"a2a4c8f42d29b15c837085bbf2741af567881c3381df140e8295ea04b37830f8"}}