{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JCGANQ6TJQVOCZDEQV75ZCAG3Z","short_pith_number":"pith:JCGANQ6T","canonical_record":{"source":{"id":"1104.0848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-05T13:47:02Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0e90a0c5b562f42c227b51c9932882d1153db1d5d237358340bc43f73a9ed8e6","abstract_canon_sha256":"9cae9dde8b69eb2d181afbc28cffba233881bdcb0d574d8c0204e9ada948f774"},"schema_version":"1.0"},"canonical_sha256":"488c06c3d34c2ae16464857fdc8806de49f9e23fcf6fb3bebcc5a42a2480dbe0","source":{"kind":"arxiv","id":"1104.0848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0848","created_at":"2026-05-18T04:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0848v1","created_at":"2026-05-18T04:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0848","created_at":"2026-05-18T04:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"JCGANQ6TJQVO","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JCGANQ6TJQVOCZDE","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JCGANQ6T","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JCGANQ6TJQVOCZDEQV75ZCAG3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-05T13:47:02Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0e90a0c5b562f42c227b51c9932882d1153db1d5d237358340bc43f73a9ed8e6","abstract_canon_sha256":"9cae9dde8b69eb2d181afbc28cffba233881bdcb0d574d8c0204e9ada948f774"},"schema_version":"1.0"},"canonical_sha256":"488c06c3d34c2ae16464857fdc8806de49f9e23fcf6fb3bebcc5a42a2480dbe0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:02.390224Z","signature_b64":"YfgFgm9zTXLEFa73g41wuU+FMqPG5jVPj7SuN5uLbshTY9l+sExvfRTiXKk8gprz67wUywUTV14WLwJ7ieEQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"488c06c3d34c2ae16464857fdc8806de49f9e23fcf6fb3bebcc5a42a2480dbe0","last_reissued_at":"2026-05-18T04:25:02.389777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:02.389777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0848","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-18T04:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1eEQUIdrIkcPZwdDq1sR5PCDUQLPwz72AwMlMFMg9MW88BoHSPR5mlLzqlnpNwP3jDRsL8Nd6A4GIJ/7gDBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:59:59.660557Z"},"content_sha256":"1e563a9ac41e416e2ad69e66b26be6de8f6881f1c93be1e00de00dc2fe5d08e3","schema_version":"1.0","event_id":"sha256:1e563a9ac41e416e2ad69e66b26be6de8f6881f1c93be1e00de00dc2fe5d08e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JCGANQ6TJQVOCZDEQV75ZCAG3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming algorithms for language recognition problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Ajesh Babu, Girish Varma, Jaikumar Radhakrishnan, Nutan Limaye","submitted_at":"2011-04-05T13:47:02Z","abstract_excerpt":"We study the complexity of the following problems in the streaming model.\n  Membership testing for \\DLIN We show that every language in \\DLIN\\ can be recognised by a randomized one-pass $O(\\log n)$ space algorithm with inverse polynomial one-sided error, and by a deterministic p-pass $O(n/p)$ space algorithm. We show that these algorithms are optimal.\n  Membership testing for \\LL$(k)$ For languages generated by \\LL$(k)$ grammars with a bound of $r$ on the number of nonterminals at any stage in the left-most derivation, we show that membership can be tested by a randomized one-pass $O(r\\log n)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0848","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-18T04:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Th9AYIJ57Yma51BWxuek07y38hMRzTXnPqmosz2sShx5oHxx4NtHssqjjepbWjC1tJEeM9r+0okiUwk2Y8l1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:59:59.661058Z"},"content_sha256":"c855644c45fc5d2d883a8e2c510862260142197171d79c761e7550119a8441c8","schema_version":"1.0","event_id":"sha256:c855644c45fc5d2d883a8e2c510862260142197171d79c761e7550119a8441c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCGANQ6TJQVOCZDEQV75ZCAG3Z/bundle.json","state_url":"https://pith.science/pith/JCGANQ6TJQVOCZDEQV75ZCAG3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCGANQ6TJQVOCZDEQV75ZCAG3Z/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-26T13:59:59Z","links":{"resolver":"https://pith.science/pith/JCGANQ6TJQVOCZDEQV75ZCAG3Z","bundle":"https://pith.science/pith/JCGANQ6TJQVOCZDEQV75ZCAG3Z/bundle.json","state":"https://pith.science/pith/JCGANQ6TJQVOCZDEQV75ZCAG3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCGANQ6TJQVOCZDEQV75ZCAG3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JCGANQ6TJQVOCZDEQV75ZCAG3Z","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":"9cae9dde8b69eb2d181afbc28cffba233881bdcb0d574d8c0204e9ada948f774","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-05T13:47:02Z","title_canon_sha256":"0e90a0c5b562f42c227b51c9932882d1153db1d5d237358340bc43f73a9ed8e6"},"schema_version":"1.0","source":{"id":"1104.0848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0848","created_at":"2026-05-18T04:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0848v1","created_at":"2026-05-18T04:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0848","created_at":"2026-05-18T04:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"JCGANQ6TJQVO","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JCGANQ6TJQVOCZDE","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JCGANQ6T","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:c855644c45fc5d2d883a8e2c510862260142197171d79c761e7550119a8441c8","target":"graph","created_at":"2026-05-18T04:25:02Z","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":"We study the complexity of the following problems in the streaming model.\n  Membership testing for \\DLIN We show that every language in \\DLIN\\ can be recognised by a randomized one-pass $O(\\log n)$ space algorithm with inverse polynomial one-sided error, and by a deterministic p-pass $O(n/p)$ space algorithm. We show that these algorithms are optimal.\n  Membership testing for \\LL$(k)$ For languages generated by \\LL$(k)$ grammars with a bound of $r$ on the number of nonterminals at any stage in the left-most derivation, we show that membership can be tested by a randomized one-pass $O(r\\log n)$","authors_text":"Ajesh Babu, Girish Varma, Jaikumar Radhakrishnan, Nutan Limaye","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-05T13:47:02Z","title":"Streaming algorithms for language recognition problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0848","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:1e563a9ac41e416e2ad69e66b26be6de8f6881f1c93be1e00de00dc2fe5d08e3","target":"record","created_at":"2026-05-18T04:25:02Z","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":"9cae9dde8b69eb2d181afbc28cffba233881bdcb0d574d8c0204e9ada948f774","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-05T13:47:02Z","title_canon_sha256":"0e90a0c5b562f42c227b51c9932882d1153db1d5d237358340bc43f73a9ed8e6"},"schema_version":"1.0","source":{"id":"1104.0848","kind":"arxiv","version":1}},"canonical_sha256":"488c06c3d34c2ae16464857fdc8806de49f9e23fcf6fb3bebcc5a42a2480dbe0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"488c06c3d34c2ae16464857fdc8806de49f9e23fcf6fb3bebcc5a42a2480dbe0","first_computed_at":"2026-05-18T04:25:02.389777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:02.389777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YfgFgm9zTXLEFa73g41wuU+FMqPG5jVPj7SuN5uLbshTY9l+sExvfRTiXKk8gprz67wUywUTV14WLwJ7ieEQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:02.390224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e563a9ac41e416e2ad69e66b26be6de8f6881f1c93be1e00de00dc2fe5d08e3","sha256:c855644c45fc5d2d883a8e2c510862260142197171d79c761e7550119a8441c8"],"state_sha256":"32ec81071aad9ab00b53613e0ef3a5678899265e17bcd8b36ac0434dfe0c18e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xi4HUhlAAVgLt2hwot3PGHx2WHjZaucD/BTa6plZw1vCZdzzFObr20r+enSL0ElD3mOlyjHACFFmlkLm4bY0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:59:59.663905Z","bundle_sha256":"adb5e9be5df70cd586bf50690c7b62946616040a34e75f5fec7d12aef695f685"}}