{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ICO3DSF7SLSDRXCJSIPKRIRREE","short_pith_number":"pith:ICO3DSF7","schema_version":"1.0","canonical_sha256":"409db1c8bf92e438dc49921ea8a2312138336171179d8bfa0811fc2caa73635f","source":{"kind":"arxiv","id":"2402.17967","version":2},"attestation_state":"computed","paper":{"title":"Imitation-regularized Optimal Transport on Networks: Provable Robustness and Application to Logistics Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Hirotaka Kaji, Kenji Kashima, Koshi Oishi, Tomohiko Jimbo, Yota Hashizume","submitted_at":"2024-02-28T01:19:42Z","abstract_excerpt":"Transport systems on networks are crucial in various applications, but face a significant risk of being adversely affected by unforeseen circumstances such as disasters. The application of entropy-regularized optimal transport (OT) on graph structures has been investigated to enhance the robustness of transport on such networks. In this study, we propose an imitation-regularized OT (I-OT) that mathematically incorporates prior knowledge into the robustness of OT. This method is expected to enhance interpretability by integrating human insights into robustness and to accelerate practical applic"},"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":"2402.17967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-28T01:19:42Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"72b8d0eb10558f254bf681bfa61e505f329b7038b4327cd6f44cef9e22cf2690","abstract_canon_sha256":"d98bc390527e7eeb5ace7710f1f0eef6aaebf7ce21ad519b6384fd52ada0619a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:45.024345Z","signature_b64":"V/s26jcz+Ilw8YOqO4xJTwIlKzRNs3cM0D4Am8gEyHO6HtOOrigBjUc5ejW40uYIkO7qzySrmjWmyXMMbB45DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"409db1c8bf92e438dc49921ea8a2312138336171179d8bfa0811fc2caa73635f","last_reissued_at":"2026-07-05T10:58:45.023946Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:45.023946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Imitation-regularized Optimal Transport on Networks: Provable Robustness and Application to Logistics Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Hirotaka Kaji, Kenji Kashima, Koshi Oishi, Tomohiko Jimbo, Yota Hashizume","submitted_at":"2024-02-28T01:19:42Z","abstract_excerpt":"Transport systems on networks are crucial in various applications, but face a significant risk of being adversely affected by unforeseen circumstances such as disasters. The application of entropy-regularized optimal transport (OT) on graph structures has been investigated to enhance the robustness of transport on such networks. In this study, we propose an imitation-regularized OT (I-OT) that mathematically incorporates prior knowledge into the robustness of OT. This method is expected to enhance interpretability by integrating human insights into robustness and to accelerate practical applic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.17967","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.17967/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":"2402.17967","created_at":"2026-07-05T10:58:45.023999+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.17967v2","created_at":"2026-07-05T10:58:45.023999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.17967","created_at":"2026-07-05T10:58:45.023999+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICO3DSF7SLSD","created_at":"2026-07-05T10:58:45.023999+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICO3DSF7SLSDRXCJ","created_at":"2026-07-05T10:58:45.023999+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICO3DSF7","created_at":"2026-07-05T10:58:45.023999+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/ICO3DSF7SLSDRXCJSIPKRIRREE","json":"https://pith.science/pith/ICO3DSF7SLSDRXCJSIPKRIRREE.json","graph_json":"https://pith.science/api/pith-number/ICO3DSF7SLSDRXCJSIPKRIRREE/graph.json","events_json":"https://pith.science/api/pith-number/ICO3DSF7SLSDRXCJSIPKRIRREE/events.json","paper":"https://pith.science/paper/ICO3DSF7"},"agent_actions":{"view_html":"https://pith.science/pith/ICO3DSF7SLSDRXCJSIPKRIRREE","download_json":"https://pith.science/pith/ICO3DSF7SLSDRXCJSIPKRIRREE.json","view_paper":"https://pith.science/paper/ICO3DSF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.17967&json=true","fetch_graph":"https://pith.science/api/pith-number/ICO3DSF7SLSDRXCJSIPKRIRREE/graph.json","fetch_events":"https://pith.science/api/pith-number/ICO3DSF7SLSDRXCJSIPKRIRREE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICO3DSF7SLSDRXCJSIPKRIRREE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICO3DSF7SLSDRXCJSIPKRIRREE/action/storage_attestation","attest_author":"https://pith.science/pith/ICO3DSF7SLSDRXCJSIPKRIRREE/action/author_attestation","sign_citation":"https://pith.science/pith/ICO3DSF7SLSDRXCJSIPKRIRREE/action/citation_signature","submit_replication":"https://pith.science/pith/ICO3DSF7SLSDRXCJSIPKRIRREE/action/replication_record"}},"created_at":"2026-07-05T10:58:45.023999+00:00","updated_at":"2026-07-05T10:58:45.023999+00:00"}