{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5HKRGONHPCBQLKKX4RDP7TRAYW","short_pith_number":"pith:5HKRGONH","schema_version":"1.0","canonical_sha256":"e9d51339a7788305a957e446ffce20c5951c0ec2820208ed62b86cd623912cf6","source":{"kind":"arxiv","id":"1212.4372","version":3},"attestation_state":"computed","paper":{"title":"Sliding Windows with Limited Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Paul Beame, Raphael Clifford, Widad Machmouchi","submitted_at":"2012-12-18T14:50:45Z","abstract_excerpt":"We consider time-space tradeoffs for exactly computing frequency moments and order statistics over sliding windows. Given an input of length 2n-1, the task is to output the function of each window of length n, giving n outputs in total. Computations over sliding windows are related to direct sum problems except that inputs to instances almost completely overlap.\n  We show an average case and randomized time-space tradeoff lower bound of TS in Omega(n^2) for multi-way branching programs, and hence standard RAM and word-RAM models, to compute the number of distinct elements, F_0, in sliding wind"},"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":"1212.4372","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-18T14:50:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a72a9f726c2768d45162a2a37623306c9f2233566bf7941ef08d857940b7b89d","abstract_canon_sha256":"8e415b824ed5dec0ebb4016e7771f99e2a649c30e3e25a3768f7a933642569e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:00.130618Z","signature_b64":"kVRsBvnrIn9p8nOzQVuURLVSXiqiwj/Gh1DUM+Ao6BmChh34AzLeDS8WG2iXjcmK7TAO9BJIephjINpIDrleBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9d51339a7788305a957e446ffce20c5951c0ec2820208ed62b86cd623912cf6","last_reissued_at":"2026-05-18T03:13:00.129985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:00.129985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sliding Windows with Limited Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Paul Beame, Raphael Clifford, Widad Machmouchi","submitted_at":"2012-12-18T14:50:45Z","abstract_excerpt":"We consider time-space tradeoffs for exactly computing frequency moments and order statistics over sliding windows. Given an input of length 2n-1, the task is to output the function of each window of length n, giving n outputs in total. Computations over sliding windows are related to direct sum problems except that inputs to instances almost completely overlap.\n  We show an average case and randomized time-space tradeoff lower bound of TS in Omega(n^2) for multi-way branching programs, and hence standard RAM and word-RAM models, to compute the number of distinct elements, F_0, in sliding wind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4372","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":""},"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":"1212.4372","created_at":"2026-05-18T03:13:00.130088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4372v3","created_at":"2026-05-18T03:13:00.130088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4372","created_at":"2026-05-18T03:13:00.130088+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HKRGONHPCBQ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HKRGONHPCBQLKKX","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HKRGONH","created_at":"2026-05-18T12:26:53.410803+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/5HKRGONHPCBQLKKX4RDP7TRAYW","json":"https://pith.science/pith/5HKRGONHPCBQLKKX4RDP7TRAYW.json","graph_json":"https://pith.science/api/pith-number/5HKRGONHPCBQLKKX4RDP7TRAYW/graph.json","events_json":"https://pith.science/api/pith-number/5HKRGONHPCBQLKKX4RDP7TRAYW/events.json","paper":"https://pith.science/paper/5HKRGONH"},"agent_actions":{"view_html":"https://pith.science/pith/5HKRGONHPCBQLKKX4RDP7TRAYW","download_json":"https://pith.science/pith/5HKRGONHPCBQLKKX4RDP7TRAYW.json","view_paper":"https://pith.science/paper/5HKRGONH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4372&json=true","fetch_graph":"https://pith.science/api/pith-number/5HKRGONHPCBQLKKX4RDP7TRAYW/graph.json","fetch_events":"https://pith.science/api/pith-number/5HKRGONHPCBQLKKX4RDP7TRAYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HKRGONHPCBQLKKX4RDP7TRAYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HKRGONHPCBQLKKX4RDP7TRAYW/action/storage_attestation","attest_author":"https://pith.science/pith/5HKRGONHPCBQLKKX4RDP7TRAYW/action/author_attestation","sign_citation":"https://pith.science/pith/5HKRGONHPCBQLKKX4RDP7TRAYW/action/citation_signature","submit_replication":"https://pith.science/pith/5HKRGONHPCBQLKKX4RDP7TRAYW/action/replication_record"}},"created_at":"2026-05-18T03:13:00.130088+00:00","updated_at":"2026-05-18T03:13:00.130088+00:00"}