{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:F2JCVMU2MWPQUJXZBPS5Q5MU6N","short_pith_number":"pith:F2JCVMU2","schema_version":"1.0","canonical_sha256":"2e922ab29a659f0a26f90be5d87594f35216c52a0c0ddc6b9bb2b3cbf6695e7b","source":{"kind":"arxiv","id":"1707.05541","version":2},"attestation_state":"computed","paper":{"title":"Random Euclidean matching problems in one dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.dis-nn","authors_text":"Gabriele Sicuro, Matteo D'Achille, Sergio Caracciolo","submitted_at":"2017-07-18T09:45:51Z","abstract_excerpt":"We discuss the optimal matching solution for both the assignment problem and the matching problem in one dimension for a large class of convex cost functions. We consider the problem in a compact set with the topology both of the interval and of the circumference. Afterwards, we assume the points' positions to be random variables identically and independently distributed on the considered domain. We analytically obtain the average optimal cost in the asymptotic regime of very large number of points $N$ and some correlation functions for a power-law type cost function in the form $c(z)=z^p$, bo"},"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":"1707.05541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-07-18T09:45:51Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"efef7dabd4c463a5efd1e03716a805d886c6ea17bd6d6c92b043bdd4a8372715","abstract_canon_sha256":"d2e85322747bc3ce2c52b83f81af26cd9e9a8f1d97fb76f7a83e981713f3e7a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:07.811054Z","signature_b64":"oTObc6jzw6KUJriw+HqfLARKMcJas+3Rn9oICiKQ3/E9ig6Q5xbcVfLWF1MFye789OkGrEmAFpVba9L+na/IBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e922ab29a659f0a26f90be5d87594f35216c52a0c0ddc6b9bb2b3cbf6695e7b","last_reissued_at":"2026-05-18T00:33:07.810175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:07.810175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Euclidean matching problems in one dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.dis-nn","authors_text":"Gabriele Sicuro, Matteo D'Achille, Sergio Caracciolo","submitted_at":"2017-07-18T09:45:51Z","abstract_excerpt":"We discuss the optimal matching solution for both the assignment problem and the matching problem in one dimension for a large class of convex cost functions. We consider the problem in a compact set with the topology both of the interval and of the circumference. Afterwards, we assume the points' positions to be random variables identically and independently distributed on the considered domain. We analytically obtain the average optimal cost in the asymptotic regime of very large number of points $N$ and some correlation functions for a power-law type cost function in the form $c(z)=z^p$, bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05541","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":"1707.05541","created_at":"2026-05-18T00:33:07.810336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05541v2","created_at":"2026-05-18T00:33:07.810336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05541","created_at":"2026-05-18T00:33:07.810336+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2JCVMU2MWPQ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2JCVMU2MWPQUJXZ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2JCVMU2","created_at":"2026-05-18T12:31:12.930513+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/F2JCVMU2MWPQUJXZBPS5Q5MU6N","json":"https://pith.science/pith/F2JCVMU2MWPQUJXZBPS5Q5MU6N.json","graph_json":"https://pith.science/api/pith-number/F2JCVMU2MWPQUJXZBPS5Q5MU6N/graph.json","events_json":"https://pith.science/api/pith-number/F2JCVMU2MWPQUJXZBPS5Q5MU6N/events.json","paper":"https://pith.science/paper/F2JCVMU2"},"agent_actions":{"view_html":"https://pith.science/pith/F2JCVMU2MWPQUJXZBPS5Q5MU6N","download_json":"https://pith.science/pith/F2JCVMU2MWPQUJXZBPS5Q5MU6N.json","view_paper":"https://pith.science/paper/F2JCVMU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05541&json=true","fetch_graph":"https://pith.science/api/pith-number/F2JCVMU2MWPQUJXZBPS5Q5MU6N/graph.json","fetch_events":"https://pith.science/api/pith-number/F2JCVMU2MWPQUJXZBPS5Q5MU6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2JCVMU2MWPQUJXZBPS5Q5MU6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2JCVMU2MWPQUJXZBPS5Q5MU6N/action/storage_attestation","attest_author":"https://pith.science/pith/F2JCVMU2MWPQUJXZBPS5Q5MU6N/action/author_attestation","sign_citation":"https://pith.science/pith/F2JCVMU2MWPQUJXZBPS5Q5MU6N/action/citation_signature","submit_replication":"https://pith.science/pith/F2JCVMU2MWPQUJXZBPS5Q5MU6N/action/replication_record"}},"created_at":"2026-05-18T00:33:07.810336+00:00","updated_at":"2026-05-18T00:33:07.810336+00:00"}