{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VJKKQU6YDRQ7IMNVMIUN33PX5Q","short_pith_number":"pith:VJKKQU6Y","canonical_record":{"source":{"id":"1509.08068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-27T08:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"1713c6c6899405c74dedc35c9cf13b70cac6d2c3ed6b2201054f1ddc1345ea96","abstract_canon_sha256":"926c67546f32732ea6d0fa892a9d9791fd638a7ca3baa0f85a22a2c6bd464ebb"},"schema_version":"1.0"},"canonical_sha256":"aa54a853d81c61f431b56228ddedf7ec065fa0e5ffb7719fc28e6b32d057fe67","source":{"kind":"arxiv","id":"1509.08068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08068","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08068v1","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08068","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"VJKKQU6YDRQ7","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VJKKQU6YDRQ7IMNV","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VJKKQU6Y","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VJKKQU6YDRQ7IMNVMIUN33PX5Q","target":"record","payload":{"canonical_record":{"source":{"id":"1509.08068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-27T08:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"1713c6c6899405c74dedc35c9cf13b70cac6d2c3ed6b2201054f1ddc1345ea96","abstract_canon_sha256":"926c67546f32732ea6d0fa892a9d9791fd638a7ca3baa0f85a22a2c6bd464ebb"},"schema_version":"1.0"},"canonical_sha256":"aa54a853d81c61f431b56228ddedf7ec065fa0e5ffb7719fc28e6b32d057fe67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:54.799365Z","signature_b64":"OPXwK+KQSN9IG5aHBiPGLl45u747xK1QXE4q03BLam3O0TQ5csefWC0JGOMpymPROg8ri6se1hZS+yvVuNegDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa54a853d81c61f431b56228ddedf7ec065fa0e5ffb7719fc28e6b32d057fe67","last_reissued_at":"2026-05-18T01:31:54.798907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:54.798907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.08068","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-18T01:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9BiR4Zq+mNcyJwuK/ZkLfhm7wQJX57TcMqzfuOm45zNJBEvURSX0qVuTVRpgwUtbRUMJqiK4eA9qEi7vRi4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:12:39.714249Z"},"content_sha256":"e9fca32aabb6584e5f796de47ef5653be91efa3ab179feb4ce11f026ee69fcda","schema_version":"1.0","event_id":"sha256:e9fca32aabb6584e5f796de47ef5653be91efa3ab179feb4ce11f026ee69fcda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VJKKQU6YDRQ7IMNVMIUN33PX5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block-Level Parallelism in Parsing Block Structured Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Abhinav Jangda","submitted_at":"2015-09-27T08:38:37Z","abstract_excerpt":"Softwares source code is becoming large and complex. Compilation of large base code is a time consuming process. Parallel compilation of code will help in reducing the time complexity. Parsing is one of the phases in compiler in which significant amount of time of compilation is spent. Techniques have already been developed to extract the parallelism available in parser. Current LR(k) parallel parsing techniques either face difficulty in creating Abstract Syntax Tree or requires modification in the grammar or are specific to less expressive grammars. Most of the programming languages like C, A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08068","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-18T01:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23iTzBjfFp0yYa3tku/aIgfnCPbKenW7cpybkG6kFLVbH+z1FFjSn0ClwXkT8ep/MFwqe1L5EXoHUKuDMynhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:12:39.714663Z"},"content_sha256":"23cf618e26223a5b4d4aad8562e7d6b3af205bde96fa2332650557d5e5969304","schema_version":"1.0","event_id":"sha256:23cf618e26223a5b4d4aad8562e7d6b3af205bde96fa2332650557d5e5969304"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJKKQU6YDRQ7IMNVMIUN33PX5Q/bundle.json","state_url":"https://pith.science/pith/VJKKQU6YDRQ7IMNVMIUN33PX5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJKKQU6YDRQ7IMNVMIUN33PX5Q/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-06-03T07:12:39Z","links":{"resolver":"https://pith.science/pith/VJKKQU6YDRQ7IMNVMIUN33PX5Q","bundle":"https://pith.science/pith/VJKKQU6YDRQ7IMNVMIUN33PX5Q/bundle.json","state":"https://pith.science/pith/VJKKQU6YDRQ7IMNVMIUN33PX5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJKKQU6YDRQ7IMNVMIUN33PX5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VJKKQU6YDRQ7IMNVMIUN33PX5Q","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":"926c67546f32732ea6d0fa892a9d9791fd638a7ca3baa0f85a22a2c6bd464ebb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-27T08:38:37Z","title_canon_sha256":"1713c6c6899405c74dedc35c9cf13b70cac6d2c3ed6b2201054f1ddc1345ea96"},"schema_version":"1.0","source":{"id":"1509.08068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08068","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08068v1","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08068","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"VJKKQU6YDRQ7","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VJKKQU6YDRQ7IMNV","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VJKKQU6Y","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:23cf618e26223a5b4d4aad8562e7d6b3af205bde96fa2332650557d5e5969304","target":"graph","created_at":"2026-05-18T01:31:54Z","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":"Softwares source code is becoming large and complex. Compilation of large base code is a time consuming process. Parallel compilation of code will help in reducing the time complexity. Parsing is one of the phases in compiler in which significant amount of time of compilation is spent. Techniques have already been developed to extract the parallelism available in parser. Current LR(k) parallel parsing techniques either face difficulty in creating Abstract Syntax Tree or requires modification in the grammar or are specific to less expressive grammars. Most of the programming languages like C, A","authors_text":"Abhinav Jangda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-27T08:38:37Z","title":"Block-Level Parallelism in Parsing Block Structured Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08068","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:e9fca32aabb6584e5f796de47ef5653be91efa3ab179feb4ce11f026ee69fcda","target":"record","created_at":"2026-05-18T01:31:54Z","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":"926c67546f32732ea6d0fa892a9d9791fd638a7ca3baa0f85a22a2c6bd464ebb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-09-27T08:38:37Z","title_canon_sha256":"1713c6c6899405c74dedc35c9cf13b70cac6d2c3ed6b2201054f1ddc1345ea96"},"schema_version":"1.0","source":{"id":"1509.08068","kind":"arxiv","version":1}},"canonical_sha256":"aa54a853d81c61f431b56228ddedf7ec065fa0e5ffb7719fc28e6b32d057fe67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa54a853d81c61f431b56228ddedf7ec065fa0e5ffb7719fc28e6b32d057fe67","first_computed_at":"2026-05-18T01:31:54.798907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:54.798907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OPXwK+KQSN9IG5aHBiPGLl45u747xK1QXE4q03BLam3O0TQ5csefWC0JGOMpymPROg8ri6se1hZS+yvVuNegDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:54.799365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9fca32aabb6584e5f796de47ef5653be91efa3ab179feb4ce11f026ee69fcda","sha256:23cf618e26223a5b4d4aad8562e7d6b3af205bde96fa2332650557d5e5969304"],"state_sha256":"bc9930e0e0b6fc7a4e12cccd6d929aa0fee763fae95dd669781ab532005eeeb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAiktzuvtld7CivMERxRnLfAV8e8mZ9CFhXoMG4xqh0i5dFd7skm6Hrb7RFyllQeXbYEoYmJ57VCktwngnv3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:12:39.716614Z","bundle_sha256":"917ada085019ba5bb94dcd6bc275a91f386521f0751314a7b681f57b818d15f9"}}