{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GX7OFEAGNMHRQLOIR44FGLG4MU","short_pith_number":"pith:GX7OFEAG","canonical_record":{"source":{"id":"2501.12997","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-22T16:30:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"72310fb510eacc576cba226e1cdbec392080d959e1e204e9b9f2371b0b3eda99","abstract_canon_sha256":"4134d5c8cdc9e0975e6722c30a9d3cce98ede5e4856139fd0986b37757b0459b"},"schema_version":"1.0"},"canonical_sha256":"35fee290066b0f182dc88f38532cdc6539a15489942ab8b13b1d69f5e3904081","source":{"kind":"arxiv","id":"2501.12997","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12997","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12997v2","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12997","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"pith_short_12","alias_value":"GX7OFEAGNMHR","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"pith_short_16","alias_value":"GX7OFEAGNMHRQLOI","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"pith_short_8","alias_value":"GX7OFEAG","created_at":"2026-07-05T11:52:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GX7OFEAGNMHRQLOIR44FGLG4MU","target":"record","payload":{"canonical_record":{"source":{"id":"2501.12997","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-22T16:30:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"72310fb510eacc576cba226e1cdbec392080d959e1e204e9b9f2371b0b3eda99","abstract_canon_sha256":"4134d5c8cdc9e0975e6722c30a9d3cce98ede5e4856139fd0986b37757b0459b"},"schema_version":"1.0"},"canonical_sha256":"35fee290066b0f182dc88f38532cdc6539a15489942ab8b13b1d69f5e3904081","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:01.083088Z","signature_b64":"u0kgnW0gcJ2EEcXgWBDgbbxqSPjmKv1GsYrwafQErbyi7TQH/Z09lh8Mx6O1QocL4HWDLNQamNu1lXHog7MJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35fee290066b0f182dc88f38532cdc6539a15489942ab8b13b1d69f5e3904081","last_reissued_at":"2026-07-05T11:52:01.082605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:01.082605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.12997","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-05T11:52:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlQP0E2GOWGqa0b3OJNjSXDnJCq7e21e9iG1hBe6rHw//PoVybds7FHBpm2DeSKrCvZJVVAxoy+5QUVRtxQpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:45:13.261191Z"},"content_sha256":"baa9d8d55464c9c1977f8a5041bc6ad46fb404ef8d7c754165c65ada94226583","schema_version":"1.0","event_id":"sha256:baa9d8d55464c9c1977f8a5041bc6ad46fb404ef8d7c754165c65ada94226583"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GX7OFEAGNMHRQLOIR44FGLG4MU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ehrenfeucht-Haussler Rank and Chain of Thought","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexander Kozachinskiy, Pablo Barcel\\'o, Tomasz Steifer","submitted_at":"2025-01-22T16:30:58Z","abstract_excerpt":"The notion of \\emph{rank} of a Boolean function has been a cornerstone in PAC learning theory, enabling quasipolynomial-time learning algorithms for polynomial-size decision trees. We present a novel characterization of rank, grounded in the well-known Transformer architecture. We show that the rank of a function $f$ corresponds to the minimum number of \\emph{Chain of Thought} (CoT) steps required by a single-layer Transformer with hard attention to compute $f$. Based on this characterization we establish tight bounds on the number of CoT steps required for specific problems, showing that \\(\\e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12997","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/2501.12997/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-05T11:52:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdoM2gX1/xMS4FtY+o/r2f26DGgj+mWjfby4MKHSIcbu8pLZJp5Gzi5bH1AiMGB4NnLRAnbrcODvq8c4pES0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:45:13.261714Z"},"content_sha256":"0705ad0e154825295f029e8b02b50aa3d1679f6ebfde79d407618f7f93a5b799","schema_version":"1.0","event_id":"sha256:0705ad0e154825295f029e8b02b50aa3d1679f6ebfde79d407618f7f93a5b799"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GX7OFEAGNMHRQLOIR44FGLG4MU/bundle.json","state_url":"https://pith.science/pith/GX7OFEAGNMHRQLOIR44FGLG4MU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GX7OFEAGNMHRQLOIR44FGLG4MU/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-12T03:45:13Z","links":{"resolver":"https://pith.science/pith/GX7OFEAGNMHRQLOIR44FGLG4MU","bundle":"https://pith.science/pith/GX7OFEAGNMHRQLOIR44FGLG4MU/bundle.json","state":"https://pith.science/pith/GX7OFEAGNMHRQLOIR44FGLG4MU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GX7OFEAGNMHRQLOIR44FGLG4MU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GX7OFEAGNMHRQLOIR44FGLG4MU","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":"4134d5c8cdc9e0975e6722c30a9d3cce98ede5e4856139fd0986b37757b0459b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-22T16:30:58Z","title_canon_sha256":"72310fb510eacc576cba226e1cdbec392080d959e1e204e9b9f2371b0b3eda99"},"schema_version":"1.0","source":{"id":"2501.12997","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12997","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12997v2","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12997","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"pith_short_12","alias_value":"GX7OFEAGNMHR","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"pith_short_16","alias_value":"GX7OFEAGNMHRQLOI","created_at":"2026-07-05T11:52:01Z"},{"alias_kind":"pith_short_8","alias_value":"GX7OFEAG","created_at":"2026-07-05T11:52:01Z"}],"graph_snapshots":[{"event_id":"sha256:0705ad0e154825295f029e8b02b50aa3d1679f6ebfde79d407618f7f93a5b799","target":"graph","created_at":"2026-07-05T11:52:01Z","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/2501.12997/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The notion of \\emph{rank} of a Boolean function has been a cornerstone in PAC learning theory, enabling quasipolynomial-time learning algorithms for polynomial-size decision trees. We present a novel characterization of rank, grounded in the well-known Transformer architecture. We show that the rank of a function $f$ corresponds to the minimum number of \\emph{Chain of Thought} (CoT) steps required by a single-layer Transformer with hard attention to compute $f$. Based on this characterization we establish tight bounds on the number of CoT steps required for specific problems, showing that \\(\\e","authors_text":"Alexander Kozachinskiy, Pablo Barcel\\'o, Tomasz Steifer","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-22T16:30:58Z","title":"Ehrenfeucht-Haussler Rank and Chain of Thought"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12997","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:baa9d8d55464c9c1977f8a5041bc6ad46fb404ef8d7c754165c65ada94226583","target":"record","created_at":"2026-07-05T11:52:01Z","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":"4134d5c8cdc9e0975e6722c30a9d3cce98ede5e4856139fd0986b37757b0459b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-22T16:30:58Z","title_canon_sha256":"72310fb510eacc576cba226e1cdbec392080d959e1e204e9b9f2371b0b3eda99"},"schema_version":"1.0","source":{"id":"2501.12997","kind":"arxiv","version":2}},"canonical_sha256":"35fee290066b0f182dc88f38532cdc6539a15489942ab8b13b1d69f5e3904081","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35fee290066b0f182dc88f38532cdc6539a15489942ab8b13b1d69f5e3904081","first_computed_at":"2026-07-05T11:52:01.082605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:52:01.082605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u0kgnW0gcJ2EEcXgWBDgbbxqSPjmKv1GsYrwafQErbyi7TQH/Z09lh8Mx6O1QocL4HWDLNQamNu1lXHog7MJBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:52:01.083088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.12997","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baa9d8d55464c9c1977f8a5041bc6ad46fb404ef8d7c754165c65ada94226583","sha256:0705ad0e154825295f029e8b02b50aa3d1679f6ebfde79d407618f7f93a5b799"],"state_sha256":"c19af875681b80f8a91a811369780b2ea0619c6ed73425366664abaf37d60efe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/UYDjO0671HDVOvimlxtJ1PqcZ9m4nmYrj4uD5C8M3ibS6sEMhsI2qxFEgqGyUg7P+7LlaUTy3DdY2Gfr2kBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T03:45:13.266963Z","bundle_sha256":"acfd0129612763a0ccafbc6341e9d7bf8d4a2e935b9285e280ac12f9a1af2eb9"}}