{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4OUATUQJSSZGVP5ONDAARU5HZT","short_pith_number":"pith:4OUATUQJ","schema_version":"1.0","canonical_sha256":"e3a809d20994b26abfae68c008d3a7ccc6f54f7cc99003fb986137014aba7e25","source":{"kind":"arxiv","id":"2608.08238","version":1},"attestation_state":"computed","paper":{"title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Honghao Lin, Vahab Mirrokni","submitted_at":"2026-08-06T17:46:47Z","abstract_excerpt":"For the $n\\times n$ lower-triangular all-ones matrix $Q$, we prove a near-optimal lower bound \\[ \\gamma_{2,1}(Q) := \\inf_{Q=AB} \\|A\\|_{2\\to\\infty}\\|B\\|_{1\\to1} =\n\\Omega\\!\\left( \\frac{\\log^{3/2}n}{(\\log\\log n)^{3/2}} \\right), \\] where the infimum ranges over real factorizations of arbitrary finite inner dimension. This cost is a central parameter in space bounds for factorization-based rank and quantile estimation in turnstile streams and in error bounds for matrix mechanisms for continual counting under pure differential privacy. The proof combines right-sided Haar projections with a scale-dep"},"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":"2608.08238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-06T17:46:47Z","cross_cats_sorted":[],"title_canon_sha256":"2abd81dc98c3851b2294b964f8c5f6d650bf393c194f5b2d0100e420d1f49fb8","abstract_canon_sha256":"91de74cb41f9111b48bc6dc8a269b82aeb344bd99cf43cd62eec3f0596e52164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:22:05.853451Z","signature_b64":"zX1+O4Y5xMnHJaRFVo8Q+BO22RLI4AK7DzUHhZWGHlJ36FL2DozSh8SxO2URnfxYKliyPoE2PqncyUAFkCkMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3a809d20994b26abfae68c008d3a7ccc6f54f7cc99003fb986137014aba7e25","last_reissued_at":"2026-08-11T01:22:05.850993Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:22:05.850993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Honghao Lin, Vahab Mirrokni","submitted_at":"2026-08-06T17:46:47Z","abstract_excerpt":"For the $n\\times n$ lower-triangular all-ones matrix $Q$, we prove a near-optimal lower bound \\[ \\gamma_{2,1}(Q) := \\inf_{Q=AB} \\|A\\|_{2\\to\\infty}\\|B\\|_{1\\to1} =\n\\Omega\\!\\left( \\frac{\\log^{3/2}n}{(\\log\\log n)^{3/2}} \\right), \\] where the infimum ranges over real factorizations of arbitrary finite inner dimension. This cost is a central parameter in space bounds for factorization-based rank and quantile estimation in turnstile streams and in error bounds for matrix mechanisms for continual counting under pure differential privacy. The proof combines right-sided Haar projections with a scale-dep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08238","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/2608.08238/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":"2608.08238","created_at":"2026-08-11T01:22:05.851741+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08238v1","created_at":"2026-08-11T01:22:05.851741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08238","created_at":"2026-08-11T01:22:05.851741+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OUATUQJSSZG","created_at":"2026-08-11T01:22:05.851741+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OUATUQJSSZGVP5O","created_at":"2026-08-11T01:22:05.851741+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OUATUQJ","created_at":"2026-08-11T01:22:05.851741+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/4OUATUQJSSZGVP5ONDAARU5HZT","json":"https://pith.science/pith/4OUATUQJSSZGVP5ONDAARU5HZT.json","graph_json":"https://pith.science/api/pith-number/4OUATUQJSSZGVP5ONDAARU5HZT/graph.json","events_json":"https://pith.science/api/pith-number/4OUATUQJSSZGVP5ONDAARU5HZT/events.json","paper":"https://pith.science/paper/4OUATUQJ"},"agent_actions":{"view_html":"https://pith.science/pith/4OUATUQJSSZGVP5ONDAARU5HZT","download_json":"https://pith.science/pith/4OUATUQJSSZGVP5ONDAARU5HZT.json","view_paper":"https://pith.science/paper/4OUATUQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08238&json=true","fetch_graph":"https://pith.science/api/pith-number/4OUATUQJSSZGVP5ONDAARU5HZT/graph.json","fetch_events":"https://pith.science/api/pith-number/4OUATUQJSSZGVP5ONDAARU5HZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OUATUQJSSZGVP5ONDAARU5HZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OUATUQJSSZGVP5ONDAARU5HZT/action/storage_attestation","attest_author":"https://pith.science/pith/4OUATUQJSSZGVP5ONDAARU5HZT/action/author_attestation","sign_citation":"https://pith.science/pith/4OUATUQJSSZGVP5ONDAARU5HZT/action/citation_signature","submit_replication":"https://pith.science/pith/4OUATUQJSSZGVP5ONDAARU5HZT/action/replication_record"}},"created_at":"2026-08-11T01:22:05.851741+00:00","updated_at":"2026-08-11T01:22:05.851741+00:00"}