{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XUTN66YS37EML7IQSOJUH6OFWL","short_pith_number":"pith:XUTN66YS","schema_version":"1.0","canonical_sha256":"bd26df7b12dfc8c5fd10939343f9c5b2c7c3ade68e07a6907d314f4c9200d713","source":{"kind":"arxiv","id":"2607.09423","version":1},"attestation_state":"computed","paper":{"title":"Convex Relaxations for the Optimization of Markov Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Hongyi Zhang, Tianyun Tang, YueHaw Khoo","submitted_at":"2026-07-10T13:51:03Z","abstract_excerpt":"In this paper, we study the problem of optimizing Markov processes that interpolate between two prescribed probability distributions while minimizing a given cost. The main computational challenge is the curse of dimensionality: in high-dimensional state spaces, representing the full distribution is intractable. To address this, we reformulate the problem in terms of sequential couplings and develop convex relaxations based on local marginals and cluster moments. These relaxations exploit locality and sparse interaction structure, provide computable lower bounds, and recover low-order statisti"},"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":"2607.09423","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-10T13:51:03Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"eba80ecdf6f2e19ac778163fe57f498f7704eb594cb8ee3f9bed72c633d94427","abstract_canon_sha256":"ba18a5ac3da2362b4007fa72f2ae30f2f81f69c3d05c285c2f6275be22ba569c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:19:13.145062Z","signature_b64":"x4w+jdsC6xc586+YMp4yNrDl3z/sjxleAtB/cWNiEo2/H+RX/Ybyc/TB+MIO63vsHNtf1CZuvG/nD2jnMZpmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd26df7b12dfc8c5fd10939343f9c5b2c7c3ade68e07a6907d314f4c9200d713","last_reissued_at":"2026-07-13T01:19:13.143687Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:19:13.143687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Relaxations for the Optimization of Markov Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Hongyi Zhang, Tianyun Tang, YueHaw Khoo","submitted_at":"2026-07-10T13:51:03Z","abstract_excerpt":"In this paper, we study the problem of optimizing Markov processes that interpolate between two prescribed probability distributions while minimizing a given cost. The main computational challenge is the curse of dimensionality: in high-dimensional state spaces, representing the full distribution is intractable. To address this, we reformulate the problem in terms of sequential couplings and develop convex relaxations based on local marginals and cluster moments. These relaxations exploit locality and sparse interaction structure, provide computable lower bounds, and recover low-order statisti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09423","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/2607.09423/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":"2607.09423","created_at":"2026-07-13T01:19:13.144407+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.09423v1","created_at":"2026-07-13T01:19:13.144407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09423","created_at":"2026-07-13T01:19:13.144407+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUTN66YS37EM","created_at":"2026-07-13T01:19:13.144407+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUTN66YS37EML7IQ","created_at":"2026-07-13T01:19:13.144407+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUTN66YS","created_at":"2026-07-13T01:19:13.144407+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/XUTN66YS37EML7IQSOJUH6OFWL","json":"https://pith.science/pith/XUTN66YS37EML7IQSOJUH6OFWL.json","graph_json":"https://pith.science/api/pith-number/XUTN66YS37EML7IQSOJUH6OFWL/graph.json","events_json":"https://pith.science/api/pith-number/XUTN66YS37EML7IQSOJUH6OFWL/events.json","paper":"https://pith.science/paper/XUTN66YS"},"agent_actions":{"view_html":"https://pith.science/pith/XUTN66YS37EML7IQSOJUH6OFWL","download_json":"https://pith.science/pith/XUTN66YS37EML7IQSOJUH6OFWL.json","view_paper":"https://pith.science/paper/XUTN66YS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.09423&json=true","fetch_graph":"https://pith.science/api/pith-number/XUTN66YS37EML7IQSOJUH6OFWL/graph.json","fetch_events":"https://pith.science/api/pith-number/XUTN66YS37EML7IQSOJUH6OFWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUTN66YS37EML7IQSOJUH6OFWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUTN66YS37EML7IQSOJUH6OFWL/action/storage_attestation","attest_author":"https://pith.science/pith/XUTN66YS37EML7IQSOJUH6OFWL/action/author_attestation","sign_citation":"https://pith.science/pith/XUTN66YS37EML7IQSOJUH6OFWL/action/citation_signature","submit_replication":"https://pith.science/pith/XUTN66YS37EML7IQSOJUH6OFWL/action/replication_record"}},"created_at":"2026-07-13T01:19:13.144407+00:00","updated_at":"2026-07-13T01:19:13.144407+00:00"}