{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QUUYMFKUFZ2RU4Z5R5L7M7M5PC","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":"1618ab586e75d2f7e60580deb6f4d224fe6944aabe0eb2bb25f11663cdb87e87","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T15:24:58Z","title_canon_sha256":"3bbab42060c2f80292c0595a849dd7647f881f9e2f8d63510414e0cf939d1bc9"},"schema_version":"1.0","source":{"id":"2606.18048","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18048","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18048v1","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18048","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"QUUYMFKUFZ2R","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_16","alias_value":"QUUYMFKUFZ2RU4Z5","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_8","alias_value":"QUUYMFKU","created_at":"2026-06-19T16:10:46Z"}],"graph_snapshots":[{"event_id":"sha256:de6db5cb65e4ccb267b0378d9e4b2c5841d93d7f5e8afb9bf93b377dc1c50d8b","target":"graph","created_at":"2026-06-19T16:10:46Z","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/2606.18048/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A foundational theorem of Ajtai, Koml\\'os, Pintz, Spencer, and Szemer\\'edi asserts that every $n$-vertex $k$-uniform uncrowded hypergraph with maximum degree $\\Delta$ contains an independent set of size $c_k n{\\left(\\frac{\\log \\Delta}{\\Delta}\\right)^{\\frac{1}{k-1}}}$, for some constant $c_k>0$. Determining the optimal leading constant $c_k$ in this bound is a major open problem. A natural target is the so-called shattering-threshold constant $\\left(\\frac{1}{k-1}\\right)^{\\frac{1}{k-1}}$, which appears in the solution-space geometry of random constraint satisfaction problems, in average-case com","authors_text":"Abhishek Dhawan, Abhishek Methuku, Minh-Quan Vo","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T15:24:58Z","title":"The independence number of uncrowded hypergraphs: bounds matching the shattering threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18048","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:18748d010e4b902c1137d59c0076fec7f296196cd4018f82325e5f99ebc12bdc","target":"record","created_at":"2026-06-19T16:10:46Z","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":"1618ab586e75d2f7e60580deb6f4d224fe6944aabe0eb2bb25f11663cdb87e87","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T15:24:58Z","title_canon_sha256":"3bbab42060c2f80292c0595a849dd7647f881f9e2f8d63510414e0cf939d1bc9"},"schema_version":"1.0","source":{"id":"2606.18048","kind":"arxiv","version":1}},"canonical_sha256":"85298615542e751a733d8f57f67d9d78a08a5481ff2296b9de43476ba5e3b202","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85298615542e751a733d8f57f67d9d78a08a5481ff2296b9de43476ba5e3b202","first_computed_at":"2026-06-19T16:10:46.974366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:46.974366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k5oCa+U9t1HnZP2V57u07u07T9FkeKEufg0S77UaJCPC5uTUNYPFZLrrbvX6NtYRMRj0bJC8r7Kp3GTcRHq7DA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:46.974744Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18048","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18748d010e4b902c1137d59c0076fec7f296196cd4018f82325e5f99ebc12bdc","sha256:de6db5cb65e4ccb267b0378d9e4b2c5841d93d7f5e8afb9bf93b377dc1c50d8b"],"state_sha256":"a94e8aff2d9cfb32884ae428b464c436cc754165af557a168bd0a3c06c1ac574"}