{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MXQQDURQHDR72OPOFY6BSMINBP","short_pith_number":"pith:MXQQDURQ","schema_version":"1.0","canonical_sha256":"65e101d23038e3fd39ee2e3c19310d0be54de5024dfc410608f8469875a8c0ab","source":{"kind":"arxiv","id":"2403.10678","version":2},"attestation_state":"computed","paper":{"title":"On the $N$-set occupancy problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"math.CO","authors_text":"Ciprian Demeter, Ruixiang Zhang","submitted_at":"2024-03-15T20:59:53Z","abstract_excerpt":"We explore variants of the following open question: Split $[0,1]^2$ into $N^2$ squares with side length $1/N$. Is there a way to select $N$ such squares such that each line intersects only $O(1)$ of them?"},"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":"2403.10678","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-15T20:59:53Z","cross_cats_sorted":["math.CA"],"title_canon_sha256":"53ea2359e16a05f00c33b4c3a4bcad8f5c25d155fb73ca0a1f9863b8c158de3a","abstract_canon_sha256":"a895a56087a45940d24611c5e2f8cfe2ea28f8d037c6105132e2dcce5ce0b977"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:44.348980Z","signature_b64":"fpsbHJvtWc3bsRJ324742lrCVYURh2fCPTo8iXgioMPP3v8RzO5rl2AWXCw0gqdZXCOkbJTcLCBcMjVZJEYiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65e101d23038e3fd39ee2e3c19310d0be54de5024dfc410608f8469875a8c0ab","last_reissued_at":"2026-07-05T08:35:44.348492Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:44.348492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $N$-set occupancy problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"math.CO","authors_text":"Ciprian Demeter, Ruixiang Zhang","submitted_at":"2024-03-15T20:59:53Z","abstract_excerpt":"We explore variants of the following open question: Split $[0,1]^2$ into $N^2$ squares with side length $1/N$. Is there a way to select $N$ such squares such that each line intersects only $O(1)$ of them?"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10678","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.10678/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":"2403.10678","created_at":"2026-07-05T08:35:44.348542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.10678v2","created_at":"2026-07-05T08:35:44.348542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10678","created_at":"2026-07-05T08:35:44.348542+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXQQDURQHDR7","created_at":"2026-07-05T08:35:44.348542+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXQQDURQHDR72OPO","created_at":"2026-07-05T08:35:44.348542+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXQQDURQ","created_at":"2026-07-05T08:35:44.348542+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05624","citing_title":"Random Constructions for Sharp Estimates of Mizohata-Takeuchi Type","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MXQQDURQHDR72OPOFY6BSMINBP","json":"https://pith.science/pith/MXQQDURQHDR72OPOFY6BSMINBP.json","graph_json":"https://pith.science/api/pith-number/MXQQDURQHDR72OPOFY6BSMINBP/graph.json","events_json":"https://pith.science/api/pith-number/MXQQDURQHDR72OPOFY6BSMINBP/events.json","paper":"https://pith.science/paper/MXQQDURQ"},"agent_actions":{"view_html":"https://pith.science/pith/MXQQDURQHDR72OPOFY6BSMINBP","download_json":"https://pith.science/pith/MXQQDURQHDR72OPOFY6BSMINBP.json","view_paper":"https://pith.science/paper/MXQQDURQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.10678&json=true","fetch_graph":"https://pith.science/api/pith-number/MXQQDURQHDR72OPOFY6BSMINBP/graph.json","fetch_events":"https://pith.science/api/pith-number/MXQQDURQHDR72OPOFY6BSMINBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXQQDURQHDR72OPOFY6BSMINBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXQQDURQHDR72OPOFY6BSMINBP/action/storage_attestation","attest_author":"https://pith.science/pith/MXQQDURQHDR72OPOFY6BSMINBP/action/author_attestation","sign_citation":"https://pith.science/pith/MXQQDURQHDR72OPOFY6BSMINBP/action/citation_signature","submit_replication":"https://pith.science/pith/MXQQDURQHDR72OPOFY6BSMINBP/action/replication_record"}},"created_at":"2026-07-05T08:35:44.348542+00:00","updated_at":"2026-07-05T08:35:44.348542+00:00"}