{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JZ6JP5JM57ZHFFI7SVTVHIYUWD","short_pith_number":"pith:JZ6JP5JM","schema_version":"1.0","canonical_sha256":"4e7c97f52ceff272951f956753a314b0e2cf5e86a3cec12098152f82b4889fdc","source":{"kind":"arxiv","id":"2509.06209","version":1},"attestation_state":"computed","paper":{"title":"Efficient Catalytic Graph Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Edward Pyne, James Cook","submitted_at":"2025-09-07T21:14:13Z","abstract_excerpt":"We give fast, simple, and implementable catalytic logspace algorithms for two fundamental graph problems.\n  First, a randomized catalytic algorithm for $s\\to t$ connectivity running in $\\widetilde{O}(nm)$ time, and a deterministic catalytic algorithm for the same running in $\\widetilde{O}(n^3 m)$ time. The former algorithm is the first algorithmic use of randomization in $\\mathsf{CL}$. The algorithm uses one register per vertex and repeatedly ``pushes'' values along the edges in the graph.\n  Second, a deterministic catalytic algorithm for simulating random walks which in $\\widetilde{O}( m T^2 "},"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":"2509.06209","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-07T21:14:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1fa4f2d25159d92c6a4905cfae094588f6bdf3087a7f65ba54678bd8b9f952a5","abstract_canon_sha256":"6a93a620060ab32ee963c990dc2650657f14e383696b1b15f860a5e6d74e2262"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:31.861785Z","signature_b64":"Uvpqe2MexkkqTlViSVXmwVK5Su2UBGmg0uDGRD49OTkzsE9dNDm3nGw/LWZ/1DF99d5SlLq3J6I8N8ZYhu1+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e7c97f52ceff272951f956753a314b0e2cf5e86a3cec12098152f82b4889fdc","last_reissued_at":"2026-07-05T12:06:31.861303Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:31.861303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Catalytic Graph Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Edward Pyne, James Cook","submitted_at":"2025-09-07T21:14:13Z","abstract_excerpt":"We give fast, simple, and implementable catalytic logspace algorithms for two fundamental graph problems.\n  First, a randomized catalytic algorithm for $s\\to t$ connectivity running in $\\widetilde{O}(nm)$ time, and a deterministic catalytic algorithm for the same running in $\\widetilde{O}(n^3 m)$ time. The former algorithm is the first algorithmic use of randomization in $\\mathsf{CL}$. The algorithm uses one register per vertex and repeatedly ``pushes'' values along the edges in the graph.\n  Second, a deterministic catalytic algorithm for simulating random walks which in $\\widetilde{O}( m T^2 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06209","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/2509.06209/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":"2509.06209","created_at":"2026-07-05T12:06:31.861363+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.06209v1","created_at":"2026-07-05T12:06:31.861363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06209","created_at":"2026-07-05T12:06:31.861363+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZ6JP5JM57ZH","created_at":"2026-07-05T12:06:31.861363+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZ6JP5JM57ZHFFI7","created_at":"2026-07-05T12:06:31.861363+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZ6JP5JM","created_at":"2026-07-05T12:06:31.861363+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JZ6JP5JM57ZHFFI7SVTVHIYUWD","json":"https://pith.science/pith/JZ6JP5JM57ZHFFI7SVTVHIYUWD.json","graph_json":"https://pith.science/api/pith-number/JZ6JP5JM57ZHFFI7SVTVHIYUWD/graph.json","events_json":"https://pith.science/api/pith-number/JZ6JP5JM57ZHFFI7SVTVHIYUWD/events.json","paper":"https://pith.science/paper/JZ6JP5JM"},"agent_actions":{"view_html":"https://pith.science/pith/JZ6JP5JM57ZHFFI7SVTVHIYUWD","download_json":"https://pith.science/pith/JZ6JP5JM57ZHFFI7SVTVHIYUWD.json","view_paper":"https://pith.science/paper/JZ6JP5JM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.06209&json=true","fetch_graph":"https://pith.science/api/pith-number/JZ6JP5JM57ZHFFI7SVTVHIYUWD/graph.json","fetch_events":"https://pith.science/api/pith-number/JZ6JP5JM57ZHFFI7SVTVHIYUWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZ6JP5JM57ZHFFI7SVTVHIYUWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZ6JP5JM57ZHFFI7SVTVHIYUWD/action/storage_attestation","attest_author":"https://pith.science/pith/JZ6JP5JM57ZHFFI7SVTVHIYUWD/action/author_attestation","sign_citation":"https://pith.science/pith/JZ6JP5JM57ZHFFI7SVTVHIYUWD/action/citation_signature","submit_replication":"https://pith.science/pith/JZ6JP5JM57ZHFFI7SVTVHIYUWD/action/replication_record"}},"created_at":"2026-07-05T12:06:31.861363+00:00","updated_at":"2026-07-05T12:06:31.861363+00:00"}