{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RGEEUYYMNNSCK7XWRSO64XP7MT","short_pith_number":"pith:RGEEUYYM","canonical_record":{"source":{"id":"1312.0841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T14:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"99f75e1cd2ca3f571beb3314f8c68d14dcdca8db1d1af053aa426a50f855c709","abstract_canon_sha256":"1fe8feed94eeabda49b38299d14d0c93316574e41f8467cbd38d164d77dd7d7a"},"schema_version":"1.0"},"canonical_sha256":"89884a630c6b64257ef68c9dee5dff64e40f85513b7e49733e315a85db8dbbed","source":{"kind":"arxiv","id":"1312.0841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0841","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0841v1","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0841","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"RGEEUYYMNNSC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RGEEUYYMNNSCK7XW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RGEEUYYM","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RGEEUYYMNNSCK7XWRSO64XP7MT","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T14:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"99f75e1cd2ca3f571beb3314f8c68d14dcdca8db1d1af053aa426a50f855c709","abstract_canon_sha256":"1fe8feed94eeabda49b38299d14d0c93316574e41f8467cbd38d164d77dd7d7a"},"schema_version":"1.0"},"canonical_sha256":"89884a630c6b64257ef68c9dee5dff64e40f85513b7e49733e315a85db8dbbed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:36.566157Z","signature_b64":"481hk8rgoQ55+rwVqpqw3RVyEi8TJNQO5Vw/46Jd/KgO6amOTdnQoY4TVweuNQczY+V3RtxbeFnqYqDCYC45DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89884a630c6b64257ef68c9dee5dff64e40f85513b7e49733e315a85db8dbbed","last_reissued_at":"2026-05-18T03:05:36.565598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:36.565598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0841","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-05-18T03:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKY4UUOL3PblDUgkCOnTqo11vaBDslD+zD/ALuaudrwNOBOHguAKAEmR67AmPJxmyhsaHugGRuchkqxHQFbkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:33:36.173302Z"},"content_sha256":"3bef0f05bd141cc7de37b6c66ade7f32e94b59e21c581c4a562aafa9789c5e6f","schema_version":"1.0","event_id":"sha256:3bef0f05bd141cc7de37b6c66ade7f32e94b59e21c581c4a562aafa9789c5e6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RGEEUYYMNNSCK7XWRSO64XP7MT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aske Plaat, Ben Ruijl, Jaap van den Herik, Jos Vermaseren","submitted_at":"2013-12-03T14:56:28Z","abstract_excerpt":"In many applications of computer algebra large expressions must be simplified to make repeated numerical evaluations tractable. Previous works presented heuristically guided improvements, e.g., for Horner schemes. The remaining expression is then further reduced by common subexpression elimination. A recent approach successfully applied a relatively new algorithm, Monte Carlo Tree Search (MCTS) with UCT as the selection criterion, to find better variable orderings. Yet, this approach is fit for further improvements since it is sensitive to the so-called exploration-exploitation constant $C_p$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0841","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"},"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-18T03:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p0eEWUcbxLHHskaZSm/uegxFWpqrdGYRkEnO6wRNGypceXD+nSmvakDrDNKZNrarf/q6aEv2fpRyO7kQYj06AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:33:36.173649Z"},"content_sha256":"4664147dd3881e093f4b6f2e776d0c31bede2702f053cb5e8ab335d4464ea8da","schema_version":"1.0","event_id":"sha256:4664147dd3881e093f4b6f2e776d0c31bede2702f053cb5e8ab335d4464ea8da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGEEUYYMNNSCK7XWRSO64XP7MT/bundle.json","state_url":"https://pith.science/pith/RGEEUYYMNNSCK7XWRSO64XP7MT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGEEUYYMNNSCK7XWRSO64XP7MT/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-27T10:33:36Z","links":{"resolver":"https://pith.science/pith/RGEEUYYMNNSCK7XWRSO64XP7MT","bundle":"https://pith.science/pith/RGEEUYYMNNSCK7XWRSO64XP7MT/bundle.json","state":"https://pith.science/pith/RGEEUYYMNNSCK7XWRSO64XP7MT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGEEUYYMNNSCK7XWRSO64XP7MT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RGEEUYYMNNSCK7XWRSO64XP7MT","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":"1fe8feed94eeabda49b38299d14d0c93316574e41f8467cbd38d164d77dd7d7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T14:56:28Z","title_canon_sha256":"99f75e1cd2ca3f571beb3314f8c68d14dcdca8db1d1af053aa426a50f855c709"},"schema_version":"1.0","source":{"id":"1312.0841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0841","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0841v1","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0841","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"RGEEUYYMNNSC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RGEEUYYMNNSCK7XW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RGEEUYYM","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:4664147dd3881e093f4b6f2e776d0c31bede2702f053cb5e8ab335d4464ea8da","target":"graph","created_at":"2026-05-18T03:05:36Z","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":"In many applications of computer algebra large expressions must be simplified to make repeated numerical evaluations tractable. Previous works presented heuristically guided improvements, e.g., for Horner schemes. The remaining expression is then further reduced by common subexpression elimination. A recent approach successfully applied a relatively new algorithm, Monte Carlo Tree Search (MCTS) with UCT as the selection criterion, to find better variable orderings. Yet, this approach is fit for further improvements since it is sensitive to the so-called exploration-exploitation constant $C_p$ ","authors_text":"Aske Plaat, Ben Ruijl, Jaap van den Herik, Jos Vermaseren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T14:56:28Z","title":"Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0841","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:3bef0f05bd141cc7de37b6c66ade7f32e94b59e21c581c4a562aafa9789c5e6f","target":"record","created_at":"2026-05-18T03:05:36Z","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":"1fe8feed94eeabda49b38299d14d0c93316574e41f8467cbd38d164d77dd7d7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T14:56:28Z","title_canon_sha256":"99f75e1cd2ca3f571beb3314f8c68d14dcdca8db1d1af053aa426a50f855c709"},"schema_version":"1.0","source":{"id":"1312.0841","kind":"arxiv","version":1}},"canonical_sha256":"89884a630c6b64257ef68c9dee5dff64e40f85513b7e49733e315a85db8dbbed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89884a630c6b64257ef68c9dee5dff64e40f85513b7e49733e315a85db8dbbed","first_computed_at":"2026-05-18T03:05:36.565598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:36.565598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"481hk8rgoQ55+rwVqpqw3RVyEi8TJNQO5Vw/46Jd/KgO6amOTdnQoY4TVweuNQczY+V3RtxbeFnqYqDCYC45DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:36.566157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bef0f05bd141cc7de37b6c66ade7f32e94b59e21c581c4a562aafa9789c5e6f","sha256:4664147dd3881e093f4b6f2e776d0c31bede2702f053cb5e8ab335d4464ea8da"],"state_sha256":"ed51a5d94f9cb210d43fd976effd2f412c7b861e63d85647c05a64ddd8bb214d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11rKKFP3aT5pDIF4zQDFwGCfr/AyMNvX/ctH3/h5SW6/G3bFCZs7m3nOD6XOIA6x8XO4ZgZxTLcvwypcD5bbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:33:36.176031Z","bundle_sha256":"9ccf23d5c3fe8a5eddf95f7862a4311f30ab35e7427fe10255d0642996d453ce"}}