{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RLJMXNZXSCHZV4SHQKH7N3I3LD","short_pith_number":"pith:RLJMXNZX","schema_version":"1.0","canonical_sha256":"8ad2cbb737908f9af247828ff6ed1b58dd4571ee5edbf759974b648bc20896eb","source":{"kind":"arxiv","id":"2502.04577","version":1},"attestation_state":"computed","paper":{"title":"Position-aware Automatic Circuit Discovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Aaron Mueller, David Bau, Hadas Orgad, Tal Haklay, Yonatan Belinkov","submitted_at":"2025-02-07T00:18:20Z","abstract_excerpt":"A widely used strategy to discover and understand language model mechanisms is circuit analysis. A circuit is a minimal subgraph of a model's computation graph that executes a specific task. We identify a gap in existing circuit discovery methods: they assume circuits are position-invariant, treating model components as equally relevant across input positions. This limits their ability to capture cross-positional interactions or mechanisms that vary across positions. To address this gap, we propose two improvements to incorporate positionality into circuits, even on tasks containing variable-l"},"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":"2502.04577","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-07T00:18:20Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"8c8ec8946b12979c63625cb24a173612aea934157bde917743e9d5504bad8d25","abstract_canon_sha256":"5c71b68afdbec3f4c988ced3f2f1db230f5cb6779de635c37ab33c514095835a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:53.774363Z","signature_b64":"2u/afxyzn18IH6WVZfj7WLo8UE7bDuCMxOuGIwLqGzeMOXiGRuLth3NKluWdjTFOVhAgz44nXy0aiuBDGTwuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ad2cbb737908f9af247828ff6ed1b58dd4571ee5edbf759974b648bc20896eb","last_reissued_at":"2026-07-05T10:10:53.773835Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:53.773835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Position-aware Automatic Circuit Discovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Aaron Mueller, David Bau, Hadas Orgad, Tal Haklay, Yonatan Belinkov","submitted_at":"2025-02-07T00:18:20Z","abstract_excerpt":"A widely used strategy to discover and understand language model mechanisms is circuit analysis. A circuit is a minimal subgraph of a model's computation graph that executes a specific task. We identify a gap in existing circuit discovery methods: they assume circuits are position-invariant, treating model components as equally relevant across input positions. This limits their ability to capture cross-positional interactions or mechanisms that vary across positions. To address this gap, we propose two improvements to incorporate positionality into circuits, even on tasks containing variable-l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04577","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/2502.04577/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":"2502.04577","created_at":"2026-07-05T10:10:53.773909+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.04577v1","created_at":"2026-07-05T10:10:53.773909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04577","created_at":"2026-07-05T10:10:53.773909+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLJMXNZXSCHZ","created_at":"2026-07-05T10:10:53.773909+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLJMXNZXSCHZV4SH","created_at":"2026-07-05T10:10:53.773909+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLJMXNZX","created_at":"2026-07-05T10:10:53.773909+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12207","citing_title":"Not How Many, But Which: Parameter Placement in Low-Rank Adaptation","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLJMXNZXSCHZV4SHQKH7N3I3LD","json":"https://pith.science/pith/RLJMXNZXSCHZV4SHQKH7N3I3LD.json","graph_json":"https://pith.science/api/pith-number/RLJMXNZXSCHZV4SHQKH7N3I3LD/graph.json","events_json":"https://pith.science/api/pith-number/RLJMXNZXSCHZV4SHQKH7N3I3LD/events.json","paper":"https://pith.science/paper/RLJMXNZX"},"agent_actions":{"view_html":"https://pith.science/pith/RLJMXNZXSCHZV4SHQKH7N3I3LD","download_json":"https://pith.science/pith/RLJMXNZXSCHZV4SHQKH7N3I3LD.json","view_paper":"https://pith.science/paper/RLJMXNZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.04577&json=true","fetch_graph":"https://pith.science/api/pith-number/RLJMXNZXSCHZV4SHQKH7N3I3LD/graph.json","fetch_events":"https://pith.science/api/pith-number/RLJMXNZXSCHZV4SHQKH7N3I3LD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLJMXNZXSCHZV4SHQKH7N3I3LD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLJMXNZXSCHZV4SHQKH7N3I3LD/action/storage_attestation","attest_author":"https://pith.science/pith/RLJMXNZXSCHZV4SHQKH7N3I3LD/action/author_attestation","sign_citation":"https://pith.science/pith/RLJMXNZXSCHZV4SHQKH7N3I3LD/action/citation_signature","submit_replication":"https://pith.science/pith/RLJMXNZXSCHZV4SHQKH7N3I3LD/action/replication_record"}},"created_at":"2026-07-05T10:10:53.773909+00:00","updated_at":"2026-07-05T10:10:53.773909+00:00"}