{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:P4HEUHEI4O7TYFSCDZK7YZUPWU","short_pith_number":"pith:P4HEUHEI","canonical_record":{"source":{"id":"1310.2823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-09T05:15:28Z","cross_cats_sorted":[],"title_canon_sha256":"1aabde6b425fe3d9b29ecfd7ab9545a1e8719e37b6178cee3cb5ff584167bbe6","abstract_canon_sha256":"d77b18606462cbb738142152a2eba4142203b4b632922b5d4389000bea9a86d5"},"schema_version":"1.0"},"canonical_sha256":"7f0e4a1c88e3bf3c16421e55fc668fb5028e1205219afdcb62a87943ec561d3e","source":{"kind":"arxiv","id":"1310.2823","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2823","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2823v2","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2823","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"P4HEUHEI4O7T","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P4HEUHEI4O7TYFSC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P4HEUHEI","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:P4HEUHEI4O7TYFSCDZK7YZUPWU","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-09T05:15:28Z","cross_cats_sorted":[],"title_canon_sha256":"1aabde6b425fe3d9b29ecfd7ab9545a1e8719e37b6178cee3cb5ff584167bbe6","abstract_canon_sha256":"d77b18606462cbb738142152a2eba4142203b4b632922b5d4389000bea9a86d5"},"schema_version":"1.0"},"canonical_sha256":"7f0e4a1c88e3bf3c16421e55fc668fb5028e1205219afdcb62a87943ec561d3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:58.819330Z","signature_b64":"5WNLU0av4JqJMeW+lhekOgcZUCM7dKr/XcaVar71wrJAA4AdSlBKlgGQtxvZRRN8vC8kiMwnyjLm2PpH03hTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f0e4a1c88e3bf3c16421e55fc668fb5028e1205219afdcb62a87943ec561d3e","last_reissued_at":"2026-05-18T00:37:58.818802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:58.818802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2823","source_version":2,"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-18T00:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdxLdE6V5gqVZqExatXWWx4MnlE347QtCvWTBJlNOzr+TKuuUbr/Nn6Gk0rQBpxa+230WSanjJWy5siRkLXtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:24:56.208516Z"},"content_sha256":"7785fb03a4fffe1c5c1dbfca22f04c7938cdfdeeb2b4ec9d7c3e30d38f7a1fde","schema_version":"1.0","event_id":"sha256:7785fb03a4fffe1c5c1dbfca22f04c7938cdfdeeb2b4ec9d7c3e30d38f7a1fde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:P4HEUHEI4O7TYFSCDZK7YZUPWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Introduction to Functional Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Abhinav Aggarwal","submitted_at":"2013-10-09T05:15:28Z","abstract_excerpt":"Formal grammars are extensively used in Computer Science and related fields to study the rules which govern production of a language. The use of these grammars can be extended beyond mere language production. One possibility is to view these grammars as logical machines, similar to automata, which can be modified to compute or help in computation, while also performing the basic task of language production. The difference between such a modified grammar and an automaton will then lie in the semantics of computation performed. It is even possible for such a grammar to appear non-functional (whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2823","kind":"arxiv","version":2},"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-18T00:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3OJTA4fcfqbf/yIOpLgWfCTCTsp3LFwZs2WF7Dx4pAL/VxvCSkaBR1oGLwPlOAhlFkXOPD8ygmqLkaJga0hDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:24:56.209047Z"},"content_sha256":"f86da7a0f37456c679e5657f480b18a6142b6cd62bc926fff9eb9131f0f2f67d","schema_version":"1.0","event_id":"sha256:f86da7a0f37456c679e5657f480b18a6142b6cd62bc926fff9eb9131f0f2f67d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4HEUHEI4O7TYFSCDZK7YZUPWU/bundle.json","state_url":"https://pith.science/pith/P4HEUHEI4O7TYFSCDZK7YZUPWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4HEUHEI4O7TYFSCDZK7YZUPWU/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-26T03:24:56Z","links":{"resolver":"https://pith.science/pith/P4HEUHEI4O7TYFSCDZK7YZUPWU","bundle":"https://pith.science/pith/P4HEUHEI4O7TYFSCDZK7YZUPWU/bundle.json","state":"https://pith.science/pith/P4HEUHEI4O7TYFSCDZK7YZUPWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4HEUHEI4O7TYFSCDZK7YZUPWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:P4HEUHEI4O7TYFSCDZK7YZUPWU","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":"d77b18606462cbb738142152a2eba4142203b4b632922b5d4389000bea9a86d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-09T05:15:28Z","title_canon_sha256":"1aabde6b425fe3d9b29ecfd7ab9545a1e8719e37b6178cee3cb5ff584167bbe6"},"schema_version":"1.0","source":{"id":"1310.2823","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2823","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2823v2","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2823","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"P4HEUHEI4O7T","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P4HEUHEI4O7TYFSC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P4HEUHEI","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:f86da7a0f37456c679e5657f480b18a6142b6cd62bc926fff9eb9131f0f2f67d","target":"graph","created_at":"2026-05-18T00:37:58Z","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":"Formal grammars are extensively used in Computer Science and related fields to study the rules which govern production of a language. The use of these grammars can be extended beyond mere language production. One possibility is to view these grammars as logical machines, similar to automata, which can be modified to compute or help in computation, while also performing the basic task of language production. The difference between such a modified grammar and an automaton will then lie in the semantics of computation performed. It is even possible for such a grammar to appear non-functional (whe","authors_text":"Abhinav Aggarwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-09T05:15:28Z","title":"Introduction to Functional Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2823","kind":"arxiv","version":2},"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:7785fb03a4fffe1c5c1dbfca22f04c7938cdfdeeb2b4ec9d7c3e30d38f7a1fde","target":"record","created_at":"2026-05-18T00:37:58Z","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":"d77b18606462cbb738142152a2eba4142203b4b632922b5d4389000bea9a86d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-09T05:15:28Z","title_canon_sha256":"1aabde6b425fe3d9b29ecfd7ab9545a1e8719e37b6178cee3cb5ff584167bbe6"},"schema_version":"1.0","source":{"id":"1310.2823","kind":"arxiv","version":2}},"canonical_sha256":"7f0e4a1c88e3bf3c16421e55fc668fb5028e1205219afdcb62a87943ec561d3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f0e4a1c88e3bf3c16421e55fc668fb5028e1205219afdcb62a87943ec561d3e","first_computed_at":"2026-05-18T00:37:58.818802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:58.818802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5WNLU0av4JqJMeW+lhekOgcZUCM7dKr/XcaVar71wrJAA4AdSlBKlgGQtxvZRRN8vC8kiMwnyjLm2PpH03hTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:58.819330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2823","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7785fb03a4fffe1c5c1dbfca22f04c7938cdfdeeb2b4ec9d7c3e30d38f7a1fde","sha256:f86da7a0f37456c679e5657f480b18a6142b6cd62bc926fff9eb9131f0f2f67d"],"state_sha256":"58d5978754826982f59e986951904cdc2962ba808370892a0b780e399df1c86a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gfmUfN/lr1kj5cYzsamwNgA3I8kvHTOgnZCGiKFVRMCOTgcRvjAzmMqNiXLjHCnLWw4MQpoai8DG56BvytICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:24:56.211839Z","bundle_sha256":"7ece82a03806d4c528945b466510750e7bcbdfa6b81486884ba394221c1db17d"}}