{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NGX2IUF55GKV3V7BJPJPE55CGF","short_pith_number":"pith:NGX2IUF5","schema_version":"1.0","canonical_sha256":"69afa450bde9955dd7e14bd2f277a231536107c54960d3e662ba932a940db1ac","source":{"kind":"arxiv","id":"2606.04837","version":1},"attestation_state":"computed","paper":{"title":"Maximal Minimal Spacing for Random Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.MP","math.PR"],"primary_cat":"math-ph","authors_text":"Fabio Deelan Cunden, Giovanni Gramegna, Noemi Cuppone, Pierpaolo Vivo","submitted_at":"2026-06-03T13:07:41Z","abstract_excerpt":"From $N+1$ random points on a line we wish to select $M+1$ points so as to maximize the minimal spacing between them. We consider an initial configuration with independent and identically distributed spacings. The problem is equivalent to optimally grouping consecutive gaps into $M$ blocks and maximizing the smallest block sum. For general gap distributions, and for all $M\\leq N$, we derive exact distributional identities for the optimal spacing and obtain its asymptotic behavior. The problem admits a reformulation in terms of a threshold-resetting random walk. The walk advances by successive "},"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":"2606.04837","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math-ph","submitted_at":"2026-06-03T13:07:41Z","cross_cats_sorted":["cond-mat.stat-mech","math.MP","math.PR"],"title_canon_sha256":"699892b65f4a7bf7a7e04a1ee61ae7236913e2dd3c0b7eee8af0414cdf98971c","abstract_canon_sha256":"3acce0d0bfe444835ecbae7321e8c31db55e36e19dafc9dfe06b379437f463f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:31.712790Z","signature_b64":"y+NZnFD5X6odPxjwmNZyXuT7gvjAp+u+Y2bnXur5DdS1SaxJY2bIT5bnPm/er9lycOFxwmxCptzqIByIra+WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69afa450bde9955dd7e14bd2f277a231536107c54960d3e662ba932a940db1ac","last_reissued_at":"2026-06-04T01:09:31.712362Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:31.712362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal Minimal Spacing for Random Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.MP","math.PR"],"primary_cat":"math-ph","authors_text":"Fabio Deelan Cunden, Giovanni Gramegna, Noemi Cuppone, Pierpaolo Vivo","submitted_at":"2026-06-03T13:07:41Z","abstract_excerpt":"From $N+1$ random points on a line we wish to select $M+1$ points so as to maximize the minimal spacing between them. We consider an initial configuration with independent and identically distributed spacings. The problem is equivalent to optimally grouping consecutive gaps into $M$ blocks and maximizing the smallest block sum. For general gap distributions, and for all $M\\leq N$, we derive exact distributional identities for the optimal spacing and obtain its asymptotic behavior. The problem admits a reformulation in terms of a threshold-resetting random walk. The walk advances by successive "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04837","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/2606.04837/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":"2606.04837","created_at":"2026-06-04T01:09:31.712428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04837v1","created_at":"2026-06-04T01:09:31.712428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04837","created_at":"2026-06-04T01:09:31.712428+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGX2IUF55GKV","created_at":"2026-06-04T01:09:31.712428+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGX2IUF55GKV3V7B","created_at":"2026-06-04T01:09:31.712428+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGX2IUF5","created_at":"2026-06-04T01:09:31.712428+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/NGX2IUF55GKV3V7BJPJPE55CGF","json":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF.json","graph_json":"https://pith.science/api/pith-number/NGX2IUF55GKV3V7BJPJPE55CGF/graph.json","events_json":"https://pith.science/api/pith-number/NGX2IUF55GKV3V7BJPJPE55CGF/events.json","paper":"https://pith.science/paper/NGX2IUF5"},"agent_actions":{"view_html":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF","download_json":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF.json","view_paper":"https://pith.science/paper/NGX2IUF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04837&json=true","fetch_graph":"https://pith.science/api/pith-number/NGX2IUF55GKV3V7BJPJPE55CGF/graph.json","fetch_events":"https://pith.science/api/pith-number/NGX2IUF55GKV3V7BJPJPE55CGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF/action/storage_attestation","attest_author":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF/action/author_attestation","sign_citation":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF/action/citation_signature","submit_replication":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF/action/replication_record"}},"created_at":"2026-06-04T01:09:31.712428+00:00","updated_at":"2026-06-04T01:09:31.712428+00:00"}