{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RMCXDX26LZE6S75ETJYYVVHHBA","short_pith_number":"pith:RMCXDX26","schema_version":"1.0","canonical_sha256":"8b0571df5e5e49e97fa49a718ad4e7080728dde4dd7b671515f86b9f0d34f473","source":{"kind":"arxiv","id":"2504.17412","version":1},"attestation_state":"computed","paper":{"title":"Catalytic Computing and Register Programs Beyond Log-Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Smal, Antoine Vinciguerra, Ian Mertz, Yaroslav Alekseev, Yuval Filmus","submitted_at":"2025-04-24T10:09:33Z","abstract_excerpt":"In a seminal work, Buhrman et al. (STOC 2014) defined the class $CSPACE(s,c)$ of problems solvable in space $s$ with an additional catalytic tape of size $c$, which is a tape whose initial content must be restored at the end of the computation. They showed that uniform $TC^1$ circuits are computable in catalytic logspace, i.e., $CL=CSPACE(O(\\log{n}), 2^{O(\\log{n})})$, thus giving strong evidence that catalytic space gives $L$ strict additional power. Their study focuses on an arithmetic model called register programs, which has been a focal point in development since then.\n  Understanding $CL$"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2504.17412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-04-24T10:09:33Z","cross_cats_sorted":[],"title_canon_sha256":"08d1f35bd5edb2f72b9b920b461e1070452127fd68741873cb994e8e066c0045","abstract_canon_sha256":"bd1b427c665f7ed1fd5262497b6a63ed3888405f9d70e6882a81f7bcad0b7254"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:28.238646Z","signature_b64":"/f1lWjt5zSFMmoUhJuFv5lvNpuMB1nsBNfkGogXIoRX4QMbMeRq2c5nzoTlaPTMWS1GkN5cakQy7zX2LYXayBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b0571df5e5e49e97fa49a718ad4e7080728dde4dd7b671515f86b9f0d34f473","last_reissued_at":"2026-07-05T10:53:28.238127Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:28.238127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Catalytic Computing and Register Programs Beyond Log-Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Smal, Antoine Vinciguerra, Ian Mertz, Yaroslav Alekseev, Yuval Filmus","submitted_at":"2025-04-24T10:09:33Z","abstract_excerpt":"In a seminal work, Buhrman et al. (STOC 2014) defined the class $CSPACE(s,c)$ of problems solvable in space $s$ with an additional catalytic tape of size $c$, which is a tape whose initial content must be restored at the end of the computation. They showed that uniform $TC^1$ circuits are computable in catalytic logspace, i.e., $CL=CSPACE(O(\\log{n}), 2^{O(\\log{n})})$, thus giving strong evidence that catalytic space gives $L$ strict additional power. Their study focuses on an arithmetic model called register programs, which has been a focal point in development since then.\n  Understanding $CL$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17412","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.17412/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.17412","created_at":"2026-07-05T10:53:28.238187+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17412v1","created_at":"2026-07-05T10:53:28.238187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17412","created_at":"2026-07-05T10:53:28.238187+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMCXDX26LZE6","created_at":"2026-07-05T10:53:28.238187+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMCXDX26LZE6S75E","created_at":"2026-07-05T10:53:28.238187+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMCXDX26","created_at":"2026-07-05T10:53:28.238187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06435","citing_title":"Linear Matroid Intersection is in Catalytic Logspace","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMCXDX26LZE6S75ETJYYVVHHBA","json":"https://pith.science/pith/RMCXDX26LZE6S75ETJYYVVHHBA.json","graph_json":"https://pith.science/api/pith-number/RMCXDX26LZE6S75ETJYYVVHHBA/graph.json","events_json":"https://pith.science/api/pith-number/RMCXDX26LZE6S75ETJYYVVHHBA/events.json","paper":"https://pith.science/paper/RMCXDX26"},"agent_actions":{"view_html":"https://pith.science/pith/RMCXDX26LZE6S75ETJYYVVHHBA","download_json":"https://pith.science/pith/RMCXDX26LZE6S75ETJYYVVHHBA.json","view_paper":"https://pith.science/paper/RMCXDX26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17412&json=true","fetch_graph":"https://pith.science/api/pith-number/RMCXDX26LZE6S75ETJYYVVHHBA/graph.json","fetch_events":"https://pith.science/api/pith-number/RMCXDX26LZE6S75ETJYYVVHHBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMCXDX26LZE6S75ETJYYVVHHBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMCXDX26LZE6S75ETJYYVVHHBA/action/storage_attestation","attest_author":"https://pith.science/pith/RMCXDX26LZE6S75ETJYYVVHHBA/action/author_attestation","sign_citation":"https://pith.science/pith/RMCXDX26LZE6S75ETJYYVVHHBA/action/citation_signature","submit_replication":"https://pith.science/pith/RMCXDX26LZE6S75ETJYYVVHHBA/action/replication_record"}},"created_at":"2026-07-05T10:53:28.238187+00:00","updated_at":"2026-07-05T10:53:28.238187+00:00"}