{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:356XJ3XSYQQX7Q4WTQCU3F5UYX","short_pith_number":"pith:356XJ3XS","schema_version":"1.0","canonical_sha256":"df7d74eef2c4217fc3969c054d97b4c5feef5301cce39aabe8200b816face981","source":{"kind":"arxiv","id":"1102.1558","version":2},"attestation_state":"computed","paper":{"title":"Minimum-weight perfect matching for non-intrinsic distances on the line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Sobolevski (LIFR-MI2P), Julie Delon (LTCI), Julien Salomon (CEREMADE)","submitted_at":"2011-02-08T10:32:27Z","abstract_excerpt":"Consider a real line equipped with a (not necessarily intrinsic) distance. We deal with the minimum-weight perfect matching problem for a complete graph whose points are located on the line and whose edges have weights equal to distances along the line. This problem is closely related to one-dimensional Monge-Kantorovich trasnport optimization. The main result of the present note is a \"bottom-up\" recursion relation for weights of partial minimum-weight matchings."},"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.1558","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-02-08T10:32:27Z","cross_cats_sorted":[],"title_canon_sha256":"5972245dd7266bfc8a655f179e38e72977602e273e206450ecc36a7bafdafade","abstract_canon_sha256":"8ae5c9f643a9411e561429cebc5e3b2f9b692d08b2c9cb82f6829d6649600561"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:42.117175Z","signature_b64":"unHfRjaQKS7d2DM61VoGeWjR1GpL+ziXDrj1pleYTEOHzo4I++xqZc+JeP0LcS/eI8mwIKz7IYDkTl2cem/hBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df7d74eef2c4217fc3969c054d97b4c5feef5301cce39aabe8200b816face981","last_reissued_at":"2026-05-18T03:39:42.116383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:42.116383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum-weight perfect matching for non-intrinsic distances on the line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Sobolevski (LIFR-MI2P), Julie Delon (LTCI), Julien Salomon (CEREMADE)","submitted_at":"2011-02-08T10:32:27Z","abstract_excerpt":"Consider a real line equipped with a (not necessarily intrinsic) distance. We deal with the minimum-weight perfect matching problem for a complete graph whose points are located on the line and whose edges have weights equal to distances along the line. This problem is closely related to one-dimensional Monge-Kantorovich trasnport optimization. The main result of the present note is a \"bottom-up\" recursion relation for weights of partial minimum-weight matchings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1558","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.1558","created_at":"2026-05-18T03:39:42.116514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1558v2","created_at":"2026-05-18T03:39:42.116514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1558","created_at":"2026-05-18T03:39:42.116514+00:00"},{"alias_kind":"pith_short_12","alias_value":"356XJ3XSYQQX","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"356XJ3XSYQQX7Q4W","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"356XJ3XS","created_at":"2026-05-18T12:26:18.847500+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/356XJ3XSYQQX7Q4WTQCU3F5UYX","json":"https://pith.science/pith/356XJ3XSYQQX7Q4WTQCU3F5UYX.json","graph_json":"https://pith.science/api/pith-number/356XJ3XSYQQX7Q4WTQCU3F5UYX/graph.json","events_json":"https://pith.science/api/pith-number/356XJ3XSYQQX7Q4WTQCU3F5UYX/events.json","paper":"https://pith.science/paper/356XJ3XS"},"agent_actions":{"view_html":"https://pith.science/pith/356XJ3XSYQQX7Q4WTQCU3F5UYX","download_json":"https://pith.science/pith/356XJ3XSYQQX7Q4WTQCU3F5UYX.json","view_paper":"https://pith.science/paper/356XJ3XS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1558&json=true","fetch_graph":"https://pith.science/api/pith-number/356XJ3XSYQQX7Q4WTQCU3F5UYX/graph.json","fetch_events":"https://pith.science/api/pith-number/356XJ3XSYQQX7Q4WTQCU3F5UYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/356XJ3XSYQQX7Q4WTQCU3F5UYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/356XJ3XSYQQX7Q4WTQCU3F5UYX/action/storage_attestation","attest_author":"https://pith.science/pith/356XJ3XSYQQX7Q4WTQCU3F5UYX/action/author_attestation","sign_citation":"https://pith.science/pith/356XJ3XSYQQX7Q4WTQCU3F5UYX/action/citation_signature","submit_replication":"https://pith.science/pith/356XJ3XSYQQX7Q4WTQCU3F5UYX/action/replication_record"}},"created_at":"2026-05-18T03:39:42.116514+00:00","updated_at":"2026-05-18T03:39:42.116514+00:00"}