{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ET75SEOHOPWHZW5SAM5LBR7HJW","short_pith_number":"pith:ET75SEOH","schema_version":"1.0","canonical_sha256":"24ffd911c773ec7cdbb2033ab0c7e74d997578edd36d152dab543f5f8ffae393","source":{"kind":"arxiv","id":"2607.19573","version":1},"attestation_state":"computed","paper":{"title":"On the Computational Complexity of Structural Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Zichao Wei","submitted_at":"2026-07-21T21:00:32Z","abstract_excerpt":"Structural generalization has been measured repeatedly by several benchmarks, yet it has never been formally defined. We give a definition that translates the two premises (compositional structure and unbounded generalization) into mathematical language. The definition itself is neutral: a compiler that hard-codes the rules satisfies it just as well. But structural generalization becomes a scientific question only insofar as the capacity can autonomously emerge from finite data. This question pits the computational lower bound $\\mathrm{NC}^1$ against the learnable ceiling $\\mathrm{TC}^0$ of pu"},"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":"2607.19573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-07-21T21:00:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"81f096f8fe5313d990f07864ae7295c213caa841dd09b8cbea2b5de1a2d2b511","abstract_canon_sha256":"7c39abb9fc93be25deaaf7bc8406e5d48723b5b6201500d2fcad3636ff4e79b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T00:23:57.181252Z","signature_b64":"H223JDEB6RnrPh7nSjTuMYqvb5sbRdwTXhFdKrA+dvg0pxNYpkeKE3B8BsDGMLXH4np1xglg6yK+Y/FJvTWPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24ffd911c773ec7cdbb2033ab0c7e74d997578edd36d152dab543f5f8ffae393","last_reissued_at":"2026-07-23T00:23:57.180448Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T00:23:57.180448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Computational Complexity of Structural Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Zichao Wei","submitted_at":"2026-07-21T21:00:32Z","abstract_excerpt":"Structural generalization has been measured repeatedly by several benchmarks, yet it has never been formally defined. We give a definition that translates the two premises (compositional structure and unbounded generalization) into mathematical language. The definition itself is neutral: a compiler that hard-codes the rules satisfies it just as well. But structural generalization becomes a scientific question only insofar as the capacity can autonomously emerge from finite data. This question pits the computational lower bound $\\mathrm{NC}^1$ against the learnable ceiling $\\mathrm{TC}^0$ of pu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19573","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/2607.19573/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":"2607.19573","created_at":"2026-07-23T00:23:57.180867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.19573v1","created_at":"2026-07-23T00:23:57.180867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19573","created_at":"2026-07-23T00:23:57.180867+00:00"},{"alias_kind":"pith_short_12","alias_value":"ET75SEOHOPWH","created_at":"2026-07-23T00:23:57.180867+00:00"},{"alias_kind":"pith_short_16","alias_value":"ET75SEOHOPWHZW5S","created_at":"2026-07-23T00:23:57.180867+00:00"},{"alias_kind":"pith_short_8","alias_value":"ET75SEOH","created_at":"2026-07-23T00:23:57.180867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ET75SEOHOPWHZW5SAM5LBR7HJW","json":"https://pith.science/pith/ET75SEOHOPWHZW5SAM5LBR7HJW.json","graph_json":"https://pith.science/api/pith-number/ET75SEOHOPWHZW5SAM5LBR7HJW/graph.json","events_json":"https://pith.science/api/pith-number/ET75SEOHOPWHZW5SAM5LBR7HJW/events.json","paper":"https://pith.science/paper/ET75SEOH"},"agent_actions":{"view_html":"https://pith.science/pith/ET75SEOHOPWHZW5SAM5LBR7HJW","download_json":"https://pith.science/pith/ET75SEOHOPWHZW5SAM5LBR7HJW.json","view_paper":"https://pith.science/paper/ET75SEOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.19573&json=true","fetch_graph":"https://pith.science/api/pith-number/ET75SEOHOPWHZW5SAM5LBR7HJW/graph.json","fetch_events":"https://pith.science/api/pith-number/ET75SEOHOPWHZW5SAM5LBR7HJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ET75SEOHOPWHZW5SAM5LBR7HJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ET75SEOHOPWHZW5SAM5LBR7HJW/action/storage_attestation","attest_author":"https://pith.science/pith/ET75SEOHOPWHZW5SAM5LBR7HJW/action/author_attestation","sign_citation":"https://pith.science/pith/ET75SEOHOPWHZW5SAM5LBR7HJW/action/citation_signature","submit_replication":"https://pith.science/pith/ET75SEOHOPWHZW5SAM5LBR7HJW/action/replication_record"}},"created_at":"2026-07-23T00:23:57.180867+00:00","updated_at":"2026-07-23T00:23:57.180867+00:00"}