{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YHTHQCK2C6MDT4M5XZY3LLOCSV","short_pith_number":"pith:YHTHQCK2","schema_version":"1.0","canonical_sha256":"c1e678095a179839f19dbe71b5adc29575a9cde87c803dcf57cb1d22971ae516","source":{"kind":"arxiv","id":"2509.05211","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"cs.CC","authors_text":"D. M. Stull, Elvira Mayordomo, Marianna Cs\\\"ornyei, Neil Lutz, Patrick Lutz, Peter Cholak","submitted_at":"2025-09-05T16:12:50Z","abstract_excerpt":"We develop quantitative algorithmic information bounds for orthogonal projections and distances in the plane. Under mild independence conditions, the distance $|x-y|$ and a projection coordinate $p_e x$ each retain at least half the algorithmic information content of $x$ in the sense of finite-precision Kolmogorov complexity, up to lower-order terms. Our bounds support conditioning on coarser approximations, enabling case analyses across precision scales. The proofs introduce a surrogate point selection step. Via the point-to-set principle we derive a new bound on the Hausdorff dimension of pi"},"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":"2509.05211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-09-05T16:12:50Z","cross_cats_sorted":["math.CA"],"title_canon_sha256":"b81a3b7cb6c166326c5f103008a458e39a5b59e358d13202fea9f179000eb140","abstract_canon_sha256":"1dc68c472f1f8a69766f17a13d03c007bc33b61324be77f6347fc838ea3de43f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:37.875856Z","signature_b64":"J/wiHSK2nP0kDtibR7hHP/4GazFkPF4oE2dyezR06A+c7coCwQWDdgAqHppd69Xy7GLI0DxTcGZyHKZdrcYaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e678095a179839f19dbe71b5adc29575a9cde87c803dcf57cb1d22971ae516","last_reissued_at":"2026-07-05T12:05:37.875305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:37.875305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"cs.CC","authors_text":"D. M. Stull, Elvira Mayordomo, Marianna Cs\\\"ornyei, Neil Lutz, Patrick Lutz, Peter Cholak","submitted_at":"2025-09-05T16:12:50Z","abstract_excerpt":"We develop quantitative algorithmic information bounds for orthogonal projections and distances in the plane. Under mild independence conditions, the distance $|x-y|$ and a projection coordinate $p_e x$ each retain at least half the algorithmic information content of $x$ in the sense of finite-precision Kolmogorov complexity, up to lower-order terms. Our bounds support conditioning on coarser approximations, enabling case analyses across precision scales. The proofs introduce a surrogate point selection step. Via the point-to-set principle we derive a new bound on the Hausdorff dimension of pi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.05211","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/2509.05211/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":"2509.05211","created_at":"2026-07-05T12:05:37.875390+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.05211v1","created_at":"2026-07-05T12:05:37.875390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.05211","created_at":"2026-07-05T12:05:37.875390+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHTHQCK2C6MD","created_at":"2026-07-05T12:05:37.875390+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHTHQCK2C6MDT4M5","created_at":"2026-07-05T12:05:37.875390+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHTHQCK2","created_at":"2026-07-05T12:05:37.875390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.06119","citing_title":"Projections of sets with optimal oracles onto $k$-planes","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YHTHQCK2C6MDT4M5XZY3LLOCSV","json":"https://pith.science/pith/YHTHQCK2C6MDT4M5XZY3LLOCSV.json","graph_json":"https://pith.science/api/pith-number/YHTHQCK2C6MDT4M5XZY3LLOCSV/graph.json","events_json":"https://pith.science/api/pith-number/YHTHQCK2C6MDT4M5XZY3LLOCSV/events.json","paper":"https://pith.science/paper/YHTHQCK2"},"agent_actions":{"view_html":"https://pith.science/pith/YHTHQCK2C6MDT4M5XZY3LLOCSV","download_json":"https://pith.science/pith/YHTHQCK2C6MDT4M5XZY3LLOCSV.json","view_paper":"https://pith.science/paper/YHTHQCK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.05211&json=true","fetch_graph":"https://pith.science/api/pith-number/YHTHQCK2C6MDT4M5XZY3LLOCSV/graph.json","fetch_events":"https://pith.science/api/pith-number/YHTHQCK2C6MDT4M5XZY3LLOCSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHTHQCK2C6MDT4M5XZY3LLOCSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHTHQCK2C6MDT4M5XZY3LLOCSV/action/storage_attestation","attest_author":"https://pith.science/pith/YHTHQCK2C6MDT4M5XZY3LLOCSV/action/author_attestation","sign_citation":"https://pith.science/pith/YHTHQCK2C6MDT4M5XZY3LLOCSV/action/citation_signature","submit_replication":"https://pith.science/pith/YHTHQCK2C6MDT4M5XZY3LLOCSV/action/replication_record"}},"created_at":"2026-07-05T12:05:37.875390+00:00","updated_at":"2026-07-05T12:05:37.875390+00:00"}