{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GZG3C4Z565QGYDOYD6G2K4J45F","short_pith_number":"pith:GZG3C4Z5","canonical_record":{"source":{"id":"2606.25394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T04:45:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b5917f7cc90642151e52e13879ef6039f507e44299d4a3c51e0cdb1f0b37e606","abstract_canon_sha256":"b22d64f9e3da96451e1cf027549cd79c3058564eb43113aa8fe6a74742c283d8"},"schema_version":"1.0"},"canonical_sha256":"364db1733df7606c0dd81f8da5713ce952dbd5b29f86c8ee457adef2b84e0c5f","source":{"kind":"arxiv","id":"2606.25394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25394","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25394v1","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25394","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"GZG3C4Z565QG","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"pith_short_16","alias_value":"GZG3C4Z565QGYDOY","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"pith_short_8","alias_value":"GZG3C4Z5","created_at":"2026-06-25T01:18:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GZG3C4Z565QGYDOYD6G2K4J45F","target":"record","payload":{"canonical_record":{"source":{"id":"2606.25394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T04:45:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b5917f7cc90642151e52e13879ef6039f507e44299d4a3c51e0cdb1f0b37e606","abstract_canon_sha256":"b22d64f9e3da96451e1cf027549cd79c3058564eb43113aa8fe6a74742c283d8"},"schema_version":"1.0"},"canonical_sha256":"364db1733df7606c0dd81f8da5713ce952dbd5b29f86c8ee457adef2b84e0c5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:04.208657Z","signature_b64":"FeImkGFzD6xvJ8EXpXq+sBT6Yz0gwbvYZ+Wqe14iRa/bLkBduUxqbjgWegZk/6EFUvGqRCBMxqWu4iwkbTfqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"364db1733df7606c0dd81f8da5713ce952dbd5b29f86c8ee457adef2b84e0c5f","last_reissued_at":"2026-06-25T01:18:04.208210Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:04.208210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.25394","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-06-25T01:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dy2Y4lNE8tcVHIDmelScOy53xSKFx6LSuNvHMYDEQzskgVYGC8Gxic3XZutBBKzSxGExlyqKgiDd+LBbBEYBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:32:48.965602Z"},"content_sha256":"6a2432135918e9db10a995237635de1571598f32fb50efef1231dd4b226095d2","schema_version":"1.0","event_id":"sha256:6a2432135918e9db10a995237635de1571598f32fb50efef1231dd4b226095d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GZG3C4Z565QGYDOYD6G2K4J45F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FactorLibrary: From Polynomials to Circuits via Recursive Subgoals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Archit Ganapule, Bhaumik Mehta, Jarod Alper, Kaijie Jin, Michael Ruofan Zeng, Naomi Morato, Rohan Pandey, Weikun K. Zhang","submitted_at":"2026-06-24T04:45:09Z","abstract_excerpt":"Finding minimal arithmetic circuits for polynomials over finite fields is a combinatorially hard problem central to algebraic complexity theory. We formulate it as a reinforcement learning problem in two directions, bottom-up and top-down. To address the challenge of a fast-growing combinatorial search space, we introduce FactorLibrary, which stores factorizable subexpressions that serve as reusable subgoals across training episodes. We trained a bottom-up agent with Gumbel-PPO-MCTS and two top-down agents with PPO+MCTS and SAC. The PPO+MCTS top-down agent exhibited the most stable performance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25394","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/2606.25394/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-06-25T01:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlQ171SK+JRfM9+M7Ha9o7Ldgo3m2WuVb8IoCmRB1gXZU/xHrZ1p6usy2Qq3ri1OPC3+35zHwVWwkVbK6JZ8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:32:48.965983Z"},"content_sha256":"eb9a48774f926b9cbec4357c2303ac73b08fdbced9e7b55fc67a4ab668cf85e3","schema_version":"1.0","event_id":"sha256:eb9a48774f926b9cbec4357c2303ac73b08fdbced9e7b55fc67a4ab668cf85e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZG3C4Z565QGYDOYD6G2K4J45F/bundle.json","state_url":"https://pith.science/pith/GZG3C4Z565QGYDOYD6G2K4J45F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZG3C4Z565QGYDOYD6G2K4J45F/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-27T15:32:48Z","links":{"resolver":"https://pith.science/pith/GZG3C4Z565QGYDOYD6G2K4J45F","bundle":"https://pith.science/pith/GZG3C4Z565QGYDOYD6G2K4J45F/bundle.json","state":"https://pith.science/pith/GZG3C4Z565QGYDOYD6G2K4J45F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZG3C4Z565QGYDOYD6G2K4J45F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GZG3C4Z565QGYDOYD6G2K4J45F","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":"b22d64f9e3da96451e1cf027549cd79c3058564eb43113aa8fe6a74742c283d8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T04:45:09Z","title_canon_sha256":"b5917f7cc90642151e52e13879ef6039f507e44299d4a3c51e0cdb1f0b37e606"},"schema_version":"1.0","source":{"id":"2606.25394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25394","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25394v1","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25394","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"GZG3C4Z565QG","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"pith_short_16","alias_value":"GZG3C4Z565QGYDOY","created_at":"2026-06-25T01:18:04Z"},{"alias_kind":"pith_short_8","alias_value":"GZG3C4Z5","created_at":"2026-06-25T01:18:04Z"}],"graph_snapshots":[{"event_id":"sha256:eb9a48774f926b9cbec4357c2303ac73b08fdbced9e7b55fc67a4ab668cf85e3","target":"graph","created_at":"2026-06-25T01:18:04Z","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/2606.25394/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding minimal arithmetic circuits for polynomials over finite fields is a combinatorially hard problem central to algebraic complexity theory. We formulate it as a reinforcement learning problem in two directions, bottom-up and top-down. To address the challenge of a fast-growing combinatorial search space, we introduce FactorLibrary, which stores factorizable subexpressions that serve as reusable subgoals across training episodes. We trained a bottom-up agent with Gumbel-PPO-MCTS and two top-down agents with PPO+MCTS and SAC. The PPO+MCTS top-down agent exhibited the most stable performance","authors_text":"Archit Ganapule, Bhaumik Mehta, Jarod Alper, Kaijie Jin, Michael Ruofan Zeng, Naomi Morato, Rohan Pandey, Weikun K. Zhang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T04:45:09Z","title":"FactorLibrary: From Polynomials to Circuits via Recursive Subgoals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25394","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:6a2432135918e9db10a995237635de1571598f32fb50efef1231dd4b226095d2","target":"record","created_at":"2026-06-25T01:18:04Z","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":"b22d64f9e3da96451e1cf027549cd79c3058564eb43113aa8fe6a74742c283d8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T04:45:09Z","title_canon_sha256":"b5917f7cc90642151e52e13879ef6039f507e44299d4a3c51e0cdb1f0b37e606"},"schema_version":"1.0","source":{"id":"2606.25394","kind":"arxiv","version":1}},"canonical_sha256":"364db1733df7606c0dd81f8da5713ce952dbd5b29f86c8ee457adef2b84e0c5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"364db1733df7606c0dd81f8da5713ce952dbd5b29f86c8ee457adef2b84e0c5f","first_computed_at":"2026-06-25T01:18:04.208210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:04.208210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FeImkGFzD6xvJ8EXpXq+sBT6Yz0gwbvYZ+Wqe14iRa/bLkBduUxqbjgWegZk/6EFUvGqRCBMxqWu4iwkbTfqCg==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:04.208657Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.25394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a2432135918e9db10a995237635de1571598f32fb50efef1231dd4b226095d2","sha256:eb9a48774f926b9cbec4357c2303ac73b08fdbced9e7b55fc67a4ab668cf85e3"],"state_sha256":"77e8c2e1942d4b7faef4dda392a1a99d26a9551c1c5d50226202efdc3451ab0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p1pcpm/nT3e/6+aj1OMcPMPG1YvoptHk3tMMGRuJtkwzHrSmouUqzXViL7AIDSTRPws8dIKbXECyJ+Miu0nuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:32:48.967917Z","bundle_sha256":"7e400134cc27c3e9e5a093c436a6c7cc1aecb0da3a7b7cb1ce72bd51ed3ae7a8"}}