{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HB7S5PQS5Q42IRHAKI2T7HQ5NF","short_pith_number":"pith:HB7S5PQS","canonical_record":{"source":{"id":"2404.04393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-04-05T20:36:30Z","cross_cats_sorted":["cs.CL","cs.FL","cs.LG"],"title_canon_sha256":"d65fbc7bb8a588ca39b430545040b862d888a187f33d57af95caa7ec784023ed","abstract_canon_sha256":"c21de1c7b7a7697681054679ed635db106aae4bf8b84f33d355dfabf4fbad6ab"},"schema_version":"1.0"},"canonical_sha256":"387f2ebe12ec39a444e052353f9e1d6954e35f7a2d43ac0f0bc4d39429920e37","source":{"kind":"arxiv","id":"2404.04393","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.04393","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"2404.04393v2","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04393","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"HB7S5PQS5Q42","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"pith_short_16","alias_value":"HB7S5PQS5Q42IRHA","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"pith_short_8","alias_value":"HB7S5PQS","created_at":"2026-07-05T09:42:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HB7S5PQS5Q42IRHAKI2T7HQ5NF","target":"record","payload":{"canonical_record":{"source":{"id":"2404.04393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-04-05T20:36:30Z","cross_cats_sorted":["cs.CL","cs.FL","cs.LG"],"title_canon_sha256":"d65fbc7bb8a588ca39b430545040b862d888a187f33d57af95caa7ec784023ed","abstract_canon_sha256":"c21de1c7b7a7697681054679ed635db106aae4bf8b84f33d355dfabf4fbad6ab"},"schema_version":"1.0"},"canonical_sha256":"387f2ebe12ec39a444e052353f9e1d6954e35f7a2d43ac0f0bc4d39429920e37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:24.258681Z","signature_b64":"jTxWM3GDIQZikwDAhRubjY3y3lgzLK6legbU6k1FSk+EQMWTYDI1eSU0kKa1s7gkdD3HfTv1QeiOv/gmz7lxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"387f2ebe12ec39a444e052353f9e1d6954e35f7a2d43ac0f0bc4d39429920e37","last_reissued_at":"2026-07-05T09:42:24.258144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:24.258144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.04393","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UZvnhjO/cc/Huu3DIV7Er5JIKsicFLA4daUVq0ODvRH++fzfckiZ4V2JhRVTPvGWWy/sbbkpSeOCPiVr87u+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:49:23.754471Z"},"content_sha256":"030573294758bb7af3a3bd2031307f4d115158aca39bc4aefd3136a83929f584","schema_version":"1.0","event_id":"sha256:030573294758bb7af3a3bd2031307f4d115158aca39bc4aefd3136a83929f584"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HB7S5PQS5Q42IRHAKI2T7HQ5NF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.FL","cs.LG"],"primary_cat":"cs.LO","authors_text":"Andy Yang, David Chiang","submitted_at":"2024-04-05T20:36:30Z","abstract_excerpt":"Deriving formal bounds on the expressivity of transformers, as well as studying transformers that are constructed to implement known algorithms, are both effective methods for better understanding the computational power of transformers. Towards both ends, we introduce the temporal counting logic $\\textsf{K}_\\text{t}$[#] alongside the RASP variant $\\textsf{C-RASP}$. We show they are equivalent to each other, and that together they are the best-known lower bound on the formal expressivity of future-masked soft attention transformers with unbounded input size. We prove this by showing all $\\text"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04393","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/2404.04393/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfHjtfR7QQjteihcQCyUlcWWRdEzd9hZ5mucKSPYv53QMJyPOxlAjri1ndkGcbxAaPryHNAte/TBxs0MhwOoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:49:23.755041Z"},"content_sha256":"fa185f2484a9f1116a4130165818a5910c0f2e9e1ff8e9cff6d985411abb5bda","schema_version":"1.0","event_id":"sha256:fa185f2484a9f1116a4130165818a5910c0f2e9e1ff8e9cff6d985411abb5bda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HB7S5PQS5Q42IRHAKI2T7HQ5NF/bundle.json","state_url":"https://pith.science/pith/HB7S5PQS5Q42IRHAKI2T7HQ5NF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HB7S5PQS5Q42IRHAKI2T7HQ5NF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T21:49:23Z","links":{"resolver":"https://pith.science/pith/HB7S5PQS5Q42IRHAKI2T7HQ5NF","bundle":"https://pith.science/pith/HB7S5PQS5Q42IRHAKI2T7HQ5NF/bundle.json","state":"https://pith.science/pith/HB7S5PQS5Q42IRHAKI2T7HQ5NF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HB7S5PQS5Q42IRHAKI2T7HQ5NF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HB7S5PQS5Q42IRHAKI2T7HQ5NF","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":"c21de1c7b7a7697681054679ed635db106aae4bf8b84f33d355dfabf4fbad6ab","cross_cats_sorted":["cs.CL","cs.FL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-04-05T20:36:30Z","title_canon_sha256":"d65fbc7bb8a588ca39b430545040b862d888a187f33d57af95caa7ec784023ed"},"schema_version":"1.0","source":{"id":"2404.04393","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.04393","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"2404.04393v2","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04393","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"HB7S5PQS5Q42","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"pith_short_16","alias_value":"HB7S5PQS5Q42IRHA","created_at":"2026-07-05T09:42:24Z"},{"alias_kind":"pith_short_8","alias_value":"HB7S5PQS","created_at":"2026-07-05T09:42:24Z"}],"graph_snapshots":[{"event_id":"sha256:fa185f2484a9f1116a4130165818a5910c0f2e9e1ff8e9cff6d985411abb5bda","target":"graph","created_at":"2026-07-05T09:42:24Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.04393/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deriving formal bounds on the expressivity of transformers, as well as studying transformers that are constructed to implement known algorithms, are both effective methods for better understanding the computational power of transformers. Towards both ends, we introduce the temporal counting logic $\\textsf{K}_\\text{t}$[#] alongside the RASP variant $\\textsf{C-RASP}$. We show they are equivalent to each other, and that together they are the best-known lower bound on the formal expressivity of future-masked soft attention transformers with unbounded input size. We prove this by showing all $\\text","authors_text":"Andy Yang, David Chiang","cross_cats":["cs.CL","cs.FL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-04-05T20:36:30Z","title":"Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04393","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:030573294758bb7af3a3bd2031307f4d115158aca39bc4aefd3136a83929f584","target":"record","created_at":"2026-07-05T09:42:24Z","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":"c21de1c7b7a7697681054679ed635db106aae4bf8b84f33d355dfabf4fbad6ab","cross_cats_sorted":["cs.CL","cs.FL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-04-05T20:36:30Z","title_canon_sha256":"d65fbc7bb8a588ca39b430545040b862d888a187f33d57af95caa7ec784023ed"},"schema_version":"1.0","source":{"id":"2404.04393","kind":"arxiv","version":2}},"canonical_sha256":"387f2ebe12ec39a444e052353f9e1d6954e35f7a2d43ac0f0bc4d39429920e37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"387f2ebe12ec39a444e052353f9e1d6954e35f7a2d43ac0f0bc4d39429920e37","first_computed_at":"2026-07-05T09:42:24.258144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:24.258144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jTxWM3GDIQZikwDAhRubjY3y3lgzLK6legbU6k1FSk+EQMWTYDI1eSU0kKa1s7gkdD3HfTv1QeiOv/gmz7lxBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:24.258681Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.04393","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:030573294758bb7af3a3bd2031307f4d115158aca39bc4aefd3136a83929f584","sha256:fa185f2484a9f1116a4130165818a5910c0f2e9e1ff8e9cff6d985411abb5bda"],"state_sha256":"0574bf0f765dfb64376ebd8aeb3c7e24655e652e8047cb53a8f33aff331b04b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2lj9t91w069YTmgBM7VogdZMBa6w7SYLfiPaJe/LGGJxfrCH/+Dxd0V1dfkOFYCWfI1nKOL6fJmvTy9VakHOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T21:49:23.759470Z","bundle_sha256":"eb63d88fe9e903dc9a78f56f6204340900768072c7fb177b79d120f59717e0bd"}}