{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QO47UXJ3JCFHY5G2J24ZBHXGN4","short_pith_number":"pith:QO47UXJ3","schema_version":"1.0","canonical_sha256":"83b9fa5d3b488a7c74da4eb9909ee66f22f7150eb7704ec9784ed876892dcd4a","source":{"kind":"arxiv","id":"2506.16873","version":1},"attestation_state":"computed","paper":{"title":"Optimal matchings of randomly perturbed lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dor Elboim, Oren Yakir, Yinon Spinka","submitted_at":"2025-06-20T09:45:12Z","abstract_excerpt":"Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant perfect matching between this point process and the lattice, such that the matching distance has the same tail behavior as the hole probability of the point process, which is a natural lower bound."},"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":"2506.16873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-06-20T09:45:12Z","cross_cats_sorted":[],"title_canon_sha256":"b22e765048aaf6d3fe958d867393bcef70c52846a91f1dc735aad63c8aa08cea","abstract_canon_sha256":"c34fdd8a6b82fc111a6779f93467e81cc3f67c44308e8a659013c4b9d8467ca9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:44.300698Z","signature_b64":"YAi6xNJMCCd1+ZMrYmN7W+mdNQmYgHaicByqHvn61pqZ7bOJkJzg2Dq/w4qWbETwUt+BolQtOXC1Inig86S8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b9fa5d3b488a7c74da4eb9909ee66f22f7150eb7704ec9784ed876892dcd4a","last_reissued_at":"2026-07-05T11:24:44.300203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:44.300203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal matchings of randomly perturbed lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dor Elboim, Oren Yakir, Yinon Spinka","submitted_at":"2025-06-20T09:45:12Z","abstract_excerpt":"Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant perfect matching between this point process and the lattice, such that the matching distance has the same tail behavior as the hole probability of the point process, which is a natural lower bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16873","kind":"arxiv","version":1},"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/2506.16873/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":"2506.16873","created_at":"2026-07-05T11:24:44.300262+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16873v1","created_at":"2026-07-05T11:24:44.300262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16873","created_at":"2026-07-05T11:24:44.300262+00:00"},{"alias_kind":"pith_short_12","alias_value":"QO47UXJ3JCFH","created_at":"2026-07-05T11:24:44.300262+00:00"},{"alias_kind":"pith_short_16","alias_value":"QO47UXJ3JCFHY5G2","created_at":"2026-07-05T11:24:44.300262+00:00"},{"alias_kind":"pith_short_8","alias_value":"QO47UXJ3","created_at":"2026-07-05T11:24:44.300262+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22803","citing_title":"Persistence of asymptotic variance under transport: from hyperfluctuation to stealthy hyperuniformity","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QO47UXJ3JCFHY5G2J24ZBHXGN4","json":"https://pith.science/pith/QO47UXJ3JCFHY5G2J24ZBHXGN4.json","graph_json":"https://pith.science/api/pith-number/QO47UXJ3JCFHY5G2J24ZBHXGN4/graph.json","events_json":"https://pith.science/api/pith-number/QO47UXJ3JCFHY5G2J24ZBHXGN4/events.json","paper":"https://pith.science/paper/QO47UXJ3"},"agent_actions":{"view_html":"https://pith.science/pith/QO47UXJ3JCFHY5G2J24ZBHXGN4","download_json":"https://pith.science/pith/QO47UXJ3JCFHY5G2J24ZBHXGN4.json","view_paper":"https://pith.science/paper/QO47UXJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16873&json=true","fetch_graph":"https://pith.science/api/pith-number/QO47UXJ3JCFHY5G2J24ZBHXGN4/graph.json","fetch_events":"https://pith.science/api/pith-number/QO47UXJ3JCFHY5G2J24ZBHXGN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QO47UXJ3JCFHY5G2J24ZBHXGN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QO47UXJ3JCFHY5G2J24ZBHXGN4/action/storage_attestation","attest_author":"https://pith.science/pith/QO47UXJ3JCFHY5G2J24ZBHXGN4/action/author_attestation","sign_citation":"https://pith.science/pith/QO47UXJ3JCFHY5G2J24ZBHXGN4/action/citation_signature","submit_replication":"https://pith.science/pith/QO47UXJ3JCFHY5G2J24ZBHXGN4/action/replication_record"}},"created_at":"2026-07-05T11:24:44.300262+00:00","updated_at":"2026-07-05T11:24:44.300262+00:00"}