{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QT7GKOP2EFOQAHDW5CCJY7ZHQC","short_pith_number":"pith:QT7GKOP2","schema_version":"1.0","canonical_sha256":"84fe6539fa215d001c76e8849c7f278080bfaad1d07867b1ddd7bc7d78286999","source":{"kind":"arxiv","id":"2605.30853","version":1},"attestation_state":"computed","paper":{"title":"Diffusion-Robust Optimization over Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Liviu Aolaritei, Michael I. Jordan, Paul Grigas, Ricky Huang","submitted_at":"2026-05-29T05:18:29Z","abstract_excerpt":"We introduce a diffusion-based uncertainty model for robust optimization on directed graphs, in which perturbations of edge weights propagate along adjacent edges and satisfy conservation constraints at nodes. This topology-aware structure is natural in networked systems where uncertainty is induced by flows and local interactions, including transportation, logistics, communication, and energy networks. We analyze how such diffusive uncertainty reshapes the computational landscape of robust graph optimization. For convex network problems, such as minimum-cost flow and maximum flow, the resulti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.30853","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-29T05:18:29Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"8edec7df8789f91db39738ce141a9b093d5f2e6b23f03864c39e55a21d9916eb","abstract_canon_sha256":"f4fedd8224f8a5d603ec28dda8e48ac9a9bc0876619085677b1ce7e2a1ff4109"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:21.113915Z","signature_b64":"xHBOQEuYfJQpcnGweyKO3dz+wDR4kJYSEqUPYy/mAvbTutgXMkgWDAibVbzTqS7zFHN32RsHylKxxBPkHn2hDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84fe6539fa215d001c76e8849c7f278080bfaad1d07867b1ddd7bc7d78286999","last_reissued_at":"2026-06-01T01:03:21.113277Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:21.113277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion-Robust Optimization over Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Liviu Aolaritei, Michael I. Jordan, Paul Grigas, Ricky Huang","submitted_at":"2026-05-29T05:18:29Z","abstract_excerpt":"We introduce a diffusion-based uncertainty model for robust optimization on directed graphs, in which perturbations of edge weights propagate along adjacent edges and satisfy conservation constraints at nodes. This topology-aware structure is natural in networked systems where uncertainty is induced by flows and local interactions, including transportation, logistics, communication, and energy networks. We analyze how such diffusive uncertainty reshapes the computational landscape of robust graph optimization. For convex network problems, such as minimum-cost flow and maximum flow, the resulti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30853","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/2605.30853/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.30853","created_at":"2026-06-01T01:03:21.113414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.30853v1","created_at":"2026-06-01T01:03:21.113414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30853","created_at":"2026-06-01T01:03:21.113414+00:00"},{"alias_kind":"pith_short_12","alias_value":"QT7GKOP2EFOQ","created_at":"2026-06-01T01:03:21.113414+00:00"},{"alias_kind":"pith_short_16","alias_value":"QT7GKOP2EFOQAHDW","created_at":"2026-06-01T01:03:21.113414+00:00"},{"alias_kind":"pith_short_8","alias_value":"QT7GKOP2","created_at":"2026-06-01T01:03:21.113414+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QT7GKOP2EFOQAHDW5CCJY7ZHQC","json":"https://pith.science/pith/QT7GKOP2EFOQAHDW5CCJY7ZHQC.json","graph_json":"https://pith.science/api/pith-number/QT7GKOP2EFOQAHDW5CCJY7ZHQC/graph.json","events_json":"https://pith.science/api/pith-number/QT7GKOP2EFOQAHDW5CCJY7ZHQC/events.json","paper":"https://pith.science/paper/QT7GKOP2"},"agent_actions":{"view_html":"https://pith.science/pith/QT7GKOP2EFOQAHDW5CCJY7ZHQC","download_json":"https://pith.science/pith/QT7GKOP2EFOQAHDW5CCJY7ZHQC.json","view_paper":"https://pith.science/paper/QT7GKOP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.30853&json=true","fetch_graph":"https://pith.science/api/pith-number/QT7GKOP2EFOQAHDW5CCJY7ZHQC/graph.json","fetch_events":"https://pith.science/api/pith-number/QT7GKOP2EFOQAHDW5CCJY7ZHQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QT7GKOP2EFOQAHDW5CCJY7ZHQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QT7GKOP2EFOQAHDW5CCJY7ZHQC/action/storage_attestation","attest_author":"https://pith.science/pith/QT7GKOP2EFOQAHDW5CCJY7ZHQC/action/author_attestation","sign_citation":"https://pith.science/pith/QT7GKOP2EFOQAHDW5CCJY7ZHQC/action/citation_signature","submit_replication":"https://pith.science/pith/QT7GKOP2EFOQAHDW5CCJY7ZHQC/action/replication_record"}},"created_at":"2026-06-01T01:03:21.113414+00:00","updated_at":"2026-06-01T01:03:21.113414+00:00"}