{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:R5WDAYLJUMJL7RLMY5YZ3YI7C4","short_pith_number":"pith:R5WDAYLJ","schema_version":"1.0","canonical_sha256":"8f6c306169a312bfc56cc7719de11f17107d56e0f3ae85850cc0faedace48ff2","source":{"kind":"arxiv","id":"2009.07812","version":2},"attestation_state":"computed","paper":{"title":"Ramified optimal transportation with payoff on the boundary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Qinglan Xia, Shaofeng Xu","submitted_at":"2020-09-16T17:09:57Z","abstract_excerpt":"This paper studies a variant of ramified/branched optimal transportation problems. Given the distributions of production capacities and market sizes, a firm looks for an allocation of productions over factories, a distribution of sales across markets, and a transport path that delivers the product to maximize its profit. Mathematically, given any two measures $\\mu$ and $\\nu$ on $X$, and a payoff function $h$, the planner wants to minimize $\\mathbf{M}_{\\alpha }(T)-\\int_{X}hd(\\partial T)$ among all transport paths $T$ from $\\tilde{\\mu}$ to $\\tilde{\\nu}$ with $\\tilde{\\mu}\\leq \\mu $ and $\\tilde{\\n"},"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":"2009.07812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-09-16T17:09:57Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"ae430fdd3e5496d7d9cc029d7288304dc84776c3f3253f295f58db451292203f","abstract_canon_sha256":"b8982e745edcc2683e927daadd1afba05a8b943a3563b982022ef08dfb6e0e7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:09:57.449103Z","signature_b64":"xDAyUnLzu3D8QlZSU+U//4SVIHEQDbmGkaDcDNDTb+jebAkpGycJ3yesTkx2FfpfjAwCfDpkGKvnaRMbv2JVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f6c306169a312bfc56cc7719de11f17107d56e0f3ae85850cc0faedace48ff2","last_reissued_at":"2026-07-05T03:09:57.448646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:09:57.448646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramified optimal transportation with payoff on the boundary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Qinglan Xia, Shaofeng Xu","submitted_at":"2020-09-16T17:09:57Z","abstract_excerpt":"This paper studies a variant of ramified/branched optimal transportation problems. Given the distributions of production capacities and market sizes, a firm looks for an allocation of productions over factories, a distribution of sales across markets, and a transport path that delivers the product to maximize its profit. Mathematically, given any two measures $\\mu$ and $\\nu$ on $X$, and a payoff function $h$, the planner wants to minimize $\\mathbf{M}_{\\alpha }(T)-\\int_{X}hd(\\partial T)$ among all transport paths $T$ from $\\tilde{\\mu}$ to $\\tilde{\\nu}$ with $\\tilde{\\mu}\\leq \\mu $ and $\\tilde{\\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.07812","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/2009.07812/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":"2009.07812","created_at":"2026-07-05T03:09:57.448701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.07812v2","created_at":"2026-07-05T03:09:57.448701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.07812","created_at":"2026-07-05T03:09:57.448701+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5WDAYLJUMJL","created_at":"2026-07-05T03:09:57.448701+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5WDAYLJUMJL7RLM","created_at":"2026-07-05T03:09:57.448701+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5WDAYLJ","created_at":"2026-07-05T03:09:57.448701+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/R5WDAYLJUMJL7RLMY5YZ3YI7C4","json":"https://pith.science/pith/R5WDAYLJUMJL7RLMY5YZ3YI7C4.json","graph_json":"https://pith.science/api/pith-number/R5WDAYLJUMJL7RLMY5YZ3YI7C4/graph.json","events_json":"https://pith.science/api/pith-number/R5WDAYLJUMJL7RLMY5YZ3YI7C4/events.json","paper":"https://pith.science/paper/R5WDAYLJ"},"agent_actions":{"view_html":"https://pith.science/pith/R5WDAYLJUMJL7RLMY5YZ3YI7C4","download_json":"https://pith.science/pith/R5WDAYLJUMJL7RLMY5YZ3YI7C4.json","view_paper":"https://pith.science/paper/R5WDAYLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.07812&json=true","fetch_graph":"https://pith.science/api/pith-number/R5WDAYLJUMJL7RLMY5YZ3YI7C4/graph.json","fetch_events":"https://pith.science/api/pith-number/R5WDAYLJUMJL7RLMY5YZ3YI7C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5WDAYLJUMJL7RLMY5YZ3YI7C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5WDAYLJUMJL7RLMY5YZ3YI7C4/action/storage_attestation","attest_author":"https://pith.science/pith/R5WDAYLJUMJL7RLMY5YZ3YI7C4/action/author_attestation","sign_citation":"https://pith.science/pith/R5WDAYLJUMJL7RLMY5YZ3YI7C4/action/citation_signature","submit_replication":"https://pith.science/pith/R5WDAYLJUMJL7RLMY5YZ3YI7C4/action/replication_record"}},"created_at":"2026-07-05T03:09:57.448701+00:00","updated_at":"2026-07-05T03:09:57.448701+00:00"}