{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HTYJDWJ7CJL5TEDILS4SL7OVT5","short_pith_number":"pith:HTYJDWJ7","schema_version":"1.0","canonical_sha256":"3cf091d93f1257d990685cb925fdd59f57db5854ad09a8cf86b53e111667f772","source":{"kind":"arxiv","id":"1004.3304","version":1},"attestation_state":"computed","paper":{"title":"Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amit Chakrabarti, Andrew McGregor, Graham Cormode, Ranganath Kondapally","submitted_at":"2010-04-19T20:51:06Z","abstract_excerpt":"This paper makes three main contributions to the theory of communication complexity and stream computation. First, we present new bounds on the information complexity of AUGMENTED-INDEX. In contrast to analogous results for INDEX by Jain, Radhakrishnan and Sen [J. ACM, 2009], we have to overcome the significant technical challenge that protocols for AUGMENTED-INDEX may violate the \"rectangle property\" due to the inherent input sharing. Second, we use these bounds to resolve an open problem of Magniez, Mathieu and Nayak [STOC, 2010] that asked about the multi-pass complexity of recognizing Dyck"},"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":"1004.3304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-19T20:51:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"303942971135920abb226a04a8e8b48e3664979928fc4550a1690d9bd999e776","abstract_canon_sha256":"084e5074096317fa7aea4049474fdd0792a26683491d96fcf025dd4b8c2d4039"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:16.418787Z","signature_b64":"Asyi4TDOaCcGibHhSDZYUAbGw+0kGNXvF6TajUalQlyugmv5kdaMGkted8mPxr7P6j3/8pyzNTnLWG3Rw/ukCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cf091d93f1257d990685cb925fdd59f57db5854ad09a8cf86b53e111667f772","last_reissued_at":"2026-05-18T02:24:16.418059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:16.418059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amit Chakrabarti, Andrew McGregor, Graham Cormode, Ranganath Kondapally","submitted_at":"2010-04-19T20:51:06Z","abstract_excerpt":"This paper makes three main contributions to the theory of communication complexity and stream computation. First, we present new bounds on the information complexity of AUGMENTED-INDEX. In contrast to analogous results for INDEX by Jain, Radhakrishnan and Sen [J. ACM, 2009], we have to overcome the significant technical challenge that protocols for AUGMENTED-INDEX may violate the \"rectangle property\" due to the inherent input sharing. Second, we use these bounds to resolve an open problem of Magniez, Mathieu and Nayak [STOC, 2010] that asked about the multi-pass complexity of recognizing Dyck"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3304","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":""},"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":"1004.3304","created_at":"2026-05-18T02:24:16.418185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.3304v1","created_at":"2026-05-18T02:24:16.418185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3304","created_at":"2026-05-18T02:24:16.418185+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTYJDWJ7CJL5","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTYJDWJ7CJL5TEDI","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTYJDWJ7","created_at":"2026-05-18T12:26:07.630475+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/HTYJDWJ7CJL5TEDILS4SL7OVT5","json":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5.json","graph_json":"https://pith.science/api/pith-number/HTYJDWJ7CJL5TEDILS4SL7OVT5/graph.json","events_json":"https://pith.science/api/pith-number/HTYJDWJ7CJL5TEDILS4SL7OVT5/events.json","paper":"https://pith.science/paper/HTYJDWJ7"},"agent_actions":{"view_html":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5","download_json":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5.json","view_paper":"https://pith.science/paper/HTYJDWJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.3304&json=true","fetch_graph":"https://pith.science/api/pith-number/HTYJDWJ7CJL5TEDILS4SL7OVT5/graph.json","fetch_events":"https://pith.science/api/pith-number/HTYJDWJ7CJL5TEDILS4SL7OVT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/action/storage_attestation","attest_author":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/action/author_attestation","sign_citation":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/action/citation_signature","submit_replication":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/action/replication_record"}},"created_at":"2026-05-18T02:24:16.418185+00:00","updated_at":"2026-05-18T02:24:16.418185+00:00"}