{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FF5HF7KXMNCCI5E4SSB6BIYFQV","short_pith_number":"pith:FF5HF7KX","schema_version":"1.0","canonical_sha256":"297a72fd57634424749c9483e0a3058562e64aa9f1a4c602c608a2db3a8862c8","source":{"kind":"arxiv","id":"2601.12879","version":2},"attestation_state":"computed","paper":{"title":"Hierarchical Sparse Circuit Extraction from Billion-Parameter Language Models through Scalable Attribution Graph Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Mohammed Kaif Pasha, Mohammed Mudassir Uddin, Shahnawaz Alam","submitted_at":"2026-01-19T09:34:10Z","abstract_excerpt":"Extracting sparse circuits from billion-parameter transformers is constrained by $O(2^n)$ search cost and pervasive feature reuse across co-active pathways. Hierarchical Attribution Graph Decomposition (HAGD) addresses this through four stages: cross-layer transcoder training, spectral coarsening of attribution graphs, graph-neural-network (GNN)-guided hierarchical traversal, and causal intervention verification, reducing worst-case complexity to $O(n^2 \\log n)$. Per-layer transcoders trained on the RedPajama corpus yield monosemantic dictionaries; gradient-activation products form weighted at"},"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":"2601.12879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-01-19T09:34:10Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"412d91e2d89ecaf42ff862951d9a846b622aac26b7b49adade3316e526c43c34","abstract_canon_sha256":"f771ca9bbcb553a4da4b5ffdb5e7c4e50846c11306350daf4d4fea19b8732295"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:12:46.003100Z","signature_b64":"vHqqoAtq9U04of3R5h1v23mSyItyEZ3IBBqh3pCjnfxjRIxy4iSGnvS3T1xlRtZEjNAeGNnMXB5nAId0htn8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297a72fd57634424749c9483e0a3058562e64aa9f1a4c602c608a2db3a8862c8","last_reissued_at":"2026-06-23T02:12:46.002597Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:12:46.002597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Sparse Circuit Extraction from Billion-Parameter Language Models through Scalable Attribution Graph Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Mohammed Kaif Pasha, Mohammed Mudassir Uddin, Shahnawaz Alam","submitted_at":"2026-01-19T09:34:10Z","abstract_excerpt":"Extracting sparse circuits from billion-parameter transformers is constrained by $O(2^n)$ search cost and pervasive feature reuse across co-active pathways. Hierarchical Attribution Graph Decomposition (HAGD) addresses this through four stages: cross-layer transcoder training, spectral coarsening of attribution graphs, graph-neural-network (GNN)-guided hierarchical traversal, and causal intervention verification, reducing worst-case complexity to $O(n^2 \\log n)$. Per-layer transcoders trained on the RedPajama corpus yield monosemantic dictionaries; gradient-activation products form weighted at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.12879","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/2601.12879/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":"2601.12879","created_at":"2026-06-23T02:12:46.002656+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.12879v2","created_at":"2026-06-23T02:12:46.002656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.12879","created_at":"2026-06-23T02:12:46.002656+00:00"},{"alias_kind":"pith_short_12","alias_value":"FF5HF7KXMNCC","created_at":"2026-06-23T02:12:46.002656+00:00"},{"alias_kind":"pith_short_16","alias_value":"FF5HF7KXMNCCI5E4","created_at":"2026-06-23T02:12:46.002656+00:00"},{"alias_kind":"pith_short_8","alias_value":"FF5HF7KX","created_at":"2026-06-23T02:12:46.002656+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/FF5HF7KXMNCCI5E4SSB6BIYFQV","json":"https://pith.science/pith/FF5HF7KXMNCCI5E4SSB6BIYFQV.json","graph_json":"https://pith.science/api/pith-number/FF5HF7KXMNCCI5E4SSB6BIYFQV/graph.json","events_json":"https://pith.science/api/pith-number/FF5HF7KXMNCCI5E4SSB6BIYFQV/events.json","paper":"https://pith.science/paper/FF5HF7KX"},"agent_actions":{"view_html":"https://pith.science/pith/FF5HF7KXMNCCI5E4SSB6BIYFQV","download_json":"https://pith.science/pith/FF5HF7KXMNCCI5E4SSB6BIYFQV.json","view_paper":"https://pith.science/paper/FF5HF7KX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.12879&json=true","fetch_graph":"https://pith.science/api/pith-number/FF5HF7KXMNCCI5E4SSB6BIYFQV/graph.json","fetch_events":"https://pith.science/api/pith-number/FF5HF7KXMNCCI5E4SSB6BIYFQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FF5HF7KXMNCCI5E4SSB6BIYFQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FF5HF7KXMNCCI5E4SSB6BIYFQV/action/storage_attestation","attest_author":"https://pith.science/pith/FF5HF7KXMNCCI5E4SSB6BIYFQV/action/author_attestation","sign_citation":"https://pith.science/pith/FF5HF7KXMNCCI5E4SSB6BIYFQV/action/citation_signature","submit_replication":"https://pith.science/pith/FF5HF7KXMNCCI5E4SSB6BIYFQV/action/replication_record"}},"created_at":"2026-06-23T02:12:46.002656+00:00","updated_at":"2026-06-23T02:12:46.002656+00:00"}