{"as_of":"2026-08-23T11:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:84c5773a366364262f60d207d607759b6c4c4a1a2e1b8f6f3b6875e7beddf610","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T16:20:11.689330Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.23672/citation-record","integrity":"/paper/2607.23672/integrity","json":"/paper/2607.23672/citation-record.json","paper":"/paper/2607.23672"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.468508Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.468508Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:581b095d81250873bf712c66a6b80ce139e72f7d32b5705d3f3240ad98c864c3","observation_id":"c6d82c0f-7001-4d08-a572-0833f405d301","resolution":{"observed_at":"2026-07-30T16:20:11.468508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.474162Z","title":"Mis: A multiple-level logic optimization system,","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.474162Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:33796f97607afce6f0c9e86ea55386a73dc78e0d669b83e73268a6199f64867e","observation_id":"17002bd8-e267-4116-9b88-5312bd2f6d91","resolution":{"observed_at":"2026-07-30T16:20:11.474162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.482257Z","title":"Sis: A system for sequential circuit synthesis,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.482257Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:b043e7c9d9e6d60ba7fdebd291886455609612db7167b18c2aa9ff2c4a47336e","observation_id":"a9e6ecc0-5004-4831-be2d-56572c2bab9f","resolution":{"observed_at":"2026-07-30T16:20:11.482257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.486931Z","title":"Dag-aware aig rewriting: A fresh look at combinational logic synthesis,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.486931Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:60b974cf2868426cc36ae2bb71fb9096a9bb919faf61498cc57ce263db3a5948","observation_id":"00854e78-c2aa-40df-94ef-cd9f43a7eef3","resolution":{"observed_at":"2026-07-30T16:20:11.486931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.490914Z","title":"Scalable don’t- care-based logic optimization and resynthesis,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.490914Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:672900f3ce3160587134585f4c2bb24f7b7e216dd01e1439a221a3773e796afd","observation_id":"2fe90add-b406-45ff-9c4b-3af5de6a0518","resolution":{"observed_at":"2026-07-30T16:20:11.490914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.494962Z","title":"Sat- based exact synthesis: Encodings, topology families, and parallelism,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.494962Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:355c87f6be575a1ed3d03d5ad9063a95869c0063616231e4191d96e38eb8bd53","observation_id":"e7ce4b95-f2c7-45f1-b10c-2642710efcfa","resolution":{"observed_at":"2026-07-30T16:20:11.494962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.499091Z","title":"Boolean rewriting strikes back: Reconvergence-driven windowing meets resyn- thesis,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.499091Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:872f7dcc87bb02b30bfe2c67921168c7eda96aae1ea263938b15f64ac961d300","observation_id":"07c22b17-6480-4088-8873-56ed44c5d2e5","resolution":{"observed_at":"2026-07-30T16:20:11.499091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.502770Z","title":"A simulation-guided paradigm for logic synthesis and verification,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.502770Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:bf5c5e03c5cbd9bd5980c5862b414aae8a324c01dd49b46eb81be04b947871f1","observation_id":"e9f78414-3d43-425d-8364-5cb39268e220","resolution":{"observed_at":"2026-07-30T16:20:11.502770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.507135Z","title":"Majority-inverter graph: A new paradigm for logic optimization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.507135Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:25ca5b76ec77f551585c26cbc370b4e2dbe4bb714c97faa1bbca4da6206f647e","observation_id":"c58f981f-cb15-42f8-a83b-bb42c3a0150c","resolution":{"observed_at":"2026-07-30T16:20:11.507135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.511185Z","title":"Logic optimization with xor-and graphs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.511185Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:84f853d5e66bd340ca2f5198021db662ca73d50a4ee2dff9ae0a6365e354388a","observation_id":"54f7b77e-ebe7-4040-8e4e-225154dbcd63","resolution":{"observed_at":"2026-07-30T16:20:11.511185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.516518Z","title":"Logic optimization with majority-inverter graphs and xor-majority graphs,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.516518Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:3e3289cac594205ba2eceab197bd9995108759b616840619f629befc0509d601","observation_id":"096e50fc-f739-4a23-a9af-275aa88de934","resolution":{"observed_at":"2026-07-30T16:20:11.516518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.523533Z","title":"Drills: Deep rein- forcement learning for logic synthesis,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.523533Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:16d042974cf4512f9f2e572cedeb521d6ff0d1d74f3ca2839b85efd1ed48b58b","observation_id":"4d7b0866-38df-4340-a7dd-548f4352d4c3","resolution":{"observed_at":"2026-07-30T16:20:11.523533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07721","last_updated":"2023-05-23T21:11:08Z","snapshot_observed_at":"2026-08-16T17:21:01.754857Z","submitted_at":"2022-02-15T20:44:57Z","title":"FlowTune: End-to-end Automatic Logic Optimization Exploration via Domain-specific Multi-armed Bandit","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07721","snapshot_observed_at":"2026-07-30T16:20:11.528767Z","title":"Flowtune: Practical multi-armed bandits in boolean optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.528767Z"},"links":{"cited_paper":"/paper/2202.07721","citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:5a09bfc76cc05da7ad4e4793546b436a2e587432d5fe8d16283599d6171be00e","observation_id":"e4931dd7-b162-48db-933f-fbea9750b915","resolution":{"observed_at":"2026-07-30T16:20:11.528767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.534485Z","title":"Boils: Bayesian optimisation for logic synthesis,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.534485Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:17fb3b4c73d3666a6c3bea700e7f3c946b03aad84db48e78bc277e4ef074d056","observation_id":"66d4c361-ad04-4cd1-864a-6c1e7fe8efc6","resolution":{"observed_at":"2026-07-30T16:20:11.534485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.541598Z","title":"Alphasyn: Logic synthesis optimization with efficient monte carlo tree search,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.541598Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:eef2736950ed50eab842075c08d49ded88b954efead53131c8645f8b52189a21","observation_id":"80d35150-607b-4a15-8ea0-0ca4dda18458","resolution":{"observed_at":"2026-07-30T16:20:11.541598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.549420Z","title":"Exploring logic optimizations with reinforcement learning and graph convolutional network,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.549420Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:91dba90cb87611799bf8e92bbf85e451abb2438fbd0ffb1ef09129edc18b40fa","observation_id":"18652a1a-7901-450a-b658-6c0c8247c980","resolution":{"observed_at":"2026-07-30T16:20:11.549420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.553083Z","title":"Retrieval-guided reinforcement learning for boolean circuit minimiza- tion,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.553083Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:f60dfffe03279059ffac9d214f4edfed6858e65dd68a73e691dd35a4c6e79f33","observation_id":"e7549ac3-9995-4dc8-8620-957d1c70efb4","resolution":{"observed_at":"2026-07-30T16:20:11.553083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.558010Z","title":"LOSTIN: Logic optimization via spatio-temporal information with hybrid graph models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.558010Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:892db3645753eb90a31a96297d08290e7b8e62f0e8a531f7ed5d6b21e3c35f9b","observation_id":"239b709c-12e1-42b3-b67b-442b1ed2940f","resolution":{"observed_at":"2026-07-30T16:20:11.558010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.563304Z","title":"Gamora: Graph learning based symbolic reasoning for large-scale boolean networks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.563304Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:911fbbebc01c4f1c38f947d7e831598f709f343e4b05ecf98738ef6493c9825f","observation_id":"7268c272-492c-4a43-9191-416dce32463a","resolution":{"observed_at":"2026-07-30T16:20:11.563304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.568651Z","title":"BoolGebra: Attributed graph-learning for boolean algebraic manipulation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.568651Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:7123ed12d97f0b497d46f0b243cb0ea88094c25b53338191dfb0926e06ab920c","observation_id":"849dd8d8-d746-4986-a65d-61d86e0cfa6a","resolution":{"observed_at":"2026-07-30T16:20:11.568651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.572629Z","title":"Lsoracle: a logic synthesis framework driven by artificial intelligence (invited paper),","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.572629Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:7b7ef46d3b12b1ec55af78a83626a8b2f24ccbdad8ee8a7234431616ad4d6571","observation_id":"006422e6-e6c3-4842-a67e-bcb706598630","resolution":{"observed_at":"2026-07-30T16:20:11.572629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.576657Z","title":"Helo: A heterogeneous logic optimization framework by hierarchical clustering and graph learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.576657Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:bb45050d49860ebcebae793d2ad164a4980d6157965a220930acd6068cacb315","observation_id":"1f9f30a2-016c-41ff-8949-896e98ff0aaf","resolution":{"observed_at":"2026-07-30T16:20:11.576657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07846","last_updated":"2024-07-14T16:56:10Z","snapshot_observed_at":"2026-08-16T14:52:55.289446Z","submitted_at":"2023-10-11T19:46:27Z","title":"DAG-aware Synthesis Orchestration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07846","snapshot_observed_at":"2026-07-30T16:20:11.581687Z","title":"Dag-aware synthesis orchestration,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.581687Z"},"links":{"cited_paper":"/paper/2310.07846","citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:b20aa2853cf8c203c9d1c13319fd78f3775a61859aa1d4176c586bb2e9e18943","observation_id":"3ce8a596-9eff-47f6-9e46-fd744e2ea7f2","resolution":{"observed_at":"2026-07-30T16:20:11.581687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.586691Z","title":"Abc: An academic industrial-strength verification tool,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.586691Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:96f03acdd28c1a81ca4fdb2e2fb485f8b29cad5d65694ea6063767adb1ba75f1","observation_id":"c07ee16f-d98d-4a18-87e7-748530a3e28b","resolution":{"observed_at":"2026-07-30T16:20:11.586691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.592742Z","title":"The epfl logic synthesis libraries,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.592742Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:b037ffe4db3d3be649a4fc5d3482efd9b410f70aeec7133da498c3e5865b19d3","observation_id":"73e1a0f6-43bd-4b21-a41c-f02d37afacf4","resolution":{"observed_at":"2026-07-30T16:20:11.592742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.599551Z","title":"Provably correct peephole optimizations with alive,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.599551Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:5f5d7ef3e2f20624431ab858b46d0f073b119fc1ee401193afd1a78d2e976347","observation_id":"fb1f8310-f552-48a3-bfee-b69dd2869b3b","resolution":{"observed_at":"2026-07-30T16:20:11.599551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.609569Z","title":"Alive2: Bounded translation validation for llvm,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.609569Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:397a5538b78bc365f431579d3a4305948bc4d947b69fab2dc822e30956720eb0","observation_id":"16f999e5-895a-4687-ae54-89de844a8a21","resolution":{"observed_at":"2026-07-30T16:20:11.609569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.617316Z","title":"Mathematical discoveries from program search with large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.617316Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:dcb822d7324abee45fec6920d81b60730b9de2b55a3a8e2c20ec036f97507d8d","observation_id":"26184f5f-07d7-4a09-aa13-562841f3622e","resolution":{"observed_at":"2026-07-30T16:20:11.617316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.621799Z","title":"Solving olympiad geometry without human demonstrations,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.621799Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:309402128e61240302f9b3c68cf97d367846167b6a105d477aa20cf4f927a8f9","observation_id":"21d23049-a3b6-4bba-961e-cfd72a35ffd5","resolution":{"observed_at":"2026-07-30T16:20:11.621799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.17005","snapshot_observed_at":"2026-07-30T16:20:11.626377Z","title":"Provably good prim–dijkstra revisited: New theory and a practical algorithm for a classical vlsi routing problem with llms,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.626377Z"},"links":{"cited_paper":"/paper/2607.17005","citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:efe39cdbb8d4c1b3e937fc7b020e2946967dbb45b632ca973a165a9404ce0434","observation_id":"5c936114-c9f1-457f-91ab-a0d842ebc4b9","resolution":{"observed_at":"2026-07-30T16:20:11.626377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.634175Z","title":"Robust boolean reasoning for equivalence checking and functional property verification,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.634175Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:fe177454ac6546cad6f0e8904249c4008882f1cb352eafc6c7be56ebef323ae0","observation_id":"f0da356d-4cb6-4e41-90ae-a2f4409f1ae7","resolution":{"observed_at":"2026-07-30T16:20:11.634175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.639652Z","title":"Minimum cardinality and arbitrary multi-step reachable sets lie outside this result","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.639652Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:8cce9f54615903a33974e0fd7563e21a44cd473bc6cc0f907befeb740efc604e","observation_id":"8170dd2b-570b-4264-822d-64962e8e9551","resolution":{"observed_at":"2026-07-30T16:20:11.639652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.649437Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.649437Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:48693d6000f19a49404daf042f1233a626bdba484c964142b2157a6e4d7845ad","observation_id":"624d31e7-3097-4281-bd78-6496cfad12ab","resolution":{"observed_at":"2026-07-30T16:20:11.649437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.658207Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.658207Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:08d88d0f19dba6756782d064fccc59afd86d74b4f438ed62221820f306d6e39d","observation_id":"59fedef6-f0a1-4572-80cd-265bfed792f5","resolution":{"observed_at":"2026-07-30T16:20:11.658207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.663499Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.663499Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:2ae6a8ad1e08add2557ef0d71189c001210724099ba77e4e95a9a27fbb1bc884","observation_id":"025cf403-6c6b-44ae-9cf3-ecfa2b37ee10","resolution":{"observed_at":"2026-07-30T16:20:11.663499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.667945Z","title":"No reassociation, balancing, rewriting, refactoring, resubsti- tution, or SAT sweeping occurs inN","venue":null,"work_id":null,"year":1941},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.667945Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:b371e04338587f0f0464d5853c6b6fe27f8952e4db0dff70796035ceea585056","observation_id":"1091ec9b-8f10-4966-a88c-0856a469dde9","resolution":{"observed_at":"2026-07-30T16:20:11.667945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.672401Z","title":"The normal-effort HeLO- comparison recipe iscgo -M 2; cgo_mig; the maximum- effort recipe iscgo -M 1 -P 20; cgo_mig -R 60 -T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.672401Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:333a8d86d574592ce7e01f3b6acdf63e9ef55662d0af1650297b33c5af3e28f2","observation_id":"341b1179-b4d1-44fb-aa6d-2b8076a01fdc","resolution":{"observed_at":"2026-07-30T16:20:11.672401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.682271Z","title":"Ratios and speedups use the same inputs, host, harness, and published orchestratecommand as Tables XVII and XVIII","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.682271Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:2ec3356ee0dcc61ee6a87ddde0bd1deb8bb380a982edec53cfd78d28dcb58544","observation_id":"3b112fcf-862b-44e6-9985-127dd7d10ea5","resolution":{"observed_at":"2026-07-30T16:20:11.682271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.685850Z","title":"At normal effort, its exact-input and all-context NDP geomeans are0.940 and0.944; at maximum effort, they are0.944and0.929","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.685850Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:dc8a5019879c40222bfc19deba6a875dd3d30326befbb5be4f6f0b462e799d84","observation_id":"2bc1bc0b-512d-4071-8bfc-f0498ce85b02","resolution":{"observed_at":"2026-07-30T16:20:11.685850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.689330Z","title":"The eleven corrected inputs inO 16 \\D 55 entered after the configuration freeze and form the disjoint evaluation subset reported above","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.689330Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:931191321a24fc65ae71613538f0b00fe91728b75777ccfe381a115553e339c1","observation_id":"007c1dee-a5cc-4e95-b971-a3e34e91e049","resolution":{"observed_at":"2026-07-30T16:20:11.689330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:20:11.677087Z","title":"TABLE XX COMPLETE DELTA FROM TACO TO THE FAST OVERLAY","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":1800,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.677087Z"},"links":{"citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:5f89efdbe160bfae79c48d4b5173c71030c419596ae0deedbc25df287ef0daa9","observation_id":"ec580f23-21c2-4fc7-a764-b2ede4b5de02","resolution":{"observed_at":"2026-07-30T16:20:11.677087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":41},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2607.23672."}