{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GMDBD7HYGMC3IEYCXHZVVHCP2X","short_pith_number":"pith:GMDBD7HY","canonical_record":{"source":{"id":"2501.06578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-11T16:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"61188d53890750557441128367be62a6ffbf71acca44d6eb089346c434dca8f9","abstract_canon_sha256":"426d529deeeab49dc69fcea9a1f5c2a5dfe0578e4bc72637cf3a8a81f55022aa"},"schema_version":"1.0"},"canonical_sha256":"330611fcf83305b41302b9f35a9c4fd5d8503975c82a0c9bb27d767e011bc6e7","source":{"kind":"arxiv","id":"2501.06578","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.06578","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"2501.06578v2","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.06578","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"GMDBD7HYGMC3","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"pith_short_16","alias_value":"GMDBD7HYGMC3IEYC","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"pith_short_8","alias_value":"GMDBD7HY","created_at":"2026-07-05T10:37:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GMDBD7HYGMC3IEYCXHZVVHCP2X","target":"record","payload":{"canonical_record":{"source":{"id":"2501.06578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-11T16:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"61188d53890750557441128367be62a6ffbf71acca44d6eb089346c434dca8f9","abstract_canon_sha256":"426d529deeeab49dc69fcea9a1f5c2a5dfe0578e4bc72637cf3a8a81f55022aa"},"schema_version":"1.0"},"canonical_sha256":"330611fcf83305b41302b9f35a9c4fd5d8503975c82a0c9bb27d767e011bc6e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:42.520512Z","signature_b64":"xcTKXTqgOQrjjyTQEe3lw9UX0bWb1IxMYfibdE1Vsg1ccDCjTLUahrYk2t4nFnkmYPO5Tks2I9IJDtsIkJ48CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330611fcf83305b41302b9f35a9c4fd5d8503975c82a0c9bb27d767e011bc6e7","last_reissued_at":"2026-07-05T10:37:42.519840Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:42.519840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.06578","source_version":2,"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-05T10:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hH+Fn4c1BaRJaoz6nyiu4l7bYKJfJkk1+rF/IGADaikML/rLSHhQYLNmiMvshBWlIh+X2leUHidlKRN7v5lDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:47:41.953933Z"},"content_sha256":"51568eb7b092316fc4fdc1b95ab03ff16cc9acce3b27fe12602b84ec5c9d967f","schema_version":"1.0","event_id":"sha256:51568eb7b092316fc4fdc1b95ab03ff16cc9acce3b27fe12602b84ec5c9d967f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GMDBD7HYGMC3IEYCXHZVVHCP2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear Complexity Algorithm for Optimal Transport Problem with Log-type Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Wu, Shuai Yang, Zihao Wang, Ziyuan Lyu","submitted_at":"2025-01-11T16:22:41Z","abstract_excerpt":"In [Q. Liao et al., Commun. Math. Sci., 20(2022)], a linear-time Sinkhorn algorithm is developed based on dynamic programming, which significantly reduces the computational complexity involved in solving optimal transport problems. However, this algorithm is specifically designed for the Wasserstein-1 metric. We are curious whether the preceding dynamic programming framework can be extended to tackle optimal transport problems with different transport costs. Notably, two special kinds of optimal transport problems, the Sinkhorn ranking and the far-field reflector and refractor problems, are cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.06578","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/2501.06578/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-05T10:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"huvWDz5o+/9hTBGdfRml0iDwiRqtHCrG+diXNH3mSMErRl4+fbXbyJR8AVJ7uZHsXkFfhZqGf8+3pGUwXwGvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:47:41.955236Z"},"content_sha256":"4b2b8ea7cece9293b9fac9eed0f031081d4637ad30884f02756c3c0735c6980f","schema_version":"1.0","event_id":"sha256:4b2b8ea7cece9293b9fac9eed0f031081d4637ad30884f02756c3c0735c6980f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMDBD7HYGMC3IEYCXHZVVHCP2X/bundle.json","state_url":"https://pith.science/pith/GMDBD7HYGMC3IEYCXHZVVHCP2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMDBD7HYGMC3IEYCXHZVVHCP2X/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-06T03:47:41Z","links":{"resolver":"https://pith.science/pith/GMDBD7HYGMC3IEYCXHZVVHCP2X","bundle":"https://pith.science/pith/GMDBD7HYGMC3IEYCXHZVVHCP2X/bundle.json","state":"https://pith.science/pith/GMDBD7HYGMC3IEYCXHZVVHCP2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMDBD7HYGMC3IEYCXHZVVHCP2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GMDBD7HYGMC3IEYCXHZVVHCP2X","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":"426d529deeeab49dc69fcea9a1f5c2a5dfe0578e4bc72637cf3a8a81f55022aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-11T16:22:41Z","title_canon_sha256":"61188d53890750557441128367be62a6ffbf71acca44d6eb089346c434dca8f9"},"schema_version":"1.0","source":{"id":"2501.06578","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.06578","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"2501.06578v2","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.06578","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"GMDBD7HYGMC3","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"pith_short_16","alias_value":"GMDBD7HYGMC3IEYC","created_at":"2026-07-05T10:37:42Z"},{"alias_kind":"pith_short_8","alias_value":"GMDBD7HY","created_at":"2026-07-05T10:37:42Z"}],"graph_snapshots":[{"event_id":"sha256:4b2b8ea7cece9293b9fac9eed0f031081d4637ad30884f02756c3c0735c6980f","target":"graph","created_at":"2026-07-05T10:37:42Z","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/2501.06578/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In [Q. Liao et al., Commun. Math. Sci., 20(2022)], a linear-time Sinkhorn algorithm is developed based on dynamic programming, which significantly reduces the computational complexity involved in solving optimal transport problems. However, this algorithm is specifically designed for the Wasserstein-1 metric. We are curious whether the preceding dynamic programming framework can be extended to tackle optimal transport problems with different transport costs. Notably, two special kinds of optimal transport problems, the Sinkhorn ranking and the far-field reflector and refractor problems, are cl","authors_text":"Hao Wu, Shuai Yang, Zihao Wang, Ziyuan Lyu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-11T16:22:41Z","title":"A Linear Complexity Algorithm for Optimal Transport Problem with Log-type Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.06578","kind":"arxiv","version":2},"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:51568eb7b092316fc4fdc1b95ab03ff16cc9acce3b27fe12602b84ec5c9d967f","target":"record","created_at":"2026-07-05T10:37:42Z","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":"426d529deeeab49dc69fcea9a1f5c2a5dfe0578e4bc72637cf3a8a81f55022aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-11T16:22:41Z","title_canon_sha256":"61188d53890750557441128367be62a6ffbf71acca44d6eb089346c434dca8f9"},"schema_version":"1.0","source":{"id":"2501.06578","kind":"arxiv","version":2}},"canonical_sha256":"330611fcf83305b41302b9f35a9c4fd5d8503975c82a0c9bb27d767e011bc6e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"330611fcf83305b41302b9f35a9c4fd5d8503975c82a0c9bb27d767e011bc6e7","first_computed_at":"2026-07-05T10:37:42.519840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:37:42.519840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xcTKXTqgOQrjjyTQEe3lw9UX0bWb1IxMYfibdE1Vsg1ccDCjTLUahrYk2t4nFnkmYPO5Tks2I9IJDtsIkJ48CA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:37:42.520512Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.06578","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51568eb7b092316fc4fdc1b95ab03ff16cc9acce3b27fe12602b84ec5c9d967f","sha256:4b2b8ea7cece9293b9fac9eed0f031081d4637ad30884f02756c3c0735c6980f"],"state_sha256":"9a9af8eb69c7c8066d5e30678c9d5f683c925b156eef3f6640d9ceb20d900d01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M124wIYNnTyTDqlqQMcq+PfIek8nly7pEU3DP5gc+R1Ptt8YRQaTIcl9FHqs8wvJncbwn8fLCkJ9LADNaOnSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:47:41.971879Z","bundle_sha256":"ec475c7cc18ed08c40187391e453df532d729ea797e4a2c9eae2090391143e3b"}}