{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BQXNM7WFQQCKJADML5NTJKY6MG","short_pith_number":"pith:BQXNM7WF","canonical_record":{"source":{"id":"2608.04243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-08-04T21:52:04Z","cross_cats_sorted":[],"title_canon_sha256":"88b7394c81c0f36fc83abda920bc520f97e5d4995594fa5110373722b57943a5","abstract_canon_sha256":"cbc4140e76079835d03078df4ea3d7b765eab79e3f8de31c9c8cc726ce11f7dc"},"schema_version":"1.0"},"canonical_sha256":"0c2ed67ec58404a4806c5f5b34ab1e619c22bdc59317888736469f175603d18f","source":{"kind":"arxiv","id":"2608.04243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04243","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04243v1","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04243","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"BQXNM7WFQQCK","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"pith_short_16","alias_value":"BQXNM7WFQQCKJADM","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"pith_short_8","alias_value":"BQXNM7WF","created_at":"2026-08-06T01:31:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BQXNM7WFQQCKJADML5NTJKY6MG","target":"record","payload":{"canonical_record":{"source":{"id":"2608.04243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-08-04T21:52:04Z","cross_cats_sorted":[],"title_canon_sha256":"88b7394c81c0f36fc83abda920bc520f97e5d4995594fa5110373722b57943a5","abstract_canon_sha256":"cbc4140e76079835d03078df4ea3d7b765eab79e3f8de31c9c8cc726ce11f7dc"},"schema_version":"1.0"},"canonical_sha256":"0c2ed67ec58404a4806c5f5b34ab1e619c22bdc59317888736469f175603d18f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:31:44.215416Z","signature_b64":"a1ZZeDQFOXmjqrfb4rQRh7BVElemmruRheBEtaZyBIF2dElyuRCMER16A45HgyPbKZCmTa+8t9FAZD6xplvBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c2ed67ec58404a4806c5f5b34ab1e619c22bdc59317888736469f175603d18f","last_reissued_at":"2026-08-06T01:31:44.213926Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:31:44.213926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.04243","source_version":1,"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-08-06T01:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjKp644c8FPo73Q9Z/xg8nfULL7dQTTDS8LhP0V0EgbRrjDqNTNDwHpn+0XIhB8+GgsLIfiJ33tFwjuRzc3GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:54:05.246332Z"},"content_sha256":"e21088b0d9f0cd8b598b6df288ea2e2b75164a4641a443945a9ef6b1567f3556","schema_version":"1.0","event_id":"sha256:e21088b0d9f0cd8b598b6df288ea2e2b75164a4641a443945a9ef6b1567f3556"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BQXNM7WFQQCKJADML5NTJKY6MG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attention-based representations for multi-task computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniel Hsu, Mingyue Xu","submitted_at":"2026-08-04T21:52:04Z","abstract_excerpt":"Multi-head attention layers produce vector representations that support multiple downstream tasks. We establish bounds on the number of heads required in two simple and concrete multi-task scenarios. In the first scenario, a vector representation is sought so that linear predictors can compute both the smallest and largest numbers in a given list. In this case, it is known two attention heads with small embedding dimension and bit precision level suffice. We prove that a single attention head requires exponentially higher embedding dimension or precision level. In the second scenario, a vector"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04243","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/2608.04243/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-08-06T01:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KM5xo+P8EpjXQgNKexjKwnsSsZxj+QqWmJJXuJiyLnqIqFlcF188aecaKg0BNEfs6iG36YtulHYSkz3K4JpvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:54:05.246874Z"},"content_sha256":"e0f07474680c99a5bee0dafd01a7936d5f32b577b552d0aa5cf655c6923dc558","schema_version":"1.0","event_id":"sha256:e0f07474680c99a5bee0dafd01a7936d5f32b577b552d0aa5cf655c6923dc558"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:BQXNM7WFQQCKJADML5NTJKY6MG","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1162/tacl_a_00306 resolves to 'Theoretical Limitations of Self-Attention in Neural Sequence Models'. A reader following the printed text alone cannot reach it.","snippet":"Michael Hahn. Theoretical limitations of self-attention in neural sequence models.Transactions of the Association for Computational Linguistics, 8:156–171, December 2020. ISSN 2307-387X. doi: 10.1162/tacl a 00306. URLhttp://dx.doi.org/10.11","arxiv_id":"2608.04243","detector":"doi_compliance","evidence":{"ref_index":9,"verdict_class":"incontrovertible","resolved_title":"Theoretical Limitations of Self-Attention in Neural Sequence Models","printed_excerpt":"10.1162/tacl","reconstructed_doi":"10.1162/tacl_a_00306"},"severity":"advisory","ref_index":9,"audited_at":"2026-08-08T00:28:18.448133Z","event_type":"pith.integrity.v1","detected_doi":"10.1162/tacl_a_00306","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"99852926d39ed22a792b32ad97a781ed42558ceebb3df1f481e295f05324a136","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Theoretical Limitations of Self-Attention in Neural Sequence Models","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18578,"payload_sha256":"e196b98f9455d55a31227d060fc450fbec78dc7edb810236532e7a906bf6f53b","signature_b64":"2LiQnv/z3rtqNrYRJG6n+BEM/b3jQgismgl+tHKJomjFFsuhyRSUitgw8u9ZvdKK0pA2BbEN5K1pxvK/r5LfBg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-08T00:28:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vhNyOntVWAiahQFp3/dzTZCOEaWfZNvjWMIj6UmMQNRPti46V8prPH7vgOa1vTwttVHldk9m7pXxkDALVreDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:54:05.249756Z"},"content_sha256":"46009c1901c44e662d3002f672d5a88914b4370a8b626f9ddbafa44c02c1df2c","schema_version":"1.0","event_id":"sha256:46009c1901c44e662d3002f672d5a88914b4370a8b626f9ddbafa44c02c1df2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQXNM7WFQQCKJADML5NTJKY6MG/bundle.json","state_url":"https://pith.science/pith/BQXNM7WFQQCKJADML5NTJKY6MG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQXNM7WFQQCKJADML5NTJKY6MG/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-11T16:54:05Z","links":{"resolver":"https://pith.science/pith/BQXNM7WFQQCKJADML5NTJKY6MG","bundle":"https://pith.science/pith/BQXNM7WFQQCKJADML5NTJKY6MG/bundle.json","state":"https://pith.science/pith/BQXNM7WFQQCKJADML5NTJKY6MG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQXNM7WFQQCKJADML5NTJKY6MG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BQXNM7WFQQCKJADML5NTJKY6MG","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cbc4140e76079835d03078df4ea3d7b765eab79e3f8de31c9c8cc726ce11f7dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-08-04T21:52:04Z","title_canon_sha256":"88b7394c81c0f36fc83abda920bc520f97e5d4995594fa5110373722b57943a5"},"schema_version":"1.0","source":{"id":"2608.04243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04243","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04243v1","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04243","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"BQXNM7WFQQCK","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"pith_short_16","alias_value":"BQXNM7WFQQCKJADM","created_at":"2026-08-06T01:31:44Z"},{"alias_kind":"pith_short_8","alias_value":"BQXNM7WF","created_at":"2026-08-06T01:31:44Z"}],"graph_snapshots":[{"event_id":"sha256:e0f07474680c99a5bee0dafd01a7936d5f32b577b552d0aa5cf655c6923dc558","target":"graph","created_at":"2026-08-06T01:31:44Z","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/2608.04243/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-head attention layers produce vector representations that support multiple downstream tasks. We establish bounds on the number of heads required in two simple and concrete multi-task scenarios. In the first scenario, a vector representation is sought so that linear predictors can compute both the smallest and largest numbers in a given list. In this case, it is known two attention heads with small embedding dimension and bit precision level suffice. We prove that a single attention head requires exponentially higher embedding dimension or precision level. In the second scenario, a vector","authors_text":"Daniel Hsu, Mingyue Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-08-04T21:52:04Z","title":"Attention-based representations for multi-task computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04243","kind":"arxiv","version":1},"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:e21088b0d9f0cd8b598b6df288ea2e2b75164a4641a443945a9ef6b1567f3556","target":"record","created_at":"2026-08-06T01:31:44Z","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":"cbc4140e76079835d03078df4ea3d7b765eab79e3f8de31c9c8cc726ce11f7dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-08-04T21:52:04Z","title_canon_sha256":"88b7394c81c0f36fc83abda920bc520f97e5d4995594fa5110373722b57943a5"},"schema_version":"1.0","source":{"id":"2608.04243","kind":"arxiv","version":1}},"canonical_sha256":"0c2ed67ec58404a4806c5f5b34ab1e619c22bdc59317888736469f175603d18f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c2ed67ec58404a4806c5f5b34ab1e619c22bdc59317888736469f175603d18f","first_computed_at":"2026-08-06T01:31:44.213926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:31:44.213926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a1ZZeDQFOXmjqrfb4rQRh7BVElemmruRheBEtaZyBIF2dElyuRCMER16A45HgyPbKZCmTa+8t9FAZD6xplvBBQ==","signature_status":"signed_v1","signed_at":"2026-08-06T01:31:44.215416Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.04243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e21088b0d9f0cd8b598b6df288ea2e2b75164a4641a443945a9ef6b1567f3556","sha256:e0f07474680c99a5bee0dafd01a7936d5f32b577b552d0aa5cf655c6923dc558","sha256:46009c1901c44e662d3002f672d5a88914b4370a8b626f9ddbafa44c02c1df2c"],"state_sha256":"b495a98120909c54d34ad352621e6640609a881febad97f463d539134e84d274"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYhUSmJgZpsTiuLm9LLZd+DEOOGM6bBnEGrrOkboQF0wJ6fBJ8weDh2TLUie+nYk4dWWdU19Vn/rYC+gok5GAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T16:54:05.252749Z","bundle_sha256":"a2f7630d8dd288065e0a5f5d99494992d5800b88d9b4dfe6950f19345dd91184"}}