{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3LQKIOSTDSSTB4J7CJ5CBPFCOW","short_pith_number":"pith:3LQKIOST","canonical_record":{"source":{"id":"2410.08137","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2024-10-10T17:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"974618221f6014a937030931b954227d56235978801563b5acb053c1838cd244","abstract_canon_sha256":"33a4bf4f45b34ca9889c5859241b2ccd7a78307f8415dd453253d9afb20fbde4"},"schema_version":"1.0"},"canonical_sha256":"dae0a43a531ca530f13f127a20bca275902c9570cfe18259d04011e77bf874af","source":{"kind":"arxiv","id":"2410.08137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.08137","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"arxiv_version","alias_value":"2410.08137v1","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08137","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"pith_short_12","alias_value":"3LQKIOSTDSST","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"pith_short_16","alias_value":"3LQKIOSTDSSTB4J7","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"pith_short_8","alias_value":"3LQKIOST","created_at":"2026-07-05T09:18:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3LQKIOSTDSSTB4J7CJ5CBPFCOW","target":"record","payload":{"canonical_record":{"source":{"id":"2410.08137","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2024-10-10T17:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"974618221f6014a937030931b954227d56235978801563b5acb053c1838cd244","abstract_canon_sha256":"33a4bf4f45b34ca9889c5859241b2ccd7a78307f8415dd453253d9afb20fbde4"},"schema_version":"1.0"},"canonical_sha256":"dae0a43a531ca530f13f127a20bca275902c9570cfe18259d04011e77bf874af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:49.083715Z","signature_b64":"Up1CRwkllkIzuhoyINXUj8nNPmFIqSWRQTfZWxe6pOJ79brQfPKL8MNUldQoWMfqUHfTZ7dsrm6ZZZ/DTBPcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dae0a43a531ca530f13f127a20bca275902c9570cfe18259d04011e77bf874af","last_reissued_at":"2026-07-05T09:18:49.083250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:49.083250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.08137","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-07-05T09:18:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UZDUX9H2zmnLKXX3KUFYQAfbsUkul4ILUIR4Ha6pDejvgIbTplKDU1HkXdobarRobhQ1oyWhRFgG25m8YnJZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:49:05.975502Z"},"content_sha256":"5cbae01056bbb49d45ba263d0160044ad2a58619abc6727ed2c12d4fd1edd94b","schema_version":"1.0","event_id":"sha256:5cbae01056bbb49d45ba263d0160044ad2a58619abc6727ed2c12d4fd1edd94b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3LQKIOSTDSSTB4J7CJ5CBPFCOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Fixed-Depth Prefix and Postfix Symbolic Regression Grammars","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Edward Finkelstein","submitted_at":"2024-10-10T17:21:32Z","abstract_excerpt":"We develop faultless, fixed-depth, string-based, prefix and postfix symbolic regression grammars, capable of producing \\emph{any} expression from a set of operands, unary operators and/or binary operators. Using these grammars, we outline simplified forms of 5 popular heuristic search strategies: Brute Force Search, Monte Carlo Tree Search, Particle Swarm Optimization, Genetic Programming, and Simulated Annealing. For each algorithm, we compare the relative performance of prefix vs postfix for ten ground-truth expressions implemented entirely within a common C++/Eigen framework. Our experiment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08137","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.08137/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:18:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pA/CjKHRuLRCtRhF6jRvkq/tN94MXMCpiUXZCapyiXhl5w+oQkptpxmbIDMoFZaDkwrIPD2MwBBeAPgm7H/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:49:05.976016Z"},"content_sha256":"cff4d0eb6e5f3755d30a7b2737e5662a949e92111a04ca3720c8008f1a19ead1","schema_version":"1.0","event_id":"sha256:cff4d0eb6e5f3755d30a7b2737e5662a949e92111a04ca3720c8008f1a19ead1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LQKIOSTDSSTB4J7CJ5CBPFCOW/bundle.json","state_url":"https://pith.science/pith/3LQKIOSTDSSTB4J7CJ5CBPFCOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LQKIOSTDSSTB4J7CJ5CBPFCOW/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-05T06:49:05Z","links":{"resolver":"https://pith.science/pith/3LQKIOSTDSSTB4J7CJ5CBPFCOW","bundle":"https://pith.science/pith/3LQKIOSTDSSTB4J7CJ5CBPFCOW/bundle.json","state":"https://pith.science/pith/3LQKIOSTDSSTB4J7CJ5CBPFCOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LQKIOSTDSSTB4J7CJ5CBPFCOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3LQKIOSTDSSTB4J7CJ5CBPFCOW","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":"33a4bf4f45b34ca9889c5859241b2ccd7a78307f8415dd453253d9afb20fbde4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2024-10-10T17:21:32Z","title_canon_sha256":"974618221f6014a937030931b954227d56235978801563b5acb053c1838cd244"},"schema_version":"1.0","source":{"id":"2410.08137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.08137","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"arxiv_version","alias_value":"2410.08137v1","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08137","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"pith_short_12","alias_value":"3LQKIOSTDSST","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"pith_short_16","alias_value":"3LQKIOSTDSSTB4J7","created_at":"2026-07-05T09:18:49Z"},{"alias_kind":"pith_short_8","alias_value":"3LQKIOST","created_at":"2026-07-05T09:18:49Z"}],"graph_snapshots":[{"event_id":"sha256:cff4d0eb6e5f3755d30a7b2737e5662a949e92111a04ca3720c8008f1a19ead1","target":"graph","created_at":"2026-07-05T09:18:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.08137/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop faultless, fixed-depth, string-based, prefix and postfix symbolic regression grammars, capable of producing \\emph{any} expression from a set of operands, unary operators and/or binary operators. Using these grammars, we outline simplified forms of 5 popular heuristic search strategies: Brute Force Search, Monte Carlo Tree Search, Particle Swarm Optimization, Genetic Programming, and Simulated Annealing. For each algorithm, we compare the relative performance of prefix vs postfix for ten ground-truth expressions implemented entirely within a common C++/Eigen framework. Our experiment","authors_text":"Edward Finkelstein","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2024-10-10T17:21:32Z","title":"Generalized Fixed-Depth Prefix and Postfix Symbolic Regression Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08137","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:5cbae01056bbb49d45ba263d0160044ad2a58619abc6727ed2c12d4fd1edd94b","target":"record","created_at":"2026-07-05T09:18:49Z","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":"33a4bf4f45b34ca9889c5859241b2ccd7a78307f8415dd453253d9afb20fbde4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2024-10-10T17:21:32Z","title_canon_sha256":"974618221f6014a937030931b954227d56235978801563b5acb053c1838cd244"},"schema_version":"1.0","source":{"id":"2410.08137","kind":"arxiv","version":1}},"canonical_sha256":"dae0a43a531ca530f13f127a20bca275902c9570cfe18259d04011e77bf874af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dae0a43a531ca530f13f127a20bca275902c9570cfe18259d04011e77bf874af","first_computed_at":"2026-07-05T09:18:49.083250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:18:49.083250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Up1CRwkllkIzuhoyINXUj8nNPmFIqSWRQTfZWxe6pOJ79brQfPKL8MNUldQoWMfqUHfTZ7dsrm6ZZZ/DTBPcBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:18:49.083715Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.08137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cbae01056bbb49d45ba263d0160044ad2a58619abc6727ed2c12d4fd1edd94b","sha256:cff4d0eb6e5f3755d30a7b2737e5662a949e92111a04ca3720c8008f1a19ead1"],"state_sha256":"2157634da82fb951dcbb518ba946a77e48e92ededaeee38d57157cfca38e62dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBnjBJ4dlUPTU7ijcV+r6IweB5GYME0w7BOfnXxt4c8hrI6dKB6NqK3eGBb3AJ9XTxpO8PDDeMwsz2RAwnOKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T06:49:05.979370Z","bundle_sha256":"15d7ac5abb196a69dfe17730b5259aed1d7a48848e5c5f642e2773de42c89761"}}