{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ACEWMLWMN2QZZLMHDSFH6L5JZQ","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":"5d5c2606df01c3fc261d801bb1d8600c4526cb63add6ab5e2efd9fa20f39f2ae","cross_cats_sorted":["cs.IT","cs.LG","math.CA","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-07-01T14:47:36Z","title_canon_sha256":"ed5e0ef603dc699337d9dc08fad4a34cb9fc295cf252c89a4bba887dd35e7bca"},"schema_version":"1.0","source":{"id":"2607.01010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01010","created_at":"2026-07-02T01:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01010v1","created_at":"2026-07-02T01:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01010","created_at":"2026-07-02T01:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"ACEWMLWMN2QZ","created_at":"2026-07-02T01:18:25Z"},{"alias_kind":"pith_short_16","alias_value":"ACEWMLWMN2QZZLMH","created_at":"2026-07-02T01:18:25Z"},{"alias_kind":"pith_short_8","alias_value":"ACEWMLWM","created_at":"2026-07-02T01:18:25Z"}],"graph_snapshots":[{"event_id":"sha256:ea48d70c16f48ea0eb42629113aedb0caae0bbc333aa2409e0db735ebdef5273","target":"graph","created_at":"2026-07-02T01:18:25Z","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/2607.01010/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The success of deep learning models in classification and regression is widely attributed to the low-dimensional structure that real-world data tend to exhibit, despite their high-dimensional representation. This work attempts to provide a mathematical framework for binary classification on low-dimensional data, building on Cover's (1965) function-counting theory. With our framework, we aim to address the question of how the low-dimensional structure of the data affects the classification capabilities of learning models. Cover's theory relies on a general position assumption that blinds it to ","authors_text":"Helmut B\\\"olcskei, Konstantin H\\\"aberle","cross_cats":["cs.IT","cs.LG","math.CA","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-07-01T14:47:36Z","title":"Function-Counting Theory for Low-Dimensional Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01010","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:5170bd80ffd1d813012beb360920593f388da5b3b147ca522abefc444ed27cb0","target":"record","created_at":"2026-07-02T01:18:25Z","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":"5d5c2606df01c3fc261d801bb1d8600c4526cb63add6ab5e2efd9fa20f39f2ae","cross_cats_sorted":["cs.IT","cs.LG","math.CA","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-07-01T14:47:36Z","title_canon_sha256":"ed5e0ef603dc699337d9dc08fad4a34cb9fc295cf252c89a4bba887dd35e7bca"},"schema_version":"1.0","source":{"id":"2607.01010","kind":"arxiv","version":1}},"canonical_sha256":"0089662ecc6ea19cad871c8a7f2fa9cc0321e0445db0d9c59c22e15d540cdbf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0089662ecc6ea19cad871c8a7f2fa9cc0321e0445db0d9c59c22e15d540cdbf0","first_computed_at":"2026-07-02T01:18:25.928723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:18:25.928723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Vt3lhRJj5iN4xdvwms06b0X+p6kguZexYOfFdgipe3gqYlcFJcTtVSc4K7mUNd2CvRmCAYq7h8TI37f/E1CBA==","signature_status":"signed_v1","signed_at":"2026-07-02T01:18:25.929154Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5170bd80ffd1d813012beb360920593f388da5b3b147ca522abefc444ed27cb0","sha256:ea48d70c16f48ea0eb42629113aedb0caae0bbc333aa2409e0db735ebdef5273"],"state_sha256":"edb0c8023a587e7c3880c602b6f9fa449e412b04e041cad5699a2d1f4a8d922f"}