{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NZ2PUT3O335XUNLZF4G4B5TZU3","short_pith_number":"pith:NZ2PUT3O","schema_version":"1.0","canonical_sha256":"6e74fa4f6edefb7a35792f0dc0f679a6efa6f84dd392fd03ee6793802a71f1c8","source":{"kind":"arxiv","id":"2409.03678","version":2},"attestation_state":"computed","paper":{"title":"On variants of the Furstenberg set problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"math.CA","authors_text":"Jonathan M. Fraser","submitted_at":"2024-09-05T16:29:49Z","abstract_excerpt":"Given an integer $d \\geq 2$, $s \\in (0,1]$, and $t \\in [0,2(d-1)]$, suppose a set $X$ in $\\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects $X$ in a set of packing dimension at least $s$. We show that such sets must have packing dimension at least $\\max\\{s,t/2\\}$ and that this bound is sharp. In particular, the special case $d=2$ solves a variant of the Furstenberg set problem for packing dimension. We also solve the upper and lower box dimension variants of the problem. In both of these cases t"},"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":"2409.03678","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CA","submitted_at":"2024-09-05T16:29:49Z","cross_cats_sorted":["math.CO","math.MG"],"title_canon_sha256":"34d4552d105b6a43c031151fcd463a5508e4f59f85970f5ac4dadd4fbbd79653","abstract_canon_sha256":"89969ca58b458054309dbe48c631cdad82e7802fe4b7c807dafb8d66ace302ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:25.519097Z","signature_b64":"m6wVnbHfFHAX06+we/XhRxpx7MiIp3LK4ZveUhKi1JfBBGdJn/GnuvYo6N2Lub4FVMWcUHIhTT+zwk/8O+ZsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e74fa4f6edefb7a35792f0dc0f679a6efa6f84dd392fd03ee6793802a71f1c8","last_reissued_at":"2026-07-05T09:09:25.518628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:25.518628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On variants of the Furstenberg set problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"math.CA","authors_text":"Jonathan M. Fraser","submitted_at":"2024-09-05T16:29:49Z","abstract_excerpt":"Given an integer $d \\geq 2$, $s \\in (0,1]$, and $t \\in [0,2(d-1)]$, suppose a set $X$ in $\\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects $X$ in a set of packing dimension at least $s$. We show that such sets must have packing dimension at least $\\max\\{s,t/2\\}$ and that this bound is sharp. In particular, the special case $d=2$ solves a variant of the Furstenberg set problem for packing dimension. We also solve the upper and lower box dimension variants of the problem. In both of these cases t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.03678","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/2409.03678/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":"2409.03678","created_at":"2026-07-05T09:09:25.518687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.03678v2","created_at":"2026-07-05T09:09:25.518687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.03678","created_at":"2026-07-05T09:09:25.518687+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZ2PUT3O335X","created_at":"2026-07-05T09:09:25.518687+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZ2PUT3O335XUNLZ","created_at":"2026-07-05T09:09:25.518687+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZ2PUT3O","created_at":"2026-07-05T09:09:25.518687+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.18257","citing_title":"On the packing dimension of unions and extensions of $k$-planes","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NZ2PUT3O335XUNLZF4G4B5TZU3","json":"https://pith.science/pith/NZ2PUT3O335XUNLZF4G4B5TZU3.json","graph_json":"https://pith.science/api/pith-number/NZ2PUT3O335XUNLZF4G4B5TZU3/graph.json","events_json":"https://pith.science/api/pith-number/NZ2PUT3O335XUNLZF4G4B5TZU3/events.json","paper":"https://pith.science/paper/NZ2PUT3O"},"agent_actions":{"view_html":"https://pith.science/pith/NZ2PUT3O335XUNLZF4G4B5TZU3","download_json":"https://pith.science/pith/NZ2PUT3O335XUNLZF4G4B5TZU3.json","view_paper":"https://pith.science/paper/NZ2PUT3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.03678&json=true","fetch_graph":"https://pith.science/api/pith-number/NZ2PUT3O335XUNLZF4G4B5TZU3/graph.json","fetch_events":"https://pith.science/api/pith-number/NZ2PUT3O335XUNLZF4G4B5TZU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZ2PUT3O335XUNLZF4G4B5TZU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZ2PUT3O335XUNLZF4G4B5TZU3/action/storage_attestation","attest_author":"https://pith.science/pith/NZ2PUT3O335XUNLZF4G4B5TZU3/action/author_attestation","sign_citation":"https://pith.science/pith/NZ2PUT3O335XUNLZF4G4B5TZU3/action/citation_signature","submit_replication":"https://pith.science/pith/NZ2PUT3O335XUNLZF4G4B5TZU3/action/replication_record"}},"created_at":"2026-07-05T09:09:25.518687+00:00","updated_at":"2026-07-05T09:09:25.518687+00:00"}