{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E4SF7K3QXA7YX2IOA3AHYPUM2P","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":"d33992d56dc440fd8795c34f847073c3dc55eadd5d488b6234c43ccfcff30091","cross_cats_sorted":["cs.AI","math.IT","physics.comp-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-04-21T13:36:33Z","title_canon_sha256":"54620ad6508e8e8b7ec1c73d34e6ace4cb536fae8ad8f5cfae6388b887a30f13"},"schema_version":"1.0","source":{"id":"2604.20897","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.20897","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"2604.20897v2","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.20897","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"E4SF7K3QXA7Y","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"pith_short_16","alias_value":"E4SF7K3QXA7YX2IO","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"pith_short_8","alias_value":"E4SF7K3Q","created_at":"2026-06-09T01:05:17Z"}],"graph_snapshots":[{"event_id":"sha256:82d6ccb79db3f5d2498be15e07f554fd046a606c59656584c51f456abb98a4ce","target":"graph","created_at":"2026-06-09T01:05:17Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that any class-specific speed-up is upper-bounded by the algorithmic mutual information between the substrate and the class descriptor, and that installing this information incurs a minimum thermodynamic cost via Landauer erasure. Combining these results yields a coupling theorem that lower-bounds the deployment horizon required for a catalyst to be energetically favourable."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That reusable computational structures exist which satisfy bounded restoration and structural selectivity constraints for the task class while allowing the mutual information bound to be achieved in practice."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Reusable algorithmic structures (catalysts) for task classes yield speed-ups upper-bounded by mutual information, with minimum thermodynamic installation costs via Landauer erasure and a lower bound on favorable deployment time."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Reusable computational structures bound any class-specific speed-up by the algorithmic mutual information between substrate and task descriptor, at a minimum energy cost from Landauer erasure."}],"snapshot_sha256":"9c8a13e9e5ce9a79826c9bc01670172b0edab80803faf6fbca87e95e152aa828"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T02:55:42.371579Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.20897/integrity.json","findings":[],"snapshot_sha256":"22e38d9894795f0e8ee6f72f7cce30cb3870a40671d38f6849a44fb92828e209","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop a thermodynamic theory of algorithmic catalysis within the watts per intelligence framework, identifying reusable computational structures that reduce irreversible operations for a task class while satisfying bounded restoration and structural selectivity constraints. We prove that any class specific speed-up is upper-bounded by the algorithmic mutual information between the substrate and the class descriptor, and that encoding this information incurs a minimum thermodynamic cost via Landauer erasure. Combining these results yields a coupling theorem that lower-bounds the deployment","authors_text":"Elija Perrier","cross_cats":["cs.AI","math.IT","physics.comp-ph"],"headline":"Reusable computational structures bound any class-specific speed-up by the algorithmic mutual information between substrate and task descriptor, at a minimum energy cost from Landauer erasure.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-04-21T13:36:33Z","title":"Watts-per-Intelligence Part II: Algorithmic Catalysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.20897","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T01:25:04.870553Z","id":"ff564eff-dd2f-4eb7-8fd9-4422a8654ba8","model_set":{"reader":"grok-4.3"},"one_line_summary":"Reusable algorithmic structures (catalysts) for task classes yield speed-ups upper-bounded by mutual information, with minimum thermodynamic installation costs via Landauer erasure and a lower bound on favorable deployment time.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Reusable computational structures bound any class-specific speed-up by the algorithmic mutual information between substrate and task descriptor, at a minimum energy cost from Landauer erasure.","strongest_claim":"We prove that any class-specific speed-up is upper-bounded by the algorithmic mutual information between the substrate and the class descriptor, and that installing this information incurs a minimum thermodynamic cost via Landauer erasure. Combining these results yields a coupling theorem that lower-bounds the deployment horizon required for a catalyst to be energetically favourable.","weakest_assumption":"That reusable computational structures exist which satisfy bounded restoration and structural selectivity constraints for the task class while allowing the mutual information bound to be achieved in practice."}},"verdict_id":"ff564eff-dd2f-4eb7-8fd9-4422a8654ba8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7e96f84e1ce49e724e6188a69e1997ff25b6a2f14c5e096ec534fffae6145174","target":"record","created_at":"2026-06-09T01:05:17Z","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":"d33992d56dc440fd8795c34f847073c3dc55eadd5d488b6234c43ccfcff30091","cross_cats_sorted":["cs.AI","math.IT","physics.comp-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-04-21T13:36:33Z","title_canon_sha256":"54620ad6508e8e8b7ec1c73d34e6ace4cb536fae8ad8f5cfae6388b887a30f13"},"schema_version":"1.0","source":{"id":"2604.20897","kind":"arxiv","version":2}},"canonical_sha256":"27245fab70b83f8be90e06c07c3e8cd3e7e49a47619c0a09d0c3ce5448977274","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27245fab70b83f8be90e06c07c3e8cd3e7e49a47619c0a09d0c3ce5448977274","first_computed_at":"2026-06-09T01:05:17.666310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:17.666310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7CXJIh1BBxdeBQHi/EKCxaIqqObL6sjHkl5rbF+DBKpHpEel19HfjUt5CYtX/SrkEr1aPa2UoiTwkmLz45OuCA==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:17.666791Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.20897","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e96f84e1ce49e724e6188a69e1997ff25b6a2f14c5e096ec534fffae6145174","sha256:82d6ccb79db3f5d2498be15e07f554fd046a606c59656584c51f456abb98a4ce"],"state_sha256":"8042d5628eaf8f4c5d9386419727afd6f9f62b58e72c165f54a345a7ae63c063"}