{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QUUYMFKUFZ2RU4Z5R5L7M7M5PC","short_pith_number":"pith:QUUYMFKU","canonical_record":{"source":{"id":"2606.18048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T15:24:58Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"3bbab42060c2f80292c0595a849dd7647f881f9e2f8d63510414e0cf939d1bc9","abstract_canon_sha256":"1618ab586e75d2f7e60580deb6f4d224fe6944aabe0eb2bb25f11663cdb87e87"},"schema_version":"1.0"},"canonical_sha256":"85298615542e751a733d8f57f67d9d78a08a5481ff2296b9de43476ba5e3b202","source":{"kind":"arxiv","id":"2606.18048","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QUUYMFKUFZ2RU4Z5R5L7M7M5PC","target":"record","payload":{"canonical_record":{"source":{"id":"2606.18048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T15:24:58Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"3bbab42060c2f80292c0595a849dd7647f881f9e2f8d63510414e0cf939d1bc9","abstract_canon_sha256":"1618ab586e75d2f7e60580deb6f4d224fe6944aabe0eb2bb25f11663cdb87e87"},"schema_version":"1.0"},"canonical_sha256":"85298615542e751a733d8f57f67d9d78a08a5481ff2296b9de43476ba5e3b202","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:46.974744Z","signature_b64":"k5oCa+U9t1HnZP2V57u07u07T9FkeKEufg0S77UaJCPC5uTUNYPFZLrrbvX6NtYRMRj0bJC8r7Kp3GTcRHq7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85298615542e751a733d8f57f67d9d78a08a5481ff2296b9de43476ba5e3b202","last_reissued_at":"2026-06-19T16:10:46.974366Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:46.974366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.18048","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-06-19T16:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"465fAYnI0LqR2yCQQBVGRtaCiCeR+K6QNLdY08HC9vgJFkrfp7d2KpkOhnO0VE9i1pXtHc1EL95Fdd8jZfX6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:22:08.500980Z"},"content_sha256":"18748d010e4b902c1137d59c0076fec7f296196cd4018f82325e5f99ebc12bdc","schema_version":"1.0","event_id":"sha256:18748d010e4b902c1137d59c0076fec7f296196cd4018f82325e5f99ebc12bdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QUUYMFKUFZ2RU4Z5R5L7M7M5PC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The independence number of uncrowded hypergraphs: bounds matching the shattering threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Abhishek Dhawan, Abhishek Methuku, Minh-Quan Vo","submitted_at":"2026-06-16T15:24:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18048","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/2606.18048/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-06-19T16:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"830J7Gyz4o5PO+w/u/326TyjDfZNmKTe2ABimBfvnGUipsN8X/b0PTbHpa/5lblnvOUW2TNMi0sXzpnXf0gcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:22:08.501386Z"},"content_sha256":"de6db5cb65e4ccb267b0378d9e4b2c5841d93d7f5e8afb9bf93b377dc1c50d8b","schema_version":"1.0","event_id":"sha256:de6db5cb65e4ccb267b0378d9e4b2c5841d93d7f5e8afb9bf93b377dc1c50d8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUUYMFKUFZ2RU4Z5R5L7M7M5PC/bundle.json","state_url":"https://pith.science/pith/QUUYMFKUFZ2RU4Z5R5L7M7M5PC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUUYMFKUFZ2RU4Z5R5L7M7M5PC/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-07-01T23:22:08Z","links":{"resolver":"https://pith.science/pith/QUUYMFKUFZ2RU4Z5R5L7M7M5PC","bundle":"https://pith.science/pith/QUUYMFKUFZ2RU4Z5R5L7M7M5PC/bundle.json","state":"https://pith.science/pith/QUUYMFKUFZ2RU4Z5R5L7M7M5PC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUUYMFKUFZ2RU4Z5R5L7M7M5PC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LUxn2ZYi7ffvcpyvuGrrtWi327oOh3fK+gL2LH8SJChJU+tmBlQE0H2e9o5cxCISesURd/SGw4UFKHvoAy5hBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:22:08.504027Z","bundle_sha256":"e796d5eb12872d03d6083b4be2e8a253f6c3442302190a326dd18e4b02c47354"}}