{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NGX2IUF55GKV3V7BJPJPE55CGF","short_pith_number":"pith:NGX2IUF5","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"},"canonical_sha256":"69afa450bde9955dd7e14bd2f277a231536107c54960d3e662ba932a940db1ac","source":{"kind":"arxiv","id":"2606.04837","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04837","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04837v1","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04837","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"NGX2IUF55GKV","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"pith_short_16","alias_value":"NGX2IUF55GKV3V7B","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"pith_short_8","alias_value":"NGX2IUF5","created_at":"2026-06-04T01:09:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NGX2IUF55GKV3V7BJPJPE55CGF","target":"record","payload":{"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"},"canonical_sha256":"69afa450bde9955dd7e14bd2f277a231536107c54960d3e662ba932a940db1ac","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"},"source_kind":"arxiv","source_id":"2606.04837","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T01:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8oEf2K0zeC5Rg86lFWKckE63WGZcdj2QdEzT74pXkVUgaKP05+EtT18CuuF195s+FlMQYtCLt1ciQyGRZSTVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:23:12.635713Z"},"content_sha256":"40aec0914c46bdf2fb4d862e8123a79882eb4a41c7ba7f6262ee6915c7e0069f","schema_version":"1.0","event_id":"sha256:40aec0914c46bdf2fb4d862e8123a79882eb4a41c7ba7f6262ee6915c7e0069f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NGX2IUF55GKV3V7BJPJPE55CGF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T01:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D8GC5L9ABeYx/zBBMd3tl/xuNXS+2aG0j232OPAsLECGMi3CXV7Ne8SwSSS8kVR/dXYol9H07JQUiCePS6TKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:23:12.636100Z"},"content_sha256":"d71a9bdd1d39c836156a104760afc11a2d4fcb203cecd309e21855057f7fe002","schema_version":"1.0","event_id":"sha256:d71a9bdd1d39c836156a104760afc11a2d4fcb203cecd309e21855057f7fe002"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF/bundle.json","state_url":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGX2IUF55GKV3V7BJPJPE55CGF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T23:23:12Z","links":{"resolver":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF","bundle":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF/bundle.json","state":"https://pith.science/pith/NGX2IUF55GKV3V7BJPJPE55CGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGX2IUF55GKV3V7BJPJPE55CGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NGX2IUF55GKV3V7BJPJPE55CGF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3acce0d0bfe444835ecbae7321e8c31db55e36e19dafc9dfe06b379437f463f2","cross_cats_sorted":["cond-mat.stat-mech","math.MP","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math-ph","submitted_at":"2026-06-03T13:07:41Z","title_canon_sha256":"699892b65f4a7bf7a7e04a1ee61ae7236913e2dd3c0b7eee8af0414cdf98971c"},"schema_version":"1.0","source":{"id":"2606.04837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04837","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04837v1","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04837","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"NGX2IUF55GKV","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"pith_short_16","alias_value":"NGX2IUF55GKV3V7B","created_at":"2026-06-04T01:09:31Z"},{"alias_kind":"pith_short_8","alias_value":"NGX2IUF5","created_at":"2026-06-04T01:09:31Z"}],"graph_snapshots":[{"event_id":"sha256:d71a9bdd1d39c836156a104760afc11a2d4fcb203cecd309e21855057f7fe002","target":"graph","created_at":"2026-06-04T01:09:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.04837/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Fabio Deelan Cunden, Giovanni Gramegna, Noemi Cuppone, Pierpaolo Vivo","cross_cats":["cond-mat.stat-mech","math.MP","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math-ph","submitted_at":"2026-06-03T13:07:41Z","title":"Maximal Minimal Spacing for Random Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04837","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:40aec0914c46bdf2fb4d862e8123a79882eb4a41c7ba7f6262ee6915c7e0069f","target":"record","created_at":"2026-06-04T01:09:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3acce0d0bfe444835ecbae7321e8c31db55e36e19dafc9dfe06b379437f463f2","cross_cats_sorted":["cond-mat.stat-mech","math.MP","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math-ph","submitted_at":"2026-06-03T13:07:41Z","title_canon_sha256":"699892b65f4a7bf7a7e04a1ee61ae7236913e2dd3c0b7eee8af0414cdf98971c"},"schema_version":"1.0","source":{"id":"2606.04837","kind":"arxiv","version":1}},"canonical_sha256":"69afa450bde9955dd7e14bd2f277a231536107c54960d3e662ba932a940db1ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69afa450bde9955dd7e14bd2f277a231536107c54960d3e662ba932a940db1ac","first_computed_at":"2026-06-04T01:09:31.712362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:09:31.712362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y+NZnFD5X6odPxjwmNZyXuT7gvjAp+u+Y2bnXur5DdS1SaxJY2bIT5bnPm/er9lycOFxwmxCptzqIByIra+WCg==","signature_status":"signed_v1","signed_at":"2026-06-04T01:09:31.712790Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.04837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40aec0914c46bdf2fb4d862e8123a79882eb4a41c7ba7f6262ee6915c7e0069f","sha256:d71a9bdd1d39c836156a104760afc11a2d4fcb203cecd309e21855057f7fe002"],"state_sha256":"bfbd195996fcfa8e17d437a1a13a4adfe0131230e8f8de07aead3c99168db6f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hhu1qI9JFO5SPcBr8EvSoBocGk0/mqaM9myzUAYhydqTO/VTzIbgm7bp6rBEfY0egZGT5oWqm1C5LJqKv2IvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:23:12.638133Z","bundle_sha256":"30d67388540027033ed06c9e0ba3e0a57b4480497b59eb3a758698e1104ef3a7"}}