{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4CHGDUKR2QM2S2RIB424NSDVZ7","short_pith_number":"pith:4CHGDUKR","schema_version":"1.0","canonical_sha256":"e08e61d151d419a96a280f35c6c875cfe4006e08d0f57c795185c7eae69c3d54","source":{"kind":"arxiv","id":"2410.08025","version":3},"attestation_state":"computed","paper":{"title":"The Computational Complexity of Circuit Discovery for Inner Interpretability","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC","q-bio.NC"],"primary_cat":"cs.AI","authors_text":"Federico Adolfi, Martina G. Vilas, Todd Wareham","submitted_at":"2024-10-10T15:22:48Z","abstract_excerpt":"Many proposed applications of neural networks in machine learning, cognitive/brain science, and society hinge on the feasibility of inner interpretability via circuit discovery. This calls for empirical and theoretical explorations of viable algorithmic options. Despite advances in the design and testing of heuristics, there are concerns about their scalability and faithfulness at a time when we lack understanding of the complexity properties of the problems they are deployed to solve. To address this, we study circuit discovery with classical and parameterized computational complexity theory:"},"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":"2410.08025","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-10T15:22:48Z","cross_cats_sorted":["cs.CC","q-bio.NC"],"title_canon_sha256":"1db516fd2ae509ec12fb9e6b3cc272a2cdd0a71b180ea1d508fb7568341a5f41","abstract_canon_sha256":"422083823e26a2850f6974902eee9c9cb59e61aa8514c91ac29c165f0b711167"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:42:37.886890Z","signature_b64":"M3A+LeyO6uznR60zJCVPXe43wHsIduyw/JG4fGDuN3WpG6b0hjpioQjNxGP1HWifknS4Rm4MYcizLEyg39f1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e08e61d151d419a96a280f35c6c875cfe4006e08d0f57c795185c7eae69c3d54","last_reissued_at":"2026-07-05T10:42:37.886397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:42:37.886397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Complexity of Circuit Discovery for Inner Interpretability","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC","q-bio.NC"],"primary_cat":"cs.AI","authors_text":"Federico Adolfi, Martina G. Vilas, Todd Wareham","submitted_at":"2024-10-10T15:22:48Z","abstract_excerpt":"Many proposed applications of neural networks in machine learning, cognitive/brain science, and society hinge on the feasibility of inner interpretability via circuit discovery. This calls for empirical and theoretical explorations of viable algorithmic options. Despite advances in the design and testing of heuristics, there are concerns about their scalability and faithfulness at a time when we lack understanding of the complexity properties of the problems they are deployed to solve. To address this, we study circuit discovery with classical and parameterized computational complexity theory:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08025","kind":"arxiv","version":3},"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/2410.08025/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":"2410.08025","created_at":"2026-07-05T10:42:37.886456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.08025v3","created_at":"2026-07-05T10:42:37.886456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08025","created_at":"2026-07-05T10:42:37.886456+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CHGDUKR2QM2","created_at":"2026-07-05T10:42:37.886456+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CHGDUKR2QM2S2RI","created_at":"2026-07-05T10:42:37.886456+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CHGDUKR","created_at":"2026-07-05T10:42:37.886456+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29346","citing_title":"Reliability, Faithfulness, and the Limits of Post-hoc Explanations of Opaque Scientific Models","ref_index":147,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4CHGDUKR2QM2S2RIB424NSDVZ7","json":"https://pith.science/pith/4CHGDUKR2QM2S2RIB424NSDVZ7.json","graph_json":"https://pith.science/api/pith-number/4CHGDUKR2QM2S2RIB424NSDVZ7/graph.json","events_json":"https://pith.science/api/pith-number/4CHGDUKR2QM2S2RIB424NSDVZ7/events.json","paper":"https://pith.science/paper/4CHGDUKR"},"agent_actions":{"view_html":"https://pith.science/pith/4CHGDUKR2QM2S2RIB424NSDVZ7","download_json":"https://pith.science/pith/4CHGDUKR2QM2S2RIB424NSDVZ7.json","view_paper":"https://pith.science/paper/4CHGDUKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.08025&json=true","fetch_graph":"https://pith.science/api/pith-number/4CHGDUKR2QM2S2RIB424NSDVZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/4CHGDUKR2QM2S2RIB424NSDVZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CHGDUKR2QM2S2RIB424NSDVZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CHGDUKR2QM2S2RIB424NSDVZ7/action/storage_attestation","attest_author":"https://pith.science/pith/4CHGDUKR2QM2S2RIB424NSDVZ7/action/author_attestation","sign_citation":"https://pith.science/pith/4CHGDUKR2QM2S2RIB424NSDVZ7/action/citation_signature","submit_replication":"https://pith.science/pith/4CHGDUKR2QM2S2RIB424NSDVZ7/action/replication_record"}},"created_at":"2026-07-05T10:42:37.886456+00:00","updated_at":"2026-07-05T10:42:37.886456+00:00"}