{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ATNUY4IANJZSRIAE2XJQGIKOA7","short_pith_number":"pith:ATNUY4IA","canonical_record":{"source":{"id":"2409.07208","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-09-11T12:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"056a3126d1017a5f4e5395d1f3237bed445aa3247176e0b6c48b84b750e54fe8","abstract_canon_sha256":"0160cc4993c556905673b4ac7379697da5a6d96cf805fc53442048cbec615207"},"schema_version":"1.0"},"canonical_sha256":"04db4c71006a7328a004d5d303214e07ea11ba217ffb4bdf65d93c6722797bbc","source":{"kind":"arxiv","id":"2409.07208","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.07208","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"2409.07208v2","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.07208","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"ATNUY4IANJZS","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"pith_short_16","alias_value":"ATNUY4IANJZSRIAE","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"pith_short_8","alias_value":"ATNUY4IA","created_at":"2026-07-05T09:39:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ATNUY4IANJZSRIAE2XJQGIKOA7","target":"record","payload":{"canonical_record":{"source":{"id":"2409.07208","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-09-11T12:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"056a3126d1017a5f4e5395d1f3237bed445aa3247176e0b6c48b84b750e54fe8","abstract_canon_sha256":"0160cc4993c556905673b4ac7379697da5a6d96cf805fc53442048cbec615207"},"schema_version":"1.0"},"canonical_sha256":"04db4c71006a7328a004d5d303214e07ea11ba217ffb4bdf65d93c6722797bbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:09.107890Z","signature_b64":"UoEc4iSl/G2C3hyuyLEvOBBmx+w7CjTjgo2r55vdF3riWXcFvBNQMrSOguxnCUG3my2wSL69NOh4qb1/sZSGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04db4c71006a7328a004d5d303214e07ea11ba217ffb4bdf65d93c6722797bbc","last_reissued_at":"2026-07-05T09:39:09.107413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:09.107413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.07208","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCUzLGVHYiD/jfGuF02wRZjXHD3EawUhU6Q4OG/eztqxleNKVCTjdZlMUnJCJ8B5YPeq0J8RtvKn+AwI9iCBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:16:50.095654Z"},"content_sha256":"76d02bb9d189a9de18b8f9a2dea0ec6a978d6b262fd489a130ec3c14a0eefe92","schema_version":"1.0","event_id":"sha256:76d02bb9d189a9de18b8f9a2dea0ec6a978d6b262fd489a130ec3c14a0eefe92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ATNUY4IANJZSRIAE2XJQGIKOA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost-catalytic Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bhabya Deep Rai, Jayalal Sarma, Krishnamoorthy Dinesh, Sagar Bisoyi","submitted_at":"2024-09-11T12:01:06Z","abstract_excerpt":"Designing algorithms for space bounded models with restoration requirements on the space used by the algorithm is an important challenge posed about the catalytic computation model introduced by Buhrman et al. (2014). Motivated by the scenarios where we do not need to restore unless is useful, we define $ACL(A)$ to be the class of languages that can be accepted by almost-catalytic Turing machines with respect to $A$ (which we call the catalytic set), that uses at most $c\\log n$ work space and $n^c$ catalytic space.\n  We show that if there are almost-catalytic algorithms for a problem with cata"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.07208","kind":"arxiv","version":2},"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/2409.07208/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7QkyiEokgY22SHOYSJw6KTbnlAiehJOtiYoMfkx+xYuxNYuHlJOMQTpmW0r5ifYDabFDPsiOf0kDemFLLY3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:16:50.096574Z"},"content_sha256":"3f36ee9e6c0880954ff509e5d660fe3aa2e0978b52b013bc88918bb7a5ac5e9f","schema_version":"1.0","event_id":"sha256:3f36ee9e6c0880954ff509e5d660fe3aa2e0978b52b013bc88918bb7a5ac5e9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATNUY4IANJZSRIAE2XJQGIKOA7/bundle.json","state_url":"https://pith.science/pith/ATNUY4IANJZSRIAE2XJQGIKOA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATNUY4IANJZSRIAE2XJQGIKOA7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T09:16:50Z","links":{"resolver":"https://pith.science/pith/ATNUY4IANJZSRIAE2XJQGIKOA7","bundle":"https://pith.science/pith/ATNUY4IANJZSRIAE2XJQGIKOA7/bundle.json","state":"https://pith.science/pith/ATNUY4IANJZSRIAE2XJQGIKOA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATNUY4IANJZSRIAE2XJQGIKOA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ATNUY4IANJZSRIAE2XJQGIKOA7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0160cc4993c556905673b4ac7379697da5a6d96cf805fc53442048cbec615207","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-09-11T12:01:06Z","title_canon_sha256":"056a3126d1017a5f4e5395d1f3237bed445aa3247176e0b6c48b84b750e54fe8"},"schema_version":"1.0","source":{"id":"2409.07208","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.07208","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"2409.07208v2","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.07208","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"ATNUY4IANJZS","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"pith_short_16","alias_value":"ATNUY4IANJZSRIAE","created_at":"2026-07-05T09:39:09Z"},{"alias_kind":"pith_short_8","alias_value":"ATNUY4IA","created_at":"2026-07-05T09:39:09Z"}],"graph_snapshots":[{"event_id":"sha256:3f36ee9e6c0880954ff509e5d660fe3aa2e0978b52b013bc88918bb7a5ac5e9f","target":"graph","created_at":"2026-07-05T09:39:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.07208/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Designing algorithms for space bounded models with restoration requirements on the space used by the algorithm is an important challenge posed about the catalytic computation model introduced by Buhrman et al. (2014). Motivated by the scenarios where we do not need to restore unless is useful, we define $ACL(A)$ to be the class of languages that can be accepted by almost-catalytic Turing machines with respect to $A$ (which we call the catalytic set), that uses at most $c\\log n$ work space and $n^c$ catalytic space.\n  We show that if there are almost-catalytic algorithms for a problem with cata","authors_text":"Bhabya Deep Rai, Jayalal Sarma, Krishnamoorthy Dinesh, Sagar Bisoyi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-09-11T12:01:06Z","title":"Almost-catalytic Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.07208","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:76d02bb9d189a9de18b8f9a2dea0ec6a978d6b262fd489a130ec3c14a0eefe92","target":"record","created_at":"2026-07-05T09:39:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0160cc4993c556905673b4ac7379697da5a6d96cf805fc53442048cbec615207","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-09-11T12:01:06Z","title_canon_sha256":"056a3126d1017a5f4e5395d1f3237bed445aa3247176e0b6c48b84b750e54fe8"},"schema_version":"1.0","source":{"id":"2409.07208","kind":"arxiv","version":2}},"canonical_sha256":"04db4c71006a7328a004d5d303214e07ea11ba217ffb4bdf65d93c6722797bbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04db4c71006a7328a004d5d303214e07ea11ba217ffb4bdf65d93c6722797bbc","first_computed_at":"2026-07-05T09:39:09.107413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:09.107413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UoEc4iSl/G2C3hyuyLEvOBBmx+w7CjTjgo2r55vdF3riWXcFvBNQMrSOguxnCUG3my2wSL69NOh4qb1/sZSGDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:09.107890Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.07208","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76d02bb9d189a9de18b8f9a2dea0ec6a978d6b262fd489a130ec3c14a0eefe92","sha256:3f36ee9e6c0880954ff509e5d660fe3aa2e0978b52b013bc88918bb7a5ac5e9f"],"state_sha256":"67133cd2cb12b18f92a971db669ed5d53b863da322dca37662d6e106c7e7d33a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ntdC860bem1aOU0KSdE5oOxi2+cF3giFRFHbOe5//pUo3snG6QI6Wzd/6ZI1IwluNY5luf+5D01bpvLCPqCAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T09:16:50.102993Z","bundle_sha256":"5ee9f6093c9af4bd51a19ff27648efd9c39d282e85a419ec163f6b9b73b579bf"}}