{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:F6QB3JGD4RDL6VZSYJTW3XNOYG","short_pith_number":"pith:F6QB3JGD","schema_version":"1.0","canonical_sha256":"2fa01da4c3e446bf5732c2676dddaec1b23cc17c077b22d1cc5d8eaa4b368c00","source":{"kind":"arxiv","id":"2305.06937","version":3},"attestation_state":"computed","paper":{"title":"Distance sets bounds for polyhedral norms via effective dimension","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Bobby Wilson, Iqra Altaf, Ryan Bushling","submitted_at":"2023-05-11T16:14:38Z","abstract_excerpt":"We prove that, for every norm on $\\mathbb{R}^d$ and every $E \\subseteq \\mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\\dim_{\\mathrm{H}} E - (d-1)$. An explicit construction follows, demonstrating that this bound is sharp for every polyhedral norm on $\\mathbb{R}^d$. The techniques of algorithmic complexity theory underlie both the computations and the construction."},"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":"2305.06937","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CA","submitted_at":"2023-05-11T16:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"43da8551e9865c3cc2ab2b2b29434fbb6cf177e2005c46ba8066612194f8d559","abstract_canon_sha256":"9ecd3704255708cb7c641fe4fabffbe478e7eda3f0295c1c4a7104836a93aa1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:48.408670Z","signature_b64":"lNEASMwZP20HbQHUVmeO+AWXvTKZ7Mo49p3AoeA0p9SIWjn/gLQ8QPRjNPCqBo3Es81yTy3MEGewd0uxfDCUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fa01da4c3e446bf5732c2676dddaec1b23cc17c077b22d1cc5d8eaa4b368c00","last_reissued_at":"2026-07-05T09:29:48.408259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:48.408259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance sets bounds for polyhedral norms via effective dimension","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Bobby Wilson, Iqra Altaf, Ryan Bushling","submitted_at":"2023-05-11T16:14:38Z","abstract_excerpt":"We prove that, for every norm on $\\mathbb{R}^d$ and every $E \\subseteq \\mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\\dim_{\\mathrm{H}} E - (d-1)$. An explicit construction follows, demonstrating that this bound is sharp for every polyhedral norm on $\\mathbb{R}^d$. The techniques of algorithmic complexity theory underlie both the computations and the construction."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.06937","kind":"arxiv","version":3},"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/2305.06937/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":"2305.06937","created_at":"2026-07-05T09:29:48.408321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.06937v3","created_at":"2026-07-05T09:29:48.408321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.06937","created_at":"2026-07-05T09:29:48.408321+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6QB3JGD4RDL","created_at":"2026-07-05T09:29:48.408321+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6QB3JGD4RDL6VZS","created_at":"2026-07-05T09:29:48.408321+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6QB3JGD","created_at":"2026-07-05T09:29:48.408321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.05211","citing_title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6QB3JGD4RDL6VZSYJTW3XNOYG","json":"https://pith.science/pith/F6QB3JGD4RDL6VZSYJTW3XNOYG.json","graph_json":"https://pith.science/api/pith-number/F6QB3JGD4RDL6VZSYJTW3XNOYG/graph.json","events_json":"https://pith.science/api/pith-number/F6QB3JGD4RDL6VZSYJTW3XNOYG/events.json","paper":"https://pith.science/paper/F6QB3JGD"},"agent_actions":{"view_html":"https://pith.science/pith/F6QB3JGD4RDL6VZSYJTW3XNOYG","download_json":"https://pith.science/pith/F6QB3JGD4RDL6VZSYJTW3XNOYG.json","view_paper":"https://pith.science/paper/F6QB3JGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.06937&json=true","fetch_graph":"https://pith.science/api/pith-number/F6QB3JGD4RDL6VZSYJTW3XNOYG/graph.json","fetch_events":"https://pith.science/api/pith-number/F6QB3JGD4RDL6VZSYJTW3XNOYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6QB3JGD4RDL6VZSYJTW3XNOYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6QB3JGD4RDL6VZSYJTW3XNOYG/action/storage_attestation","attest_author":"https://pith.science/pith/F6QB3JGD4RDL6VZSYJTW3XNOYG/action/author_attestation","sign_citation":"https://pith.science/pith/F6QB3JGD4RDL6VZSYJTW3XNOYG/action/citation_signature","submit_replication":"https://pith.science/pith/F6QB3JGD4RDL6VZSYJTW3XNOYG/action/replication_record"}},"created_at":"2026-07-05T09:29:48.408321+00:00","updated_at":"2026-07-05T09:29:48.408321+00:00"}