{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HTYJDWJ7CJL5TEDILS4SL7OVT5","short_pith_number":"pith:HTYJDWJ7","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"},"canonical_sha256":"3cf091d93f1257d990685cb925fdd59f57db5854ad09a8cf86b53e111667f772","source":{"kind":"arxiv","id":"1004.3304","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3304","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3304v1","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3304","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"HTYJDWJ7CJL5","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HTYJDWJ7CJL5TEDI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HTYJDWJ7","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HTYJDWJ7CJL5TEDILS4SL7OVT5","target":"record","payload":{"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"},"canonical_sha256":"3cf091d93f1257d990685cb925fdd59f57db5854ad09a8cf86b53e111667f772","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"},"source_kind":"arxiv","source_id":"1004.3304","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8jZdLf8LKkBHksvnFwpYaWCRLpLSPhhjyG039kN1DTKFhG/rkl66BeLyu96GmTm9eCT+zg1vaowWx3Y2tgCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:01:34.352342Z"},"content_sha256":"9f6c19d129b30451b1fc6a5edb07da379f69a8057187c5a8cbc745540bc45185","schema_version":"1.0","event_id":"sha256:9f6c19d129b30451b1fc6a5edb07da379f69a8057187c5a8cbc745540bc45185"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HTYJDWJ7CJL5TEDILS4SL7OVT5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DfMluP/MGwWrhApZRDC5sl8z1sAuRBhAJOS1Zx6OEN4LJtCFZOu1VUgP+Uc2H3Hy/Kjp+JAyXNnuI6ODYI0vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:01:34.352705Z"},"content_sha256":"58ce92f109df4d98db9c42bffd6d55da3919fb2bcfbad604b0f76c1e737cd0b5","schema_version":"1.0","event_id":"sha256:58ce92f109df4d98db9c42bffd6d55da3919fb2bcfbad604b0f76c1e737cd0b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/bundle.json","state_url":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T05:01:34Z","links":{"resolver":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5","bundle":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/bundle.json","state":"https://pith.science/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTYJDWJ7CJL5TEDILS4SL7OVT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HTYJDWJ7CJL5TEDILS4SL7OVT5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"084e5074096317fa7aea4049474fdd0792a26683491d96fcf025dd4b8c2d4039","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-19T20:51:06Z","title_canon_sha256":"303942971135920abb226a04a8e8b48e3664979928fc4550a1690d9bd999e776"},"schema_version":"1.0","source":{"id":"1004.3304","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3304","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3304v1","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3304","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"HTYJDWJ7CJL5","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HTYJDWJ7CJL5TEDI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HTYJDWJ7","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:58ce92f109df4d98db9c42bffd6d55da3919fb2bcfbad604b0f76c1e737cd0b5","target":"graph","created_at":"2026-05-18T02:24:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amit Chakrabarti, Andrew McGregor, Graham Cormode, Ranganath Kondapally","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-19T20:51:06Z","title":"Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3304","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9f6c19d129b30451b1fc6a5edb07da379f69a8057187c5a8cbc745540bc45185","target":"record","created_at":"2026-05-18T02:24:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"084e5074096317fa7aea4049474fdd0792a26683491d96fcf025dd4b8c2d4039","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-19T20:51:06Z","title_canon_sha256":"303942971135920abb226a04a8e8b48e3664979928fc4550a1690d9bd999e776"},"schema_version":"1.0","source":{"id":"1004.3304","kind":"arxiv","version":1}},"canonical_sha256":"3cf091d93f1257d990685cb925fdd59f57db5854ad09a8cf86b53e111667f772","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cf091d93f1257d990685cb925fdd59f57db5854ad09a8cf86b53e111667f772","first_computed_at":"2026-05-18T02:24:16.418059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:16.418059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Asyi4TDOaCcGibHhSDZYUAbGw+0kGNXvF6TajUalQlyugmv5kdaMGkted8mPxr7P6j3/8pyzNTnLWG3Rw/ukCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:16.418787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.3304","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f6c19d129b30451b1fc6a5edb07da379f69a8057187c5a8cbc745540bc45185","sha256:58ce92f109df4d98db9c42bffd6d55da3919fb2bcfbad604b0f76c1e737cd0b5"],"state_sha256":"284ae49eee363b7ad994a59302a625a7b60cffdeb33a62ec2bbf0784447feb05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1TIT6JEJ3B/A4TH1RMH0gahTjnsgSz1wSPVK7ZNFJnrfoRgNjIZT/TMmYegNN7ImXOwasOSdBS3j9xmRXEmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:01:34.354721Z","bundle_sha256":"a67f18fe5d3999f1e53f23b3b211f40fc3d8e3d3eb5adec67942958b3f185b37"}}