{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FECKAVLNUHR7UIBMUE54EVUQYX","short_pith_number":"pith:FECKAVLN","schema_version":"1.0","canonical_sha256":"2904a0556da1e3fa202ca13bc25690c5c556906382abba02347b89f1f603366d","source":{"kind":"arxiv","id":"2606.00703","version":1},"attestation_state":"computed","paper":{"title":"Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Munsik Kim","submitted_at":"2026-05-30T12:22:20Z","abstract_excerpt":"Low-precision pretraining (FP8, MXFP4, NVFP4) is now standard for frontier language models, yet the literature is almost entirely achievability -- algorithms and empirical scaling laws -- with no matching characterization of what is information-theoretically possible. We study a B-bit quantized stochastic first-order oracle: an optimizer interacts for T rounds and receives, each round, a B-bit adaptive public-coin description of its stochastic gradient. Our main contribution is an exact reduction from optimizing a strongly convex quadratic family to interactively compressed Gaussian mean estim"},"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":"2606.00703","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-30T12:22:20Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"a0a5582bc5d6562903c05829119c9c8d499c1a8fb106be70b4b6a4f21aa9e020","abstract_canon_sha256":"9ecc8b251313051a1b09f258aef4a05487291db6ac40389393116a87bbd7ef09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:03.252899Z","signature_b64":"1uoWZZYF5m2DPe9JC6dh81DmZSWmq9PANj0l/x0CzbhokDXWMQ95ti27/edLqg8qp5gmMX1TRfcyGMhcQHD+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2904a0556da1e3fa202ca13bc25690c5c556906382abba02347b89f1f603366d","last_reissued_at":"2026-06-02T01:04:03.252501Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:03.252501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Munsik Kim","submitted_at":"2026-05-30T12:22:20Z","abstract_excerpt":"Low-precision pretraining (FP8, MXFP4, NVFP4) is now standard for frontier language models, yet the literature is almost entirely achievability -- algorithms and empirical scaling laws -- with no matching characterization of what is information-theoretically possible. We study a B-bit quantized stochastic first-order oracle: an optimizer interacts for T rounds and receives, each round, a B-bit adaptive public-coin description of its stochastic gradient. Our main contribution is an exact reduction from optimizing a strongly convex quadratic family to interactively compressed Gaussian mean estim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00703","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.00703/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":"2606.00703","created_at":"2026-06-02T01:04:03.252560+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00703v1","created_at":"2026-06-02T01:04:03.252560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00703","created_at":"2026-06-02T01:04:03.252560+00:00"},{"alias_kind":"pith_short_12","alias_value":"FECKAVLNUHR7","created_at":"2026-06-02T01:04:03.252560+00:00"},{"alias_kind":"pith_short_16","alias_value":"FECKAVLNUHR7UIBM","created_at":"2026-06-02T01:04:03.252560+00:00"},{"alias_kind":"pith_short_8","alias_value":"FECKAVLN","created_at":"2026-06-02T01:04:03.252560+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FECKAVLNUHR7UIBMUE54EVUQYX","json":"https://pith.science/pith/FECKAVLNUHR7UIBMUE54EVUQYX.json","graph_json":"https://pith.science/api/pith-number/FECKAVLNUHR7UIBMUE54EVUQYX/graph.json","events_json":"https://pith.science/api/pith-number/FECKAVLNUHR7UIBMUE54EVUQYX/events.json","paper":"https://pith.science/paper/FECKAVLN"},"agent_actions":{"view_html":"https://pith.science/pith/FECKAVLNUHR7UIBMUE54EVUQYX","download_json":"https://pith.science/pith/FECKAVLNUHR7UIBMUE54EVUQYX.json","view_paper":"https://pith.science/paper/FECKAVLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00703&json=true","fetch_graph":"https://pith.science/api/pith-number/FECKAVLNUHR7UIBMUE54EVUQYX/graph.json","fetch_events":"https://pith.science/api/pith-number/FECKAVLNUHR7UIBMUE54EVUQYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FECKAVLNUHR7UIBMUE54EVUQYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FECKAVLNUHR7UIBMUE54EVUQYX/action/storage_attestation","attest_author":"https://pith.science/pith/FECKAVLNUHR7UIBMUE54EVUQYX/action/author_attestation","sign_citation":"https://pith.science/pith/FECKAVLNUHR7UIBMUE54EVUQYX/action/citation_signature","submit_replication":"https://pith.science/pith/FECKAVLNUHR7UIBMUE54EVUQYX/action/replication_record"}},"created_at":"2026-06-02T01:04:03.252560+00:00","updated_at":"2026-06-02T01:04:03.252560+00:00"}