{"as_of":"2026-08-21T20:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:840351db506b42b7bd42dd46bf7afe9294c6bf547997c4a81aa14f3578f4b98d","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:55:23.570399Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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:29:06.997448Z","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:29:07.889095Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"cited_work":{"arxiv_id":"2504.17412","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.17412","snapshot_observed_at":"2026-08-15T16:29:07.889095Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","venue":"cs.CC","work_id":"0f11f057-12f8-457e-8e1a-dd010cc0f653","year":2025},"citing_paper":{"arxiv_id":"2509.06435","last_updated":"2025-09-09T13:28:19Z","snapshot_observed_at":"2026-08-21T09:10:10.017445Z","submitted_at":"2025-09-08T08:29:16Z","title":"Linear Matroid Intersection is in Catalytic Logspace","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T16:29:06.997448Z"},"links":{"cited_paper":"/paper/2504.17412","citing_paper":"/paper/2509.06435"},"observation_digest":"sha256:1f33b67762326f2e547b0a126c0f80e0aeae8a0aa557d09b2b69622ed9aab376","observation_id":"0112003b-6e92-4f74-aab4-77f4f650f855","resolution":{"observed_at":"2026-08-15T16:29:07.894427Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.17412/citation-record","integrity":"/paper/2504.17412/integrity","json":"/paper/2504.17412/citation-record.json","paper":"/paper/2504.17412"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:55:24.241481Z","title":"Bipartite matching is in catalytic logspace","venue":null,"work_id":"3008edce-2213-4d7e-bb15-11f76891b6e2","year":2025},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.406467Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:152438dfe4aa2836b3b4a70f4dbbba51c296744539fb31964411b542e4f4d2af","observation_id":"5ba3ad21-72b9-4f3f-b7d2-068e9d1f541e","resolution":{"observed_at":"2026-08-16T10:55:24.245930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:24.226974Z","title":"Representations of multivariate polynomials by sums of univariate polynomials in linear forms","venue":null,"work_id":"acca3f1f-6de8-43a1-b56d-02ba24c85a00","year":2008},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.410978Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:86199b0f884f9eda23c8da1d542b7ca681cb89518dc109ef2167f0da19e424f5","observation_id":"7f4f64b1-b19d-4f91-80e8-70db2aa8cd20","resolution":{"observed_at":"2026-08-16T10:55:24.232328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:24.214405Z","title":"Computing algebraic formulas using a constant number of registers","venue":null,"work_id":"c2703ca0-0e10-4475-856f-3300a2bd6734","year":1992},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.414697Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:98d92f8984ae18e56ac45c8a187b6810e0079d9dadf1f28c0150fa022fd8cde5","observation_id":"989fa5c6-b571-4628-8100-0f8fb930a592","resolution":{"observed_at":"2026-08-16T10:55:24.218294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:24.198221Z","title":"Cook, Patrick W","venue":null,"work_id":"98b748da-d6f3-4493-9ac8-df04f340e648","year":1989},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.418824Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:f36427a6c642c3d724e93fd348ffcd4b858626185664b4b46be1bda3c49864dd","observation_id":"db3b1c67-1f5d-4cae-8277-66567a42935e","resolution":{"observed_at":"2026-08-16T10:55:24.202336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:24.184932Z","title":"Computing with a full memory: catalytic space","venue":null,"work_id":"32d04532-0f2a-4b15-8c2a-c912a15f55f7","year":2014},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.422638Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:fc2f29d5c41f80828c974857e9e5774037fd67734d6f0c8ace7228b2cbf189bc","observation_id":"da16082a-a6d1-4d12-b985-e4804ce88ae9","resolution":{"observed_at":"2026-08-16T10:55:24.189748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:24.172455Z","title":"Parallel computation for well-endowed rings and space-bounded probabilistic machines","venue":null,"work_id":"f601c120-566a-4a09-9c69-60f6384d879b","year":1983},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.426346Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:c728565e72def939f7829de2f06cddd694305e675040746232e9be7dd1c0c7ad","observation_id":"226a4c59-eed9-4548-8d27-a57c4bf4bcb5","resolution":{"observed_at":"2026-08-16T10:55:24.176906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.07208","last_updated":"2024-11-22T14:15:20Z","snapshot_observed_at":"2026-08-18T03:36:59.711785Z","submitted_at":"2024-09-11T12:01:06Z","title":"Almost-catalytic Computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.07208","snapshot_observed_at":"2026-08-16T10:55:23.430214Z","title":"Almost-catalytic computation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.430214Z"},"links":{"cited_paper":"/paper/2409.07208","citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:a1f7c395452f1f30615037dd7ed4032b2138f646caa96c3610f4a76526428e07","observation_id":"7d234987-999a-4d27-a8bd-10d9f18db3c6","resolution":{"observed_at":"2026-08-16T10:55:23.430214Z","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-16T10:55:24.160769Z","title":"On pure space vs catalytic space","venue":null,"work_id":"f47720e8-bee4-4937-9979-214f0e465415","year":2022},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.433957Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:e24899a2ac0c53013ed3d0f38b0fce5fcd531665921577b3979c25906191fa48","observation_id":"588734cd-7fd5-4134-8a84-48dbbc5215e3","resolution":{"observed_at":"2026-08-16T10:55:24.164848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:24.148110Z","title":"The polynomial method in circuit complexity","venue":null,"work_id":"5f038bf4-0dd7-4bb4-b447-6ccd4f7713f9","year":1993},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.437407Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:5e26e40f293a8cf613c2bb249bade26f5aaa202e4bd1283ff7132ef2b6fd745c","observation_id":"8786d6d6-5afc-4465-9889-4e728fcf78e5","resolution":{"observed_at":"2026-08-16T10:55:24.152461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:24.134802Z","title":"Catalytic space: Non-determinism and hierarchy","venue":null,"work_id":"848be06f-06d7-4673-af0b-900a5370f126","year":2018},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.440898Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:253b9182cd34192131978aa7411688c90a2be78022fb93e4f01d0df622fb4615","observation_id":"1b4455e1-4922-4a2c-a8d0-f7fa34929b46","resolution":{"observed_at":"2026-08-16T10:55:24.139132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.989998Z","title":"On relating time and space to size and depth","venue":null,"work_id":"099e3d62-7af8-4845-bf10-cbbc30a7f9e3","year":1977},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.444279Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:d42a5360b8f9010bbf8b14b169dd205517bd0fb007f4af62fb72e36e4353c8ae","observation_id":"0691c130-021d-49c6-a132-b9ef01a80087","resolution":{"observed_at":"2026-08-16T10:55:24.126031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.980087Z","title":"Generators for certain alternating groups with applications to cryptography","venue":null,"work_id":"6468f257-df3a-4c18-a173-b411a19e47c7","year":1975},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.447866Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:8b7910696bc4ce1319a5b41ea3ede234226d56d182b22d198e614cdb38837522","observation_id":"a878ceec-b272-4bc7-a3ac-ebc217d725f4","resolution":{"observed_at":"2026-08-16T10:55:23.983558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.969288Z","title":"Computing algebraic formulas with a constant number of registers","venue":null,"work_id":"5f3da9cd-32d6-4653-af80-72e45cb9190e","year":1988},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.451418Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:657e3f6f264fcc70dd2e5914d1e328b7076a20c213393f99a6daa00ea130d72e","observation_id":"def4e2f6-29ad-43ce-88c9-8fc2e1cf923f","resolution":{"observed_at":"2026-08-16T10:55:23.972980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.958331Z","title":"Methodologies for designing block ciphers and cryptographic protocols","venue":null,"work_id":"201967e1-5c5a-40f4-8718-54f3da86fb1c","year":1990},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.454635Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:4f2d81fd66131cc87328c27a8544d9807428b4a4ae0647dc35ae542876bde8d0","observation_id":"0e415136-6d52-499b-adde-1b3c758e92e5","resolution":{"observed_at":"2026-08-16T10:55:23.961988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.947910Z","title":"The structure of catalytic space: Capturing randomness and time via compression","venue":null,"work_id":"b984b30d-3089-4e40-bee4-6616be1ec5b4","year":2024},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.457874Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:931a9404abaf6514c7ff61e274897731cb83c06e320ff0e0ecc35445d96a7a0a","observation_id":"6c150e39-dd49-402c-a52e-73a5750a189e","resolution":{"observed_at":"2026-08-16T10:55:23.951474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.937867Z","title":"Catalytic approaches to the tree evaluation problem","venue":null,"work_id":"e06539ed-b30a-4478-a260-10adb9c4bd82","year":2020},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.461260Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:81accb116198bbe3fff23f2df9dbb223674ae272a1b7926afbb262c17554d9d2","observation_id":"7dc0fb34-0d4b-4991-8934-a839d4774b87","resolution":{"observed_at":"2026-08-16T10:55:23.941209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.927713Z","title":"Encodings and the tree evaluation problem","venue":null,"work_id":"4bb63d23-da0a-4510-a9b9-bdf3f8c832a4","year":2021},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.464906Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:3fe1bcb61d63fdc74242299049285b8ae92874cea3fc5f957bce9a8d334e2064","observation_id":"d091e883-53c4-4d6a-9476-d15004d0370f","resolution":{"observed_at":"2026-08-16T10:55:23.931063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.917930Z","title":"Trading time and space in catalytic branching programs","venue":null,"work_id":"6fe8fde0-3856-403f-99e0-b8d07028dd30","year":2022},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.468539Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:6ff3ba4814592b3a769688feeaa38ce50962b8a353c9c82dd6a3321e53bec9b6","observation_id":"8668673e-befb-49bb-9503-4b0aabb9228c","resolution":{"observed_at":"2026-08-16T10:55:23.921284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.907960Z","title":"Tree evaluation is in space o (log n log log n)","venue":null,"work_id":"ae64d6a2-6437-4b1c-9c5d-fe3c95b47713","year":2023},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.472081Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:f9cbb05850325dcccd092ad6d67b9d4d57c481b0ccdc3802d634696db235428e","observation_id":"bfb92b5f-3851-4074-98b9-994f3923b28b","resolution":{"observed_at":"2026-08-16T10:55:23.911554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.897900Z","title":"Pebbles and branching programs for tree evaluation","venue":null,"work_id":"9c3a25d9-1259-46e4-b5a6-f685c13ba986","year":2012},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.475744Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:68ea90bf55ebd101c4cc41046179fb9f84446ed77dfee61a55ab3126a6ac0f37","observation_id":"9687155f-fe84-40b3-b3b9-f9b13d3b6689","resolution":{"observed_at":"2026-08-16T10:55:23.901523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.887917Z","title":"The classification of problems which have fast parallel algorithms","venue":null,"work_id":"a1376fc1-f3cc-4c16-9027-e91fad10cc88","year":1983},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.479302Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:e974086a036bd272d39938434d9137653eab893ca5f0473e9d472074029c5d2d","observation_id":"11a6449c-5aa3-43ae-b3aa-03a269678928","resolution":{"observed_at":"2026-08-16T10:55:23.891530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.877212Z","title":"Randomized and symmetric catalytic computation","venue":null,"work_id":"a07aa2d3-8909-4809-b373-783afd2d995b","year":2020},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.482702Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:1787817a880c775cb8a2c6748b11a734e41f44d456ddb059cb92d214e30e87b4","observation_id":"6d8a294b-e707-480b-8575-dd7487d97fbe","resolution":{"observed_at":"2026-08-16T10:55:23.880638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.867189Z","title":"Opening up the distinguisher: A hardness to randomness approach for bpl= l that uses properties of bpl","venue":null,"work_id":"e7c762b3-e6d1-4b03-876a-2c8ce4f873b1","year":2024},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.486183Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:c11a9d21eb7cc63c7cbc6576db8d33d6d08bbf8d524bddc76219de754f0e0e7d","observation_id":"c6004204-b025-4611-9265-b041b9c91abd","resolution":{"observed_at":"2026-08-16T10:55:23.870559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.857113Z","title":"Hardness of function composition for semantic read once branching programs","venue":null,"work_id":"72593094-d0b3-49bd-903b-b9314092480f","year":2018},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.489459Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:935ec1105be80860816ad0567cd4bb2ef4c0354f3a0f5247e8a579701c44cd8a","observation_id":"78b354eb-8146-4a1e-b756-f933364b73e4","resolution":{"observed_at":"2026-08-16T10:55:23.860590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05046","last_updated":"2024-09-08T10:07:56Z","snapshot_observed_at":"2026-08-16T13:20:26.588270Z","submitted_at":"2024-09-08T10:07:56Z","title":"Fully Characterizing Lossy Catalytic Computation","version":1},"cited_work":{"arxiv_id":"2409.05046","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.05046","snapshot_observed_at":"2026-08-16T10:55:23.640893Z","title":"Fully Characterizing Lossy Catalytic Computation","venue":"cs.CC","work_id":"a3defea7-25fd-4fa9-a3bd-adc08038333e","year":2024},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.492930Z"},"links":{"cited_paper":"/paper/2409.05046","citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:8c356f5732b0613d6532ea9494fbceed9cff059a4b510ea49286939b81487b36","observation_id":"e7f6ca2c-13c9-4717-a8a3-6447440c3a4a","resolution":{"observed_at":"2026-08-16T10:55:23.645131Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.846114Z","title":"Unambiguous catalytic computation","venue":null,"work_id":"18f26cde-dbeb-4cba-a237-07c163e4b4a4","year":2019},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.496672Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:448bfb5a277f8c6946ce0ed9121ac93c4c12d1f69698ce46026cdda5eac72baf","observation_id":"2de37dcf-c890-4432-9590-8904cacbdb4e","resolution":{"observed_at":"2026-08-16T10:55:23.849745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14670","last_updated":"2024-08-26T22:25:30Z","snapshot_observed_at":"2026-08-20T23:04:42.824220Z","submitted_at":"2024-08-26T22:25:30Z","title":"Lossy Catalytic Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14670","snapshot_observed_at":"2026-08-16T10:55:23.499996Z","title":"Lossy catalytic computation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.499996Z"},"links":{"cited_paper":"/paper/2408.14670","citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:558bcbf930dde2046cea6843e2c4e74230f23c474cfc48f38ee269ee35de3249","observation_id":"af919f27-41ca-4d91-9d57-27fa78ea8265","resolution":{"observed_at":"2026-08-16T10:55:23.499996Z","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-16T10:55:23.834312Z","title":"Solving tree evaluation in o (log n log log n) space","venue":null,"work_id":"505afd0b-699a-4e70-be1b-ef9fba68c282","year":2024},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.504080Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:b2907a3fea7053d4a56c7afd2cb718a07049bd3adda02c98046b793b788338ca","observation_id":"e837abf3-21ca-4b16-9690-9efec85633d4","resolution":{"observed_at":"2026-08-16T10:55:23.838428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.822030Z","title":"Read-once branching programs for tree evaluation problems","venue":null,"work_id":"8f72a021-efab-47b8-96a1-56253fa63aeb","year":2018},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.507494Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:1ef1b94d9bbabf81a169dc7ce27ef41bc210520d5fdf535560535be13321c1a7","observation_id":"410d7b21-da13-473e-aa15-b366ca569d7e","resolution":{"observed_at":"2026-08-16T10:55:23.826065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.811109Z","title":"Catalytic computation","venue":null,"work_id":"6ebe07cb-0311-423b-ba1b-332ca3ad464a","year":2016},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.510990Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:bb89f9890182575d72ca5b5daf64fa05dcb987bb828fd2096e95363450675165","observation_id":"4f627717-25f2-422e-a660-38bd9aa04666","resolution":{"observed_at":"2026-08-16T10:55:23.814652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.799782Z","title":"Collapsing catalytic classes","venue":null,"work_id":"75e71c7e-e433-484d-a1c4-e0213afd2dec","year":2025},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.514845Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:2e4ef61b54815998bfb725bae863bc1d8517831bf0deb3ead79514b451905cfa","observation_id":"30144dd0-5f98-44d5-8ec7-c42e3b66f090","resolution":{"observed_at":"2026-08-16T10:55:23.803624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.0293","last_updated":"2013-11-01T20:13:47Z","snapshot_observed_at":"2026-08-20T23:04:47.803786Z","submitted_at":"2013-11-01T20:13:47Z","title":"Pebbling Arguments for Tree Evaluation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.0293","snapshot_observed_at":"2026-08-16T10:55:23.518334Z","title":"Pebbling arguments for tree evaluation","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.518334Z"},"links":{"cited_paper":"/paper/1311.0293","citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:227f842351859b960ebd03ecc2aeebe9f6310d525ebd442b64096d09d9b1000e","observation_id":"dd174826-4268-4761-9b18-5909ae264bce","resolution":{"observed_at":"2026-08-16T10:55:23.518334Z","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-16T10:55:23.787847Z","title":"Distinguishing, predicting, and certifying: On the long reach of partial notions of pseudorandomness","venue":null,"work_id":"e3cf28d4-4c22-4f59-91ef-455dcbd7a5cf","year":2024},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.522010Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:56402bca7566a1fefe2fa3de402ddfaa27cdd3fd6c296ba559206efaec1f0a91","observation_id":"9305958c-b839-4589-85ad-7bb655f5d2c8","resolution":{"observed_at":"2026-08-16T10:55:23.791774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.776400Z","title":"Catalytic computing, tree evaluation, & clean computation, 2020","venue":null,"work_id":"6b3bd1c1-9ae3-4b9b-84ef-cfcb0e7de20d","year":2020},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.525782Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:dc023015b377582a674455c09bcc0f806a6cdbaf8c865845f15d7575c659bd1a","observation_id":"c901a2c5-8042-4e57-9370-08fac359206a","resolution":{"observed_at":"2026-08-16T10:55:23.780392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.529711Z","title":"Reusing space: Techniques and open problems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.529711Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:27d13060710b1f284db58ee63fd171c43bd1c87b5fabe56f10c7d442fac99898","observation_id":"03edc7e8-57a7-47de-95b2-dc89b1a1bc45","resolution":{"observed_at":"2026-08-16T10:55:23.529711Z","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-16T10:55:23.758993Z","title":"On simultaneous resource bounds","venue":null,"work_id":"ae6db87d-3f26-4c99-8765-277ec7b5fbf0","year":1979},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.533890Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:4abc1bcc98ea03486917986c092db17affc8737f91d73640a82f927c7b74ab4e","observation_id":"94ec5714-b2bb-4e1f-9b1f-1e64cc8f48d8","resolution":{"observed_at":"2026-08-16T10:55:23.762824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06632","last_updated":"2017-02-22T01:36:14Z","snapshot_observed_at":"2026-08-20T23:04:50.161311Z","submitted_at":"2016-11-21T01:58:12Z","title":"A Note on Amortized Branching Program Complexity","version":2},"cited_work":{"arxiv_id":"1611.06632","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.06632","snapshot_observed_at":"2026-08-16T10:55:23.599763Z","title":"A Note on Amortized Branching Program Complexity","venue":"cs.CC","work_id":"60ec5ac1-a1ac-4393-8ae4-7e45d126c813","year":2016},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.537457Z"},"links":{"cited_paper":"/paper/1611.06632","citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:e36404376487feda676a5f115bb8cb5e09832b02e99bb85b97c68811a4f9945c","observation_id":"e2bd8014-ebe3-49c7-ab29-e1d5be008b39","resolution":{"observed_at":"2026-08-16T10:55:23.605587Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.748250Z","title":"Sheffield, and William Wang","venue":null,"work_id":"445105fb-6c76-46e0-8986-71e9d9d05f49","year":2025},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.541365Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:40aa788b7a386d6ab132a5d984fc0af80e60af3f92669a11d456b19c7658c5d2","observation_id":"444fcbd1-6522-43bb-b75a-10f9e90992ad","resolution":{"observed_at":"2026-08-16T10:55:23.752050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.736958Z","title":"Derandomizing logspace with a small shared hard drive","venue":null,"work_id":"b19d16f3-b3fe-4983-a6da-7d3cb3d7765c","year":2024},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.545431Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:046078ae1d031ac25b00df485bce3b7f28a454148912d2526899dec0fd685d4e","observation_id":"0e650bb2-fcbe-4741-be97-5212670be9ba","resolution":{"observed_at":"2026-08-16T10:55:23.741106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.725802Z","title":"On uniform circuit complexity","venue":null,"work_id":"1e2e7b49-2be6-4da4-8a8c-d8e928f252cd","year":1981},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.548990Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:784d8d771eb90e9a87608aa493348db8a299f2aa6c9e58b2d914f25b0729a9ee","observation_id":"100806c5-f695-41ea-999b-7f55cabc49fc","resolution":{"observed_at":"2026-08-16T10:55:23.729239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.714675Z","title":"Amortized circuit complexity, formal complexity measures, and catalytic algorithms","venue":null,"work_id":"0957c1a4-c527-4179-a448-d9bb92423bef","year":2021},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.552569Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:91112025e5fb4dd4f4ff41614ddcac75dd76d6f10e9c1c2f582da69c605d4872","observation_id":"d3078b90-5bcb-43d3-a1bc-958367d2a11f","resolution":{"observed_at":"2026-08-16T10:55:23.718283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.703006Z","title":"On a decomposition of polynomials in several variables","venue":null,"work_id":"23ed7e60-fb35-4007-890a-26c44ddb57f8","year":2002},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.556212Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:5ac3fa9ef0a798270ac3dc87a914c1ec5784005e0297161bc213bf44061429e5","observation_id":"a52d6b7a-0251-49d0-90de-f0d40619066b","resolution":{"observed_at":"2026-08-16T10:55:23.706626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.691767Z","title":"The synthesis of two-terminal switching circuits","venue":null,"work_id":"2e4cf5a7-fd73-48f5-9457-c116ae36ea6a","year":1949},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.559901Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:1ccf1efac3c7f821c0406afce70eb70fa92573e41ca13c34ad751c5819eba887","observation_id":"b8cfd27c-164f-4e71-a7c3-fb18268a0f3f","resolution":{"observed_at":"2026-08-16T10:55:23.695468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.680803Z","title":"Circuit definitions of nondeterministic complexity classes","venue":null,"work_id":"d88bbb64-d00f-43fc-a0ce-c02abb0f1dff","year":1992},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.563522Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:dc9fd3af6242e96bee44a4eec22d909d080ed956552f860590283a4e56d1ec9d","observation_id":"e0f3b789-a448-43a9-82dd-b9d9f0e8445a","resolution":{"observed_at":"2026-08-16T10:55:23.684449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:55:23.566878Z","title":"Introduction to circuit complexity: a uniform approach","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.566878Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:7898596d6d298f93316fc2a7f018889a8eb14f303eb104f27f038b0c4df0d22d","observation_id":"75a68fd8-1f83-4c1e-9e8a-d62cd9a45e41","resolution":{"observed_at":"2026-08-16T10:55:23.566878Z","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-16T10:55:23.664759Z","title":"Simulating time with square-root space","venue":null,"work_id":"b6e0f4af-5557-4287-9de8-b15cf8349e88","year":2025},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.570399Z"},"links":{"citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:1fa9226ae759f65a7018974113039f7ddebd7f778e09d43637128214a65c1dd2","observation_id":"a9037d88-df7e-41ec-b485-2b65908f11ba","resolution":{"observed_at":"2026-08-16T10:55:23.668248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":39},"total_outbound_references":46},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 1 inbound Pith citation observation for arXiv:2504.17412."}