{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UZ7RFEVM7BPKPZUBFJ7I2FOYBC","short_pith_number":"pith:UZ7RFEVM","schema_version":"1.0","canonical_sha256":"a67f1292acf85ea7e6812a7e8d15d808991ef61375259de19f6e3aeac44bf722","source":{"kind":"arxiv","id":"1705.06379","version":2},"attestation_state":"computed","paper":{"title":"General auction method for real-valued optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"J.D. Walsh III, Luca Dieci","submitted_at":"2017-05-18T00:41:13Z","abstract_excerpt":"Optimal transportation theory is an area of mathematics with real-world applications in fields ranging from economics to optimal control to machine learning. We propose a new algorithm for solving discrete transport (network flow) problems, based on classical auction methods. Auction methods were originally developed as an alternative to the Hungarian method for the assignment problem, so the classic auction-based algorithms solve integer-valued optimal transport by converting such problems into assignment problems. The general transport auction method we propose works directly on real-valued "},"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":"1705.06379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-18T00:41:13Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"d3db7c6ee46ad97c27d66a62d4b75069d6f9b210cadd49361dd1f6f5f12ea0e4","abstract_canon_sha256":"354bceee58178aa26359d1fac828c885bb0ccaf4d0b8865419cca3f5a0f43ec2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:12.864615Z","signature_b64":"BWz0v5C2GxM6M4sQTN6dnamKpcZn9E0fyIxPTF418ppLlb+LwaH3iQUwkCIppDliHsWaXo/eDWmSH1pqx08NAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a67f1292acf85ea7e6812a7e8d15d808991ef61375259de19f6e3aeac44bf722","last_reissued_at":"2026-05-17T23:47:12.864269Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:12.864269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General auction method for real-valued optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"J.D. Walsh III, Luca Dieci","submitted_at":"2017-05-18T00:41:13Z","abstract_excerpt":"Optimal transportation theory is an area of mathematics with real-world applications in fields ranging from economics to optimal control to machine learning. We propose a new algorithm for solving discrete transport (network flow) problems, based on classical auction methods. Auction methods were originally developed as an alternative to the Hungarian method for the assignment problem, so the classic auction-based algorithms solve integer-valued optimal transport by converting such problems into assignment problems. The general transport auction method we propose works directly on real-valued "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06379","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":""},"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":"1705.06379","created_at":"2026-05-17T23:47:12.864326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06379v2","created_at":"2026-05-17T23:47:12.864326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06379","created_at":"2026-05-17T23:47:12.864326+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZ7RFEVM7BPK","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZ7RFEVM7BPKPZUB","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZ7RFEVM","created_at":"2026-05-18T12:31:49.984773+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/UZ7RFEVM7BPKPZUBFJ7I2FOYBC","json":"https://pith.science/pith/UZ7RFEVM7BPKPZUBFJ7I2FOYBC.json","graph_json":"https://pith.science/api/pith-number/UZ7RFEVM7BPKPZUBFJ7I2FOYBC/graph.json","events_json":"https://pith.science/api/pith-number/UZ7RFEVM7BPKPZUBFJ7I2FOYBC/events.json","paper":"https://pith.science/paper/UZ7RFEVM"},"agent_actions":{"view_html":"https://pith.science/pith/UZ7RFEVM7BPKPZUBFJ7I2FOYBC","download_json":"https://pith.science/pith/UZ7RFEVM7BPKPZUBFJ7I2FOYBC.json","view_paper":"https://pith.science/paper/UZ7RFEVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06379&json=true","fetch_graph":"https://pith.science/api/pith-number/UZ7RFEVM7BPKPZUBFJ7I2FOYBC/graph.json","fetch_events":"https://pith.science/api/pith-number/UZ7RFEVM7BPKPZUBFJ7I2FOYBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZ7RFEVM7BPKPZUBFJ7I2FOYBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZ7RFEVM7BPKPZUBFJ7I2FOYBC/action/storage_attestation","attest_author":"https://pith.science/pith/UZ7RFEVM7BPKPZUBFJ7I2FOYBC/action/author_attestation","sign_citation":"https://pith.science/pith/UZ7RFEVM7BPKPZUBFJ7I2FOYBC/action/citation_signature","submit_replication":"https://pith.science/pith/UZ7RFEVM7BPKPZUBFJ7I2FOYBC/action/replication_record"}},"created_at":"2026-05-17T23:47:12.864326+00:00","updated_at":"2026-05-17T23:47:12.864326+00:00"}