{"as_of":"2026-08-17T05:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d34a31d4d84cad77c496888ba8a50394804006447eb34f170f45ce2b43edf2bd","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T10:55:42.684032Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:14:05.143844Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T16:14:05.348647Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"cited_work":{"arxiv_id":"2411.18981","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.18981","snapshot_observed_at":"2026-08-15T16:14:05.348647Z","title":"The Complexity of Order-Finding for ROABPs","venue":"cs.CC","work_id":"8eb5fc6d-51ab-4731-851f-943245c8c1b4","year":2024},"citing_paper":{"arxiv_id":"2509.10725","last_updated":"2025-09-12T22:30:24Z","snapshot_observed_at":"2026-08-15T15:51:24.259148Z","submitted_at":"2025-09-12T22:30:24Z","title":"On Closure Properties of Read-Once Oblivious Algebraic Branching Programs","version":1},"reference_index":241,"source":"pdf_text","source_observed_at":"2026-08-15T16:14:05.143844Z"},"links":{"cited_paper":"/paper/2411.18981","citing_paper":"/paper/2509.10725"},"observation_digest":"sha256:aee3947e98cc73ef073584ee6ae72a5f83c14515ffaa6540cc85cb216fb36f1d","observation_id":"59283401-3653-4278-89b3-105bc835dc21","resolution":{"observed_at":"2026-08-15T16:14:05.355223Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.18981/citation-record","integrity":"/paper/2411.18981/integrity","json":"/paper/2411.18981/citation-record.json","paper":"/paper/2411.18981"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.492596Z","title":"write newline toupdate empty","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.492596Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:a809153a473afb8aec3c2c28548336d194d1f331ebde4dc9f5fada37e65e0ebc","observation_id":"e747d2d6-4551-41d7-b13e-e65fa2abdc0f","resolution":{"observed_at":"2026-08-12T10:55:42.492596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.7535","last_updated":"2014-06-29T18:36:11Z","snapshot_observed_at":"2026-08-14T23:28:39.577329Z","submitted_at":"2014-06-29T18:36:11Z","title":"Hitting-sets for ROABP and Sum of Set-Multilinear circuits","version":1},"cited_work":{"arxiv_id":"1406.7535","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.7535","snapshot_observed_at":"2026-08-12T10:55:43.669628Z","title":"Hitting-sets for ROABP and Sum of Set-Multilinear circuits","venue":"cs.CC","work_id":"949c6364-af4e-41f3-8dfb-516e99c12a4d","year":2014},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.497814Z"},"links":{"cited_paper":"/paper/1406.7535","citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:80eebe57d2785145f20d1bd408fa9c77593429326d4980d50bf1550ec5aed4cd","observation_id":"e0c559d7-75ad-45b3-8228-15be2336ae2e","resolution":{"observed_at":"2026-08-12T10:55:43.673226Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.502067Z","title":"http://dx.doi.org/10.1137/080729256 Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.502067Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:4608c31a98b6913754223523042ab9e87a0af4ec23fce67894888a811fbd3f0a","observation_id":"6282cafe-f004-42eb-8eb9-a2cbe9e1b2f7","resolution":{"observed_at":"2026-08-12T10:55:42.502067Z","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-08-12T10:55:42.506394Z","title":"http://dx.doi.org/10.1007/978-3-642-32512-0\\_2 Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.506394Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:fd0c55b424e10c4f12227bb886018066b7982fba6b3bef4b18ea56a53d73c515","observation_id":"917463bf-2904-43de-b859-db8aadd4e130","resolution":{"observed_at":"2026-08-12T10:55:42.506394Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.825447Z","title":"Equivalence of-algebras and cubic forms","venue":null,"work_id":"935e2758-ff51-45b8-a8ee-924f6f16fabd","year":2006},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.511038Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:ce2c49718b2be18f3733062018f27c2a2afc78f909f798230bbf6ed7f624a3b7","observation_id":"744cf278-b213-44bb-b8ba-1289daf5022b","resolution":{"observed_at":"2026-08-12T10:55:43.829300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2024.16","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.902634Z","title":"http://dx.doi.org/10.4230/LIPICS.ICALP.2024.16 NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials","venue":null,"work_id":"5f8f27d5-6399-4582-be92-577e7c4e7ada","year":2024},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.516208Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:3e3ada3db4a408f7e025ed807d0cfce244cd403bb644fa5167b8408dbb9e0e1e","observation_id":"15108231-e59a-47ef-9388-fbe3cdf560ea","resolution":{"observed_at":"2026-08-12T10:55:42.906204Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977554.ch124","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.891744Z","title":"Kulikov, Ivan Mihajlin, and Denil Sharipov","venue":null,"work_id":"d221b7b6-a70d-4ac7-a570-49aed06dca96","year":null},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.521269Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:ba3d7b53dfd1586d8b77e9f1bca697cdd57672795d32014acacbef16ad11f257","observation_id":"4bb193dc-2fe0-4665-bc09-f371098b5ae5","resolution":{"observed_at":"2026-08-12T10:55:42.895281Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2022.21","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.881130Z","title":"http://dx.doi.org/10.4230/LIPICS.APPROX/RANDOM.2022.21 Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case","venue":null,"work_id":"e95e1a92-a1ba-42e2-853a-cd0a6ab19aa8","year":2022},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.525194Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:d51812ebc8f7d7cce2e601033f73ab0065c167add267b69841ee033b84ccd92c","observation_id":"021d3388-74ce-4e47-8690-3f3d011ebcb0","resolution":{"observed_at":"2026-08-12T10:55:42.884857Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.529259Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.529259Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:db224b88067ef069bc357546da90fc89e8f850114c11646e45401ad9a1a80bcf","observation_id":"5b3be2c3-4b7e-4bc0-a342-418eb9d6681b","resolution":{"observed_at":"2026-08-12T10:55:42.529259Z","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-08-12T10:55:42.532673Z","title":"http://dx.doi.org/10.1145/3406325.3451096 Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.532673Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:9f7036b0ece1f3c3f753bb6662ff14f7ba37746ced098f0bc30548236862bc4d","observation_id":"22eda03d-f09e-4669-b46c-bfcdd4dab03e","resolution":{"observed_at":"2026-08-12T10:55:42.532673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10143","last_updated":"2024-07-14T10:29:50Z","snapshot_observed_at":"2026-08-16T13:34:24.508586Z","submitted_at":"2024-07-14T10:29:50Z","title":"Explicit Commutative ROABPs from Partial Derivatives","version":1},"cited_work":{"arxiv_id":"2407.10143","doi":"10.48550/arxiv.2407.10143","metadata_source":"pith","pith_arxiv_id":"2407.10143","snapshot_observed_at":"2026-08-12T12:16:16.734455Z","title":"Explicit Commutative ROABPs from Partial Derivatives","venue":"cs.CC","work_id":"f0702140-5251-46e9-aa07-73470f585787","year":2024},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.535964Z"},"links":{"cited_paper":"/paper/2407.10143","citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:4704dbb064947080d9994572f50a005276a2768fbda44feaa37be63b6d91a3d9","observation_id":"a6ff7a34-b034-4bf4-ba65-5de311cc5625","resolution":{"observed_at":"2026-08-12T10:55:42.873644Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.812069Z","title":"The complexity of boolean formula minimization","venue":null,"work_id":"d38cf239-d7fa-4516-94c6-c6ff1c75d944","year":2011},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.540101Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:437a3db25936fda5d75a6f0d656043269094be94380a67c25509a9400a4a4187","observation_id":"32c3fb16-72e3-4301-b536-00c9c8510746","resolution":{"observed_at":"2026-08-12T10:55:43.815773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.800928Z","title":"Improving the variable ordering of OBDDs is NP-complete","venue":null,"work_id":"1acfacc1-d4b6-4275-a374-311331dac043","year":1996},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.543633Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:ac6ac26fdd56c054944dc40aa3da63d82117e5422092f60fbaef379dfcb8802d","observation_id":"4ecc8db0-4dfb-4b7d-ac65-095a47c807d9","resolution":{"observed_at":"2026-08-12T10:55:43.804895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2024.25","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.849043Z","title":"http://dx.doi.org/10.4230/LIPICS.ITCS.2024.25 Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning","venue":null,"work_id":"b0259b5f-7ef0-40ff-b02b-e700a94b5e1a","year":2024},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.547385Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:3b8f7d50bbad0b38feebfba81d8246c1f2564e0f70b415bc5b12353fa4718a4f","observation_id":"f9552fa0-042e-4d0d-b12e-b94b2cc0252e","resolution":{"observed_at":"2026-08-12T10:55:42.856955Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2023.22","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.837000Z","title":"http://dx.doi.org/10.4230/LIPIcs.STACS.2023.22 On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts","venue":null,"work_id":"d14a1875-5a0f-441c-bd84-7efac7998d97","year":2023},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.551268Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:b51acdbf7d060ae7c8e8b5db4da765078ce9058a544a4263d1dd18f2b2b974a1","observation_id":"a3dc1c21-4728-4157-8c6c-3c403d5c96e8","resolution":{"observed_at":"2026-08-12T10:55:42.840812Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.555033Z","title":"http://dx.doi.org/10.1007/978-0-387-35651-8 Ideals, Varieties and Algorithms","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.555033Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:fd9f9793b14ba7f6cd0534369250b9184a72f9304befd9371d157af4f72bc7fb","observation_id":"4d96fac0-20b8-4a36-a505-10c43d951b78","resolution":{"observed_at":"2026-08-12T10:55:42.555033Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.789011Z","title":"https://www.cse.iitk.ac.in/users/nitin/papers/border-depth3.pdf Demystifying the border of depth-3 algebraic circuits","venue":null,"work_id":"e9546e42-d4f1-4822-8f26-16bad121fbef","year":2021},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.558674Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:48aad026711cc59bc75c6a067f6bad208605696d5fe9c235e566f3e8eb9e7e7f","observation_id":"86d9061c-8bc4-4caf-81ba-5a781e071df5","resolution":{"observed_at":"2026-08-12T10:55:43.793068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2021.11","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.817720Z","title":"http://dx.doi.org/10.4230/LIPICS.CCC.2021.11 Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits","venue":null,"work_id":"a81f2849-19fd-46e6-a57a-72d311bd318d","year":2021},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.562066Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:134c6f420e3ef909fc84901edd84f5cd6482a4df0b7a04d7e67a97a7728740ce","observation_id":"8cf659ca-6eac-4e53-ac51-7e0e557e6bf4","resolution":{"observed_at":"2026-08-12T10:55:42.822638Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.565862Z","title":"DeMillo and Richard J","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.565862Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:f05c4dfb2d5fd1e95e04607fa25e2c289301e86524ca1df2e93036debae14151","observation_id":"2f74d659-6be9-465e-96ea-8dbc93a95a76","resolution":{"observed_at":"2026-08-12T10:55:42.565862Z","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":"8522.56852","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.508550Z","title":"http://dx.doi.org/10.1145/568522.568523 A survey of graph layout problems","venue":null,"work_id":"5820ceb6-f6e9-40db-8edf-b5eb3cda13a9","year":2002},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.570637Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:385b37e6b364c071a396d90a69193a12f2dee64e9aa0cd534e47bd943038d8fe","observation_id":"449da946-7235-466b-8f4c-b0ef855d2ac6","resolution":{"observed_at":"2026-08-12T10:55:43.516523Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1209.2408","last_updated":"2013-09-22T22:02:53Z","snapshot_observed_at":"2026-08-15T00:47:04.389680Z","submitted_at":"2012-09-11T19:52:41Z","title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs","version":2},"cited_work":{"arxiv_id":"1209.2408","doi":null,"metadata_source":"pith","pith_arxiv_id":"1209.2408","snapshot_observed_at":"2026-08-12T10:55:43.433601Z","title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs","venue":"cs.CC","work_id":"2eff9685-332b-4485-9bef-93408dc42a10","year":2012},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.574901Z"},"links":{"cited_paper":"/paper/1209.2408","citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:364f8fa3b61475665d5abf0a71bef646b6a5c5fffe876600bdc80751fa97512f","observation_id":"22ed1d6c-d0ab-433c-933f-624b9889514c","resolution":{"observed_at":"2026-08-12T10:55:43.437960Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.578917Z","title":"Forbes, Ramprasad Saptharishi, and Amir Shpilka","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.578917Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:0de112948e0e7b18ef863d9117989d2c2f717f2d31d3d28fe704463bf63ec1d4","observation_id":"5f26e670-043d-46ca-b6cd-c3ade883251f","resolution":{"observed_at":"2026-08-12T10:55:42.578917Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.777961Z","title":"Garey and David S","venue":null,"work_id":"f16fa0b3-8b9b-45ee-b475-f6a4865afb65","year":1979},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.582974Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:0a69264c7e89a833d18070d3dfb011d1f5fff00581e841d032f463e05c252583","observation_id":"2c8c3703-32a9-473c-8830-754fe89b2588","resolution":{"observed_at":"2026-08-12T10:55:43.781795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1601.08031","last_updated":"2018-07-10T14:47:34Z","snapshot_observed_at":"2026-08-14T22:12:36.311874Z","submitted_at":"2016-01-29T10:22:51Z","title":"Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs","version":2},"cited_work":{"arxiv_id":"1601.08031","doi":null,"metadata_source":"pith","pith_arxiv_id":"1601.08031","snapshot_observed_at":"2026-08-12T10:55:43.344057Z","title":"Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs","venue":"cs.CC","work_id":"cdce9481-b55a-48f3-8908-ca9c3ef568aa","year":2016},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.586673Z"},"links":{"cited_paper":"/paper/1601.08031","citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:9554a2b4f19ad5cb883b8cf181a9968dca61d5cf5db06dec55f7f583ac5100a9","observation_id":"637ce018-e38b-4163-88c6-46d793185cba","resolution":{"observed_at":"2026-08-12T10:55:43.348272Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.766863Z","title":"Learning sums of powers of low-degree polynomials in the non-degenerate case","venue":null,"work_id":"d0b033fd-d263-4fb4-bdb4-013a17cae730","year":2020},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.591241Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:6f4bb2da4348155cc7896f72b6c451ff3183e44c5446c91c1c93511db087690a","observation_id":"5dc3f50c-d12c-46e5-9249-a535c1794f86","resolution":{"observed_at":"2026-08-12T10:55:43.770815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.7341","last_updated":"2015-05-16T11:36:33Z","snapshot_observed_at":"2026-08-14T23:10:04.352452Z","submitted_at":"2014-11-26T19:24:14Z","title":"Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs","version":2},"cited_work":{"arxiv_id":"1411.7341","doi":null,"metadata_source":"pith","pith_arxiv_id":"1411.7341","snapshot_observed_at":"2026-08-12T10:55:43.328214Z","title":"Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs","venue":"cs.CC","work_id":"c05c1646-643b-41f7-b148-cbff57f6d46d","year":2014},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.595531Z"},"links":{"cited_paper":"/paper/1411.7341","citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:15b2f7115552e6e97736bf783e1b3f157a0d3d20c40372116ac73fa9dfb2d4b5","observation_id":"5ddf9a1b-3863-45cb-9de9-5ddc78ca853c","resolution":{"observed_at":"2026-08-12T10:55:43.331899Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.600300Z","title":"http://dx.doi.org/10.1016/0196-6774(90)90014-6 Tensor Rank is NP-Complete","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.600300Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:c2627a6dbebe2423c70fe514fb55ffaf29a3aa0a0536996b8065e9683d9849ea","observation_id":"51ec4505-edc3-487f-a096-551ef779ddd8","resolution":{"observed_at":"2026-08-12T10:55:42.600300Z","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-08-12T10:55:42.604598Z","title":"http://dx.doi.org/10.1109/FOCS54457.2022.00095 NP-Hardness of Learning Programs and Partial MCSP","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.604598Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:eee3e45bf6c303c5d5d68f8cf5eff1282ae0fb37c7d791f838f41f466ef1057a","observation_id":"93cd3dfb-7cd0-422c-9f3d-60ef387c63fb","resolution":{"observed_at":"2026-08-12T10:55:42.604598Z","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":"10.4230/lipics.ccc.2018.5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.793344Z","title":"Oliveira, and Rahul Santhanam","venue":null,"work_id":"ad4ceea5-3e62-45b9-8e6c-56c7feb11390","year":2018},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.608223Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:17a980429fbe9aa6d4b1dbfa541535eb90f0c7793cd50f52d042b6df490c134d","observation_id":"516518af-e7f2-4188-87fe-c48ff25c36ae","resolution":{"observed_at":"2026-08-12T10:55:42.797008Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.613114Z","title":"http://dx.doi.org/10.1109/FOCS52979.2021.00050 The Minimum Formula Size Problem is (ETH) Hard","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.613114Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:6ac1c5054792704e61be852a940b591f08f2cd3afa52eb7244ee4e6cd3599f31","observation_id":"2473d8f6-1fd3-44f5-abf9-71ce4a0b78c3","resolution":{"observed_at":"2026-08-12T10:55:42.613114Z","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":"10.1137/1.9781611973082.108","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.782966Z","title":"http://dx.doi.org/10.1137/1.9781611973082.108 Efficient algorithms for some special cases of the polynomial equivalence problem","venue":null,"work_id":"8a1698e1-9138-4ccc-b469-24388c85f338","year":null},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.616967Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:0f1ec6c5bf0a904d43a50485d343d55b701624ea43374a4269b6e0e0d6d3b925","observation_id":"e7b25572-5c34-4920-aaaa-498114e5c9cc","resolution":{"observed_at":"2026-08-12T10:55:42.786588Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.755357Z","title":"http://eccc.hpi-web.de/report/2015/154/ Separation between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits","venue":null,"work_id":"3bc281ef-526f-4a4f-ae65-2ce8814e6c7c","year":2015},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.620756Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:9ec54e16cb2b406999900fe2a8d54a0b3233e191ee399162b844c9a34b385d50","observation_id":"4779c1c7-4429-41b4-b7e3-72eb3f286ab6","resolution":{"observed_at":"2026-08-12T10:55:43.759074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2006.v002a010","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.770897Z","title":"Klivans and Amir Shpilka","venue":null,"work_id":"f40ef422-9b6c-4fd1-ba91-e19c1d85efcd","year":2006},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.624529Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:74a0a52dd58d25362baae4f472a945f27f75fb690f55c4e0dfd43c70b28d1c2e","observation_id":"6e8a9ab8-5c5b-4bd9-836e-287c659f6c7e","resolution":{"observed_at":"2026-08-12T10:55:42.774834Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.743538Z","title":"Reconstruction of non-degenerate homogeneous depth three circuits","venue":null,"work_id":"6863300d-359e-4a60-a3b7-b935d8dfa599","year":2019},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.628465Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:fdee94fc6ca10166fe2fab69314b659aba307af405cc8da906a31d5077ec04f0","observation_id":"24c820b2-f637-42bf-a083-bfdc8ba60965","resolution":{"observed_at":"2026-08-12T10:55:43.747498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.632172Z","title":"http://dx.doi.org/10.1145/3611094 Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.632172Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:b53bd143b4c0c4671633fe6777310aaeed48d82b3e553dcd130e91ace785c0c8","observation_id":"5a700e32-3d1e-422e-9ea7-84988cf5f01f","resolution":{"observed_at":"2026-08-12T10:55:42.632172Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.730957Z","title":null,"venue":null,"work_id":"78a0f80f-0c78-45ee-8659-87111155a240","year":1979},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.636349Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:93b85ef75c519edb86b7068338978e2aa1b6c7f1eeb953125959c0eb85731547","observation_id":"21c0522d-7266-4923-a257-c540f84217cb","resolution":{"observed_at":"2026-08-12T10:55:43.735267Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.640441Z","title":"http://dx.doi.org/https://doi.org/10.1016/j.jsc.2011.12.018 Dimension-dependent bounds for Gr \\\"o bner bases of polynomial ideals","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.640441Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:42cb48932ed36724685a4b5295f05635255a5ba9299c04094db3aff6b5ccaebe","observation_id":"ae75465d-b93d-4286-8d37-d3492586cc68","resolution":{"observed_at":"2026-08-12T10:55:42.640441Z","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":"10.1016/0304-3975(88)90028-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.744010Z","title":"Monien and I.H","venue":null,"work_id":"653b05ee-a1d8-4861-8b0c-1c56149d69e0","year":1988},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.644103Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:209c13b6137a55acc5e93b96584dfa50016660693d5ed964de0bccf6c13d127a","observation_id":"1ff3e759-8957-4fe0-9ae8-e08832d3d48c","resolution":{"observed_at":"2026-08-12T10:55:42.748016Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.716423Z","title":"Algorithms and Data Structures in VLSI Design: OBDD-foundations and applications","venue":null,"work_id":"fdac5ae6-210a-48da-80ae-b5620ce84654","year":1998},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.648506Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:416b8e6b34e4e74771b69a37771a665341014c3d422c6f42a986257fcf3c3230","observation_id":"eabbcbd3-0315-4ce9-9bf5-1062f230eedc","resolution":{"observed_at":"2026-08-12T10:55:43.721363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0216.10024","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.164296Z","title":"http://dx.doi.org/10.1145/100216.100242 Psuedorandom Generators for Space-Bounded Computation","venue":null,"work_id":"3bea39b9-c332-4c8e-b890-0d0031f4786c","year":1990},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.652191Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:d4aeaff7ba1120917915f077395895d5c63fba175ff5aab701881a4eae6ac1a5","observation_id":"02712158-b06d-4132-8701-9ba1cf567a8b","resolution":{"observed_at":"2026-08-12T10:55:43.169911Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.656620Z","title":"http://dx.doi.org/10.1145/103418.103462 Lower bounds for non-commutative computation","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.656620Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:591965df972308a9a7624d3dbf6ba5b5fb4d6457fa6ad111ecbb155041ff2591","observation_id":"22e42452-3420-4fc3-9b18-284aeedfb5ba","resolution":{"observed_at":"2026-08-12T10:55:42.656620Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.704822Z","title":"U ber h \\","venue":null,"work_id":"f1705468-b2f8-44da-a1f5-ee9f4ba3e929","year":1922},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.660140Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:0d8b251e59819fd1ef6346403efd2fc71db0fc222339eb0328ab937bb5c57575","observation_id":"823c42b3-f1cf-498d-a518-59d4e8dfa7f8","resolution":{"observed_at":"2026-08-12T10:55:43.708603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:42.664110Z","title":"http://dx.doi.org/10.4086/toc.2006.v002a006 Separation of Multilinear Circuit and Formula Size","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.664110Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:6d8e9e5edd25c5b9899669a45f51d129276340f9d755b5fd977b63691bace615","observation_id":"96627b6a-11be-46cb-9ec7-67fb933ce21c","resolution":{"observed_at":"2026-08-12T10:55:42.664110Z","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-08-12T10:55:42.667791Z","title":"http://dx.doi.org/10.1007/s00037-005-0188-8 Deterministic polynomial identity testing in non-commutative models","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.667791Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:8eedb618339b18d107459e31178dce40cb65849bbc32a9fc5376452b86f7ae8e","observation_id":"2c7889ed-4318-40b1-a48a-bdadb2b1d22a","resolution":{"observed_at":"2026-08-12T10:55:42.667791Z","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-08-12T10:55:42.671112Z","title":"Schwartz","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.671112Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:9ec2885faa2f4ec9972d5423d3e17e88d9ec4ed7a01aa249c073b1ecc4773675","observation_id":"c4d22271-80e7-45ce-a292-120341491239","resolution":{"observed_at":"2026-08-12T10:55:42.671112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01559","last_updated":"2016-11-04T22:46:27Z","snapshot_observed_at":"2026-08-14T21:31:52.743158Z","submitted_at":"2016-11-04T22:46:27Z","title":"How hard is the tensor rank?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01559","snapshot_observed_at":"2026-08-12T10:55:42.674079Z","title":"http://arxiv.org/abs/1611.01559 How hard is the tensor rank? , 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.674079Z"},"links":{"cited_paper":"/paper/1611.01559","citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:6ed7c28f1330adbb7eaf36d2dc680e9d63fc40a847a565514ff86a7560c35641","observation_id":"e5f30b9b-94db-4b11-bc5a-c85acfcae045","resolution":{"observed_at":"2026-08-12T10:55:42.674079Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.690689Z","title":"The nonapproximability of OBDD minimization","venue":null,"work_id":"38c6132b-02e8-4058-bc67-097e9acaed7a","year":2002},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.677457Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:dc7a7b57820d028eb9591f0aa68055c00b64116114d87c4e813659e8ac34d2db","observation_id":"040f0d94-07d6-4dcb-844f-55d10df8b4d2","resolution":{"observed_at":"2026-08-12T10:55:43.695883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:55:43.680029Z","title":"Branching programs and binary decision diagrams: theory and applications","venue":null,"work_id":"d661c565-34b9-4c8b-898c-617999546cf3","year":2000},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.680413Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:c4bf05364098c22e8e6b9d709cc0532706bcda9b773cce51f59d9a5e1ee27ae2","observation_id":"1b8eaa3d-c1a8-48a9-bd6f-ddee57debc84","resolution":{"observed_at":"2026-08-12T10:55:43.683413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-09519-5_73","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"http://dx.doi.org/10.1007/3-540-09519-5_73 Probabilistic algorithms for sparse polynomials","venue":"Lecture notes in computer science","work_id":"107e7061-aba9-4863-8f02-7467fb029094","year":null},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.684032Z"},"links":{"citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:87aaf076bd7a77157e60765cc22dfe8cd2ddcae3833a371a23f068e4329b30fa","observation_id":"ed6c20c9-577e-4fa2-84d7-04ebe69a4bbd","resolution":{"observed_at":"2026-08-12T10:55:42.719072Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":19,"verified_exact":15,"verified_fuzzy":12},"total_outbound_references":49},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 1 inbound Pith citation observation for arXiv:2411.18981."}