{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LRHIBTCOONMBWJWHSA3J2BWVTF","short_pith_number":"pith:LRHIBTCO","schema_version":"1.0","canonical_sha256":"5c4e80cc4e73581b26c790369d06d59943d7a905a4e5f3f7694e72c6a080ab1f","source":{"kind":"arxiv","id":"1701.05730","version":1},"attestation_state":"computed","paper":{"title":"Using LLVM-based JIT Compilation in Genetic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Juraj Spalek, Michal Gregor","submitted_at":"2017-01-20T09:17:52Z","abstract_excerpt":"The paper describes an approach to implementing genetic programming, which uses the LLVM library to just-in-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a parser (based on FlexC++ and BisonC++) that can construct the trees from a simple toy language with C-like syntax. The approach is compared with a previous implementation (based on direct execution of trees using polymorphic functors) in terms of execution speed."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.05730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-01-20T09:17:52Z","cross_cats_sorted":[],"title_canon_sha256":"fd8d3db872327a562ed3f5575a93473c132f25a5ca41a956e68cacce54e81ee1","abstract_canon_sha256":"d1320aac710b4fded3edfcadec37393dcdc06a06d1fe1e66e3d51c9563a98c94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:24.910840Z","signature_b64":"Eau2Xae9+FbTrBz2mhVPpb02owngnKrGdL/JDggbDgvnr8tBNJDL139273d05vBfS3QI4vq4yBIUjxmMVCu3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c4e80cc4e73581b26c790369d06d59943d7a905a4e5f3f7694e72c6a080ab1f","last_reissued_at":"2026-05-18T00:52:24.910148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:24.910148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using LLVM-based JIT Compilation in Genetic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Juraj Spalek, Michal Gregor","submitted_at":"2017-01-20T09:17:52Z","abstract_excerpt":"The paper describes an approach to implementing genetic programming, which uses the LLVM library to just-in-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a parser (based on FlexC++ and BisonC++) that can construct the trees from a simple toy language with C-like syntax. The approach is compared with a previous implementation (based on direct execution of trees using polymorphic functors) in terms of execution speed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05730","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.05730","created_at":"2026-05-18T00:52:24.910254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05730v1","created_at":"2026-05-18T00:52:24.910254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05730","created_at":"2026-05-18T00:52:24.910254+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRHIBTCOONMB","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRHIBTCOONMBWJWH","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRHIBTCO","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.08591","citing_title":"OpenMLDB: A Real-Time Relational Data Feature Computation System for Online ML","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LRHIBTCOONMBWJWHSA3J2BWVTF","json":"https://pith.science/pith/LRHIBTCOONMBWJWHSA3J2BWVTF.json","graph_json":"https://pith.science/api/pith-number/LRHIBTCOONMBWJWHSA3J2BWVTF/graph.json","events_json":"https://pith.science/api/pith-number/LRHIBTCOONMBWJWHSA3J2BWVTF/events.json","paper":"https://pith.science/paper/LRHIBTCO"},"agent_actions":{"view_html":"https://pith.science/pith/LRHIBTCOONMBWJWHSA3J2BWVTF","download_json":"https://pith.science/pith/LRHIBTCOONMBWJWHSA3J2BWVTF.json","view_paper":"https://pith.science/paper/LRHIBTCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05730&json=true","fetch_graph":"https://pith.science/api/pith-number/LRHIBTCOONMBWJWHSA3J2BWVTF/graph.json","fetch_events":"https://pith.science/api/pith-number/LRHIBTCOONMBWJWHSA3J2BWVTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRHIBTCOONMBWJWHSA3J2BWVTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRHIBTCOONMBWJWHSA3J2BWVTF/action/storage_attestation","attest_author":"https://pith.science/pith/LRHIBTCOONMBWJWHSA3J2BWVTF/action/author_attestation","sign_citation":"https://pith.science/pith/LRHIBTCOONMBWJWHSA3J2BWVTF/action/citation_signature","submit_replication":"https://pith.science/pith/LRHIBTCOONMBWJWHSA3J2BWVTF/action/replication_record"}},"created_at":"2026-05-18T00:52:24.910254+00:00","updated_at":"2026-05-18T00:52:24.910254+00:00"}