{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZSJDBULF5EKLAXCXUWZPQUC5L2","short_pith_number":"pith:ZSJDBULF","canonical_record":{"source":{"id":"2501.17848","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-29T18:49:34Z","cross_cats_sorted":[],"title_canon_sha256":"e07cf1c19f2bb72233b9b23c0510c3254597f01a41084befb1f9617ab04745a7","abstract_canon_sha256":"2f49e8d40c6655d8ae59736a79ae6711d32af1c9552b57afce44eeaf2f09efa3"},"schema_version":"1.0"},"canonical_sha256":"cc9230d165e914b05c57a5b2f8505d5ebece2f9699ad96356458287658f178d0","source":{"kind":"arxiv","id":"2501.17848","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.17848","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"2501.17848v2","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17848","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZSJDBULF5EKL","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSJDBULF5EKLAXCX","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSJDBULF","created_at":"2026-07-05T10:45:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZSJDBULF5EKLAXCXUWZPQUC5L2","target":"record","payload":{"canonical_record":{"source":{"id":"2501.17848","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-29T18:49:34Z","cross_cats_sorted":[],"title_canon_sha256":"e07cf1c19f2bb72233b9b23c0510c3254597f01a41084befb1f9617ab04745a7","abstract_canon_sha256":"2f49e8d40c6655d8ae59736a79ae6711d32af1c9552b57afce44eeaf2f09efa3"},"schema_version":"1.0"},"canonical_sha256":"cc9230d165e914b05c57a5b2f8505d5ebece2f9699ad96356458287658f178d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:59.654948Z","signature_b64":"GOrrOOA/QcseZeVyO8vo/L8CdyecEKRRPlwMIvXVUAtSHO9ezwCj0yA/LHY6K9ILKxDwnmXSOXCxjtNLFVjnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc9230d165e914b05c57a5b2f8505d5ebece2f9699ad96356458287658f178d0","last_reissued_at":"2026-07-05T10:45:59.654460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:59.654460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.17848","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-07-05T10:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKGX+uZoktEYb4lZ6u0aYJXyqZbAlh3zivQNEPdMThAwF6nFA9i9vwdpFXJk/x4R7zQ2r6j4kWt5wUbCGo56Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:06:03.075249Z"},"content_sha256":"82764b64a2197e51232116929705e1406122dbe2eba8a8bc3a501f525e57fa07","schema_version":"1.0","event_id":"sha256:82764b64a2197e51232116929705e1406122dbe2eba8a8bc3a501f525e57fa07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZSJDBULF5EKLAXCXUWZPQUC5L2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Genetic Programming for Symbolic Regression with Equality Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fabricio Olivetti de Franca, Gabriel Kronberger","submitted_at":"2025-01-29T18:49:34Z","abstract_excerpt":"The search for symbolic regression models with genetic programming (GP) has a tendency of revisiting expressions in their original or equivalent forms. Repeatedly evaluating equivalent expressions is inefficient, as it does not immediately lead to better solutions. However, evolutionary algorithms require diversity and should allow the accumulation of inactive building blocks that can play an important role at a later point. The equality graph is a data structure capable of compactly storing expressions and their equivalent forms allowing an efficient verification of whether an expression has "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17848","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.17848/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-05T10:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hcoUZeOGN232v+AEWNSk60ok3vjh0r2lyas67MChGaN89jKUOCfsMBeX1UWsb5bcTUHqQDVNHrn/5TWPwiJhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:06:03.075557Z"},"content_sha256":"43e53c781e10272d441b3ac669cc23955048f10239038f6459bad379d1d6e1ec","schema_version":"1.0","event_id":"sha256:43e53c781e10272d441b3ac669cc23955048f10239038f6459bad379d1d6e1ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSJDBULF5EKLAXCXUWZPQUC5L2/bundle.json","state_url":"https://pith.science/pith/ZSJDBULF5EKLAXCXUWZPQUC5L2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSJDBULF5EKLAXCXUWZPQUC5L2/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-04T17:06:03Z","links":{"resolver":"https://pith.science/pith/ZSJDBULF5EKLAXCXUWZPQUC5L2","bundle":"https://pith.science/pith/ZSJDBULF5EKLAXCXUWZPQUC5L2/bundle.json","state":"https://pith.science/pith/ZSJDBULF5EKLAXCXUWZPQUC5L2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSJDBULF5EKLAXCXUWZPQUC5L2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZSJDBULF5EKLAXCXUWZPQUC5L2","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":"2f49e8d40c6655d8ae59736a79ae6711d32af1c9552b57afce44eeaf2f09efa3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-29T18:49:34Z","title_canon_sha256":"e07cf1c19f2bb72233b9b23c0510c3254597f01a41084befb1f9617ab04745a7"},"schema_version":"1.0","source":{"id":"2501.17848","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.17848","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"2501.17848v2","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17848","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZSJDBULF5EKL","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSJDBULF5EKLAXCX","created_at":"2026-07-05T10:45:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSJDBULF","created_at":"2026-07-05T10:45:59Z"}],"graph_snapshots":[{"event_id":"sha256:43e53c781e10272d441b3ac669cc23955048f10239038f6459bad379d1d6e1ec","target":"graph","created_at":"2026-07-05T10:45:59Z","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/2501.17848/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The search for symbolic regression models with genetic programming (GP) has a tendency of revisiting expressions in their original or equivalent forms. Repeatedly evaluating equivalent expressions is inefficient, as it does not immediately lead to better solutions. However, evolutionary algorithms require diversity and should allow the accumulation of inactive building blocks that can play an important role at a later point. The equality graph is a data structure capable of compactly storing expressions and their equivalent forms allowing an efficient verification of whether an expression has ","authors_text":"Fabricio Olivetti de Franca, Gabriel Kronberger","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-29T18:49:34Z","title":"Improving Genetic Programming for Symbolic Regression with Equality Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17848","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:82764b64a2197e51232116929705e1406122dbe2eba8a8bc3a501f525e57fa07","target":"record","created_at":"2026-07-05T10:45:59Z","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":"2f49e8d40c6655d8ae59736a79ae6711d32af1c9552b57afce44eeaf2f09efa3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-29T18:49:34Z","title_canon_sha256":"e07cf1c19f2bb72233b9b23c0510c3254597f01a41084befb1f9617ab04745a7"},"schema_version":"1.0","source":{"id":"2501.17848","kind":"arxiv","version":2}},"canonical_sha256":"cc9230d165e914b05c57a5b2f8505d5ebece2f9699ad96356458287658f178d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc9230d165e914b05c57a5b2f8505d5ebece2f9699ad96356458287658f178d0","first_computed_at":"2026-07-05T10:45:59.654460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:45:59.654460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GOrrOOA/QcseZeVyO8vo/L8CdyecEKRRPlwMIvXVUAtSHO9ezwCj0yA/LHY6K9ILKxDwnmXSOXCxjtNLFVjnCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:45:59.654948Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.17848","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82764b64a2197e51232116929705e1406122dbe2eba8a8bc3a501f525e57fa07","sha256:43e53c781e10272d441b3ac669cc23955048f10239038f6459bad379d1d6e1ec"],"state_sha256":"c8dd31fefe0e81fcd32ce6c73abc80ca421f4648b08ebf7e511825fd5cfe7462"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHzn6+p3MCzM9HIbiV6U2gs8L7S0ehj41OOw+JTTKzoea2GGjxZIVnV54Indi47i2DCf6spqe0H0hE4dlp7BDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:06:03.079425Z","bundle_sha256":"c650f27adb30001e50505989cfa1958bce008c3b5b4209a45732e3d6b4a4e202"}}