{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NAOYYYULRKP4GSXBWKYZ45SQNW","short_pith_number":"pith:NAOYYYUL","schema_version":"1.0","canonical_sha256":"681d8c628b8a9fc34ae1b2b19e76506d8a8190f19f0091acbff7acbc7e626ffb","source":{"kind":"arxiv","id":"1102.1795","version":2},"attestation_state":"computed","paper":{"title":"Local matching indicators for transport problems with concave costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Andrei Sobolevskii (LIFR-MI2P), Julie Delon (LTCI), Julien Salomon (CEREMADE)","submitted_at":"2011-02-09T07:37:55Z","abstract_excerpt":"In this paper, we introduce a class of indicators that enable to compute efficiently optimal transport plans associated to arbitrary distributions of N demands and M supplies in R in the case where the cost function is concave. The computational cost of these indicators is small and independent of N. A hierarchical use of them enables to obtain an efficient algorithm."},"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":"1102.1795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-02-09T07:37:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f7255e4a678d635852f5b6621d440e963bd6da06e6e330c8a58b0ee13247844e","abstract_canon_sha256":"46c41737e23f48a1991031f90bd9b63a68d1a3a4d46cf44d2f033882f4bba36d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:42.107060Z","signature_b64":"wB78DZLDQyJ2Z2cJrQuESVXIat6LeDIRXjYmHSwzZD3c/PZ6JS4sjV7lQE2dTZapFtJpjy3HhKpmhtziXz8+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"681d8c628b8a9fc34ae1b2b19e76506d8a8190f19f0091acbff7acbc7e626ffb","last_reissued_at":"2026-05-18T03:39:42.106372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:42.106372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local matching indicators for transport problems with concave costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Andrei Sobolevskii (LIFR-MI2P), Julie Delon (LTCI), Julien Salomon (CEREMADE)","submitted_at":"2011-02-09T07:37:55Z","abstract_excerpt":"In this paper, we introduce a class of indicators that enable to compute efficiently optimal transport plans associated to arbitrary distributions of N demands and M supplies in R in the case where the cost function is concave. The computational cost of these indicators is small and independent of N. A hierarchical use of them enables to obtain an efficient algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1795","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":"1102.1795","created_at":"2026-05-18T03:39:42.106486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1795v2","created_at":"2026-05-18T03:39:42.106486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1795","created_at":"2026-05-18T03:39:42.106486+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAOYYYULRKP4","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAOYYYULRKP4GSXB","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAOYYYUL","created_at":"2026-05-18T12:26:37.096874+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/NAOYYYULRKP4GSXBWKYZ45SQNW","json":"https://pith.science/pith/NAOYYYULRKP4GSXBWKYZ45SQNW.json","graph_json":"https://pith.science/api/pith-number/NAOYYYULRKP4GSXBWKYZ45SQNW/graph.json","events_json":"https://pith.science/api/pith-number/NAOYYYULRKP4GSXBWKYZ45SQNW/events.json","paper":"https://pith.science/paper/NAOYYYUL"},"agent_actions":{"view_html":"https://pith.science/pith/NAOYYYULRKP4GSXBWKYZ45SQNW","download_json":"https://pith.science/pith/NAOYYYULRKP4GSXBWKYZ45SQNW.json","view_paper":"https://pith.science/paper/NAOYYYUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1795&json=true","fetch_graph":"https://pith.science/api/pith-number/NAOYYYULRKP4GSXBWKYZ45SQNW/graph.json","fetch_events":"https://pith.science/api/pith-number/NAOYYYULRKP4GSXBWKYZ45SQNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAOYYYULRKP4GSXBWKYZ45SQNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAOYYYULRKP4GSXBWKYZ45SQNW/action/storage_attestation","attest_author":"https://pith.science/pith/NAOYYYULRKP4GSXBWKYZ45SQNW/action/author_attestation","sign_citation":"https://pith.science/pith/NAOYYYULRKP4GSXBWKYZ45SQNW/action/citation_signature","submit_replication":"https://pith.science/pith/NAOYYYULRKP4GSXBWKYZ45SQNW/action/replication_record"}},"created_at":"2026-05-18T03:39:42.106486+00:00","updated_at":"2026-05-18T03:39:42.106486+00:00"}