{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YKQPNPILDOMHV7MF6IHEZ26AM7","short_pith_number":"pith:YKQPNPIL","canonical_record":{"source":{"id":"1603.08059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-03-26T00:25:37Z","cross_cats_sorted":[],"title_canon_sha256":"238cc86e9c15d75243ca06868bd977cc4ef37d4f1d3847619679990a20a10706","abstract_canon_sha256":"018002732a17529814845cbe0778d9ce99c76b832d678bb3ac3d944597e62b42"},"schema_version":"1.0"},"canonical_sha256":"c2a0f6bd0b1b987afd85f20e4cebc067cc550e8c7f936e244916fea997f48901","source":{"kind":"arxiv","id":"1603.08059","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08059","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08059v2","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08059","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"YKQPNPILDOMH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YKQPNPILDOMHV7MF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YKQPNPIL","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YKQPNPILDOMHV7MF6IHEZ26AM7","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-03-26T00:25:37Z","cross_cats_sorted":[],"title_canon_sha256":"238cc86e9c15d75243ca06868bd977cc4ef37d4f1d3847619679990a20a10706","abstract_canon_sha256":"018002732a17529814845cbe0778d9ce99c76b832d678bb3ac3d944597e62b42"},"schema_version":"1.0"},"canonical_sha256":"c2a0f6bd0b1b987afd85f20e4cebc067cc550e8c7f936e244916fea997f48901","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:08.821246Z","signature_b64":"lkSpbyTA5lXVmfMEJUKWNG0NM4ErjM7pl/fTnMdpz/Zokr2fWzPt+n47r7Cr7HQBssV3AQtAwWgsv7i6zs/5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2a0f6bd0b1b987afd85f20e4cebc067cc550e8c7f936e244916fea997f48901","last_reissued_at":"2026-05-18T00:26:08.820539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:08.820539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08059","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:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qo30dsLsZbnyEWvXWLtfwYZQ+B/vzvrKHXqGMpTWSoAT+o0Rip2SnlTEVoF1/2HT0+14uj8/yuhGEkZyd2KlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:50:05.620293Z"},"content_sha256":"9b8800e23834403a2cb2495a221d98ffab6625ac34e042478a5c580700212d28","schema_version":"1.0","event_id":"sha256:9b8800e23834403a2cb2495a221d98ffab6625ac34e042478a5c580700212d28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YKQPNPILDOMHV7MF6IHEZ26AM7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CVC Verilog Compiler -- Fast Complex Language Compilers Can be Simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Steven Meyer","submitted_at":"2016-03-26T00:25:37Z","abstract_excerpt":"This paper explains how to develop Verilog hardware description language (HDL) optimized flow graph compiled simulators. It is claimed that the methods and algorithms described here can be applied in the development of flow graph compilers for other complex computer languages. The method uses the von Neumann computer architecture (MRAM model) as the best abstract model of computation and uses comparison and selection of alternative machine code sequences to utilize modern processor low level parallelism. By using the anti formalist method described here, the fastest available full IEEE 1364 20"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08059","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:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJZuELUfwuCDpIbEi2C8EPaY1DUhVFkkIePbtUb3PvPd4PDyhS1k60hfTIJtek2VJDWNog9pBgWYPzq//AkvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:50:05.631431Z"},"content_sha256":"557648866cad6d9ad200137ed44dc68bb9852b7cbab1800885d0b817702c4ad2","schema_version":"1.0","event_id":"sha256:557648866cad6d9ad200137ed44dc68bb9852b7cbab1800885d0b817702c4ad2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKQPNPILDOMHV7MF6IHEZ26AM7/bundle.json","state_url":"https://pith.science/pith/YKQPNPILDOMHV7MF6IHEZ26AM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKQPNPILDOMHV7MF6IHEZ26AM7/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-08-11T00:50:05Z","links":{"resolver":"https://pith.science/pith/YKQPNPILDOMHV7MF6IHEZ26AM7","bundle":"https://pith.science/pith/YKQPNPILDOMHV7MF6IHEZ26AM7/bundle.json","state":"https://pith.science/pith/YKQPNPILDOMHV7MF6IHEZ26AM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKQPNPILDOMHV7MF6IHEZ26AM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YKQPNPILDOMHV7MF6IHEZ26AM7","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":"018002732a17529814845cbe0778d9ce99c76b832d678bb3ac3d944597e62b42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-03-26T00:25:37Z","title_canon_sha256":"238cc86e9c15d75243ca06868bd977cc4ef37d4f1d3847619679990a20a10706"},"schema_version":"1.0","source":{"id":"1603.08059","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08059","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08059v2","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08059","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"YKQPNPILDOMH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YKQPNPILDOMHV7MF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YKQPNPIL","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:557648866cad6d9ad200137ed44dc68bb9852b7cbab1800885d0b817702c4ad2","target":"graph","created_at":"2026-05-18T00:26:08Z","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 explains how to develop Verilog hardware description language (HDL) optimized flow graph compiled simulators. It is claimed that the methods and algorithms described here can be applied in the development of flow graph compilers for other complex computer languages. The method uses the von Neumann computer architecture (MRAM model) as the best abstract model of computation and uses comparison and selection of alternative machine code sequences to utilize modern processor low level parallelism. By using the anti formalist method described here, the fastest available full IEEE 1364 20","authors_text":"Steven Meyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-03-26T00:25:37Z","title":"CVC Verilog Compiler -- Fast Complex Language Compilers Can be Simple"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08059","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:9b8800e23834403a2cb2495a221d98ffab6625ac34e042478a5c580700212d28","target":"record","created_at":"2026-05-18T00:26:08Z","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":"018002732a17529814845cbe0778d9ce99c76b832d678bb3ac3d944597e62b42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-03-26T00:25:37Z","title_canon_sha256":"238cc86e9c15d75243ca06868bd977cc4ef37d4f1d3847619679990a20a10706"},"schema_version":"1.0","source":{"id":"1603.08059","kind":"arxiv","version":2}},"canonical_sha256":"c2a0f6bd0b1b987afd85f20e4cebc067cc550e8c7f936e244916fea997f48901","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2a0f6bd0b1b987afd85f20e4cebc067cc550e8c7f936e244916fea997f48901","first_computed_at":"2026-05-18T00:26:08.820539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:08.820539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lkSpbyTA5lXVmfMEJUKWNG0NM4ErjM7pl/fTnMdpz/Zokr2fWzPt+n47r7Cr7HQBssV3AQtAwWgsv7i6zs/5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:08.821246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08059","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b8800e23834403a2cb2495a221d98ffab6625ac34e042478a5c580700212d28","sha256:557648866cad6d9ad200137ed44dc68bb9852b7cbab1800885d0b817702c4ad2"],"state_sha256":"dfa085fa03058b3f25b32bba1285831fe6b42538afb3e0e6d9c38d5df08ce29b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5gfQahgiuhOdoMfqTg5zA5uBU4z6oD/dJYHD039zfw07dyFGjPqUrONSHW2TLfKBM6dGKJoKAxbTZAcL9iaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T00:50:05.638686Z","bundle_sha256":"a508d3998fd2b2feb4c1ff8b6ae6f602d68e664a5bb666c19b0a37430dfcaa4e"}}