{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KRNONQKUDNQYTEBKVS4RZMM64D","short_pith_number":"pith:KRNONQKU","canonical_record":{"source":{"id":"2505.05424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-08T17:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"af6af7647239653e7c28ce6a007aa473de21287c9cf08ca85c84901641dc8d28","abstract_canon_sha256":"d72a5400180ef0d2cd83e3387c17371d600005e83d0a53540f5a2a35a133f47f"},"schema_version":"1.0"},"canonical_sha256":"545ae6c1541b6189902aacb91cb19ee0c0409b9d8c94d21cfacc6c2ceb44175d","source":{"kind":"arxiv","id":"2505.05424","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.05424","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2505.05424v3","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05424","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"KRNONQKUDNQY","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"KRNONQKUDNQYTEBK","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"KRNONQKU","created_at":"2026-05-21T01:05:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KRNONQKUDNQYTEBKVS4RZMM64D","target":"record","payload":{"canonical_record":{"source":{"id":"2505.05424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-08T17:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"af6af7647239653e7c28ce6a007aa473de21287c9cf08ca85c84901641dc8d28","abstract_canon_sha256":"d72a5400180ef0d2cd83e3387c17371d600005e83d0a53540f5a2a35a133f47f"},"schema_version":"1.0"},"canonical_sha256":"545ae6c1541b6189902aacb91cb19ee0c0409b9d8c94d21cfacc6c2ceb44175d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:05.883506Z","signature_b64":"w1Hmx+VsEf8/Vj0/mH+wdG81ra9VWzaS2BEP8zpxcjUD+jpJVMAUPOwKR0CbHwou/s7VDx5jmAR8zhJzJKn+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"545ae6c1541b6189902aacb91cb19ee0c0409b9d8c94d21cfacc6c2ceb44175d","last_reissued_at":"2026-05-21T01:05:05.882527Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:05.882527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.05424","source_version":3,"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-21T01:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8C+frSjHUmOPU7GdF0F0dfNMtfgxj/yo7AI8QaARQ2wi6nQQS0wRIZHvOGqOdp8MdUXntndTaM/NIc8t821kAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:58:18.203031Z"},"content_sha256":"42684686bdcefd2330751fd63c2a4bfd1f06cc11e64ead29757e126b0d6f1065","schema_version":"1.0","event_id":"sha256:42684686bdcefd2330751fd63c2a4bfd1f06cc11e64ead29757e126b0d6f1065"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KRNONQKUDNQYTEBKVS4RZMM64D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Liang Chen, Youyicun Lin, Yuxuan Zhou","submitted_at":"2025-05-08T17:13:41Z","abstract_excerpt":"This paper proposes an efficient numerical method based on second-order cone programming (SOCP) to solve dynamic optimal transport (DOT) problems with quadratic cost on staggered grid discretization. By properly reformulating discretized DOT problems into a linear SOCP, the proposed method eliminates the interpolation matrices and thus avoids solving a series of cubic equations and linear systems induced by interpolation. Then, by taking advantage of the SOCP reformulation, we can solve them efficiently by a computationally highly economical implementation of an inexact decomposition-based pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05424","kind":"arxiv","version":3},"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/2505.05424/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-05-21T01:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sg/WVUICVvk8gHWCtfEOUsRAarFlNt0Vs+MelWsyeBAsemB6zdcNk9moY9Zlju1nPorfXdEzyP4PPJeZp0/uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:58:18.203421Z"},"content_sha256":"17cc07791f6c143701c9ab2831d199c4eca76ff712bcf2908b440d702ee8e505","schema_version":"1.0","event_id":"sha256:17cc07791f6c143701c9ab2831d199c4eca76ff712bcf2908b440d702ee8e505"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRNONQKUDNQYTEBKVS4RZMM64D/bundle.json","state_url":"https://pith.science/pith/KRNONQKUDNQYTEBKVS4RZMM64D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRNONQKUDNQYTEBKVS4RZMM64D/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-05-28T13:58:18Z","links":{"resolver":"https://pith.science/pith/KRNONQKUDNQYTEBKVS4RZMM64D","bundle":"https://pith.science/pith/KRNONQKUDNQYTEBKVS4RZMM64D/bundle.json","state":"https://pith.science/pith/KRNONQKUDNQYTEBKVS4RZMM64D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRNONQKUDNQYTEBKVS4RZMM64D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KRNONQKUDNQYTEBKVS4RZMM64D","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":"d72a5400180ef0d2cd83e3387c17371d600005e83d0a53540f5a2a35a133f47f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-08T17:13:41Z","title_canon_sha256":"af6af7647239653e7c28ce6a007aa473de21287c9cf08ca85c84901641dc8d28"},"schema_version":"1.0","source":{"id":"2505.05424","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.05424","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2505.05424v3","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05424","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"KRNONQKUDNQY","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"KRNONQKUDNQYTEBK","created_at":"2026-05-21T01:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"KRNONQKU","created_at":"2026-05-21T01:05:05Z"}],"graph_snapshots":[{"event_id":"sha256:17cc07791f6c143701c9ab2831d199c4eca76ff712bcf2908b440d702ee8e505","target":"graph","created_at":"2026-05-21T01:05:05Z","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/2505.05424/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes an efficient numerical method based on second-order cone programming (SOCP) to solve dynamic optimal transport (DOT) problems with quadratic cost on staggered grid discretization. By properly reformulating discretized DOT problems into a linear SOCP, the proposed method eliminates the interpolation matrices and thus avoids solving a series of cubic equations and linear systems induced by interpolation. Then, by taking advantage of the SOCP reformulation, we can solve them efficiently by a computationally highly economical implementation of an inexact decomposition-based pro","authors_text":"Liang Chen, Youyicun Lin, Yuxuan Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-08T17:13:41Z","title":"An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05424","kind":"arxiv","version":3},"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:42684686bdcefd2330751fd63c2a4bfd1f06cc11e64ead29757e126b0d6f1065","target":"record","created_at":"2026-05-21T01:05:05Z","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":"d72a5400180ef0d2cd83e3387c17371d600005e83d0a53540f5a2a35a133f47f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-08T17:13:41Z","title_canon_sha256":"af6af7647239653e7c28ce6a007aa473de21287c9cf08ca85c84901641dc8d28"},"schema_version":"1.0","source":{"id":"2505.05424","kind":"arxiv","version":3}},"canonical_sha256":"545ae6c1541b6189902aacb91cb19ee0c0409b9d8c94d21cfacc6c2ceb44175d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"545ae6c1541b6189902aacb91cb19ee0c0409b9d8c94d21cfacc6c2ceb44175d","first_computed_at":"2026-05-21T01:05:05.882527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:05.882527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w1Hmx+VsEf8/Vj0/mH+wdG81ra9VWzaS2BEP8zpxcjUD+jpJVMAUPOwKR0CbHwou/s7VDx5jmAR8zhJzJKn+Aw==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:05.883506Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.05424","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42684686bdcefd2330751fd63c2a4bfd1f06cc11e64ead29757e126b0d6f1065","sha256:17cc07791f6c143701c9ab2831d199c4eca76ff712bcf2908b440d702ee8e505"],"state_sha256":"cb2804c1733da6f7c900253f150d112ee4b42da15f2322e7ff5eda8079be04e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1vx5jgy6UM3dLjHCZewHgMzhORJt7LKRIKjtJbdN3dvdtIABWos13u/K1g7Cn2ISArAWTbEF3/b4c2W1kv+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:58:18.205446Z","bundle_sha256":"985e5621742c1b5c16dcae4a0fc00218b165657c2a4242b860c761ddef9fc13e"}}