{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AWGHYY7NALACXYC3K2KGALE3V6","short_pith_number":"pith:AWGHYY7N","canonical_record":{"source":{"id":"2607.19202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-07-21T15:34:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"02a6e842686996f9f0eca7565079291f0b18a1e6aee122672ce89dd0121cb1d4","abstract_canon_sha256":"c295311c01e9bca70458d22fa301899c8656059daf145d0f05f8cf5e221edb92"},"schema_version":"1.0"},"canonical_sha256":"058c7c63ed02c02be05b5694602c9baf895201bf4d4e1042d4a8eedc89d3e904","source":{"kind":"arxiv","id":"2607.19202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19202","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19202v1","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19202","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"AWGHYY7NALAC","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"pith_short_16","alias_value":"AWGHYY7NALACXYC3","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"pith_short_8","alias_value":"AWGHYY7N","created_at":"2026-07-22T01:24:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AWGHYY7NALACXYC3K2KGALE3V6","target":"record","payload":{"canonical_record":{"source":{"id":"2607.19202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-07-21T15:34:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"02a6e842686996f9f0eca7565079291f0b18a1e6aee122672ce89dd0121cb1d4","abstract_canon_sha256":"c295311c01e9bca70458d22fa301899c8656059daf145d0f05f8cf5e221edb92"},"schema_version":"1.0"},"canonical_sha256":"058c7c63ed02c02be05b5694602c9baf895201bf4d4e1042d4a8eedc89d3e904","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T01:24:13.997660Z","signature_b64":"LgZOVVf9YWTQtxkHlHT/wDFz1DonmKoH6Hh1sQT+dmF7Ce4GoOHsnwWVePJ8xL2oo+Kw4s8Tk/l8ohK5YLlcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"058c7c63ed02c02be05b5694602c9baf895201bf4d4e1042d4a8eedc89d3e904","last_reissued_at":"2026-07-22T01:24:13.996794Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T01:24:13.996794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.19202","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-07-22T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4PeNApnmw8GMnABF1O4sNnOThe92MwK6O7J3wtLGfVK5ipDoj7hgXO9XWV++1I4Mm5iEJqadHaAqaMEnihfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:43:00.460719Z"},"content_sha256":"b2312623de110e4897b7745bbc8ff128bbb81ced1ee888967d658e621881d9f5","schema_version":"1.0","event_id":"sha256:b2312623de110e4897b7745bbc8ff128bbb81ced1ee888967d658e621881d9f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AWGHYY7NALACXYC3K2KGALE3V6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homogeneous hypergraph regularity lemmas via $k$-strong honest definitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Mervyn Tong","submitted_at":"2026-07-21T15:34:48Z","abstract_excerpt":"We prove that $(k+1)$-uniform hypergraphs definable in an NIP strongly $k$-distal structure satisfy a homogeneous regularity lemma -- they can be partitioned into a bounded number of simplicial complexes, most of which are homogeneous (meaning that the restriction of the hypergraph to the simplicial complex is either complete or empty). Furthermore, the parts of the partition can be chosen uniformly definably, and the size of the partition is polynomial in the reciprocal of the error parameter. This extends the homogeneous regularity lemma proven by Chernikov and Starchenko for hypergraphs def"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19202","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.19202/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-22T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMyY5dtAtHfweIA6I0xSdyM3bEmhD/nUyd0G0j20jyVrfQlto74bIZjWr/vNk3XHNCW+eSEL0m0leVr/fNYvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:43:00.461243Z"},"content_sha256":"18c29044c72fcb1ce91264cc85aeb7d42d04a17e9e8d0b92ad15b1e068741830","schema_version":"1.0","event_id":"sha256:18c29044c72fcb1ce91264cc85aeb7d42d04a17e9e8d0b92ad15b1e068741830"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:AWGHYY7NALACXYC3K2KGALE3V6","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1017/jsl.2022.61) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Roland Walker. Distality rank.The Journal of Symbolic Logic, 88(2):704–737, 2023.doi:10.1017/jsl.2022. 61","arxiv_id":"2607.19202","detector":"doi_compliance","evidence":{"ref_index":38,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1017/jsl.2022","reconstructed_doi":"10.1017/jsl.2022.61"},"severity":"advisory","ref_index":38,"audited_at":"2026-08-01T13:28:43.478974Z","event_type":"pith.integrity.v1","detected_doi":"10.1017/jsl.2022.61","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"28cab6ffba7efab44a9c52a2bd6c6d72ba96f8e720faf24725ae63c6142c6949","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15861,"payload_sha256":"3d2446d0d22e70aa54e9ca003c299b787be36e0881bc855c954a236de968e3b4","signature_b64":"xf18BmvoTBwa2QAzQFCtI25iO0lp8XCQLOHDiK2g+s6fgwoMwoNzLOGIcuiAvGUrEQxmdmNV0JRbPMtBdqjmCw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T13:33:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lS4cOcuWtr6qwZZqVkvqNkAyp6qUdmzyKMhcmtilb/3oUJHRu9laHhrbj9Zd4tNth8YmLtoq6OUz6TFoFi+ZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:43:00.464133Z"},"content_sha256":"5ad224969c06f951089c794ffcb415b9e8628066f0a6cb2292c23744a82174ab","schema_version":"1.0","event_id":"sha256:5ad224969c06f951089c794ffcb415b9e8628066f0a6cb2292c23744a82174ab"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:AWGHYY7NALACXYC3K2KGALE3V6","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.jctb.2009.05.005 resolves to 'Weak hypergraph regularity and linear hypergraphs'. A reader following the printed text alone cannot reach it.","snippet":"Yoshiharu Kohayakawa, Brendan Nagle, Vojtˇ ech R¨ odl, and Mathias Schacht. Weak hypergraph regularity and linear hypergraphs.Journal of Combinatorial Theory, Series B, 100(2):151–160, 2010.doi:10.1016/j. jctb.2009.05.005","arxiv_id":"2607.19202","detector":"doi_compliance","evidence":{"ref_index":19,"verdict_class":"incontrovertible","resolved_title":"Weak hypergraph regularity and linear hypergraphs","printed_excerpt":"10.1016/j","reconstructed_doi":"10.1016/j.jctb.2009.05.005"},"severity":"advisory","ref_index":19,"audited_at":"2026-08-01T13:28:43.478974Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.jctb.2009.05.005","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"af7b1066e5ccd58e9b8ff2ee2e3b65084a24efcf52da7e54cd64437105e402d2","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Weak hypergraph regularity and linear hypergraphs","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15860,"payload_sha256":"3f59739f26f01ad967d5a33cca182d0ddd2f04e1432105cf852ca229f1f0adbc","signature_b64":"MvBIBArJ6fnz/6kcbZz2GvVieFXC6gxCfxfBSOx1S20pcjxDhEW/EwF+gCWJIbwKJieU/se8oauTNrpP0EpYCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T13:33:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abt3P1cM5BsD0U1f/HtH6tP/GZSuqSk4jKi6pmus3fKX2k8j5bkxdmTsv5/EhsTXnqJv3SSUBC0dVvdNrXHxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:43:00.464526Z"},"content_sha256":"1206a66c27628070a72da1b77121089bf16fd09832e9be0caf920254f42a637e","schema_version":"1.0","event_id":"sha256:1206a66c27628070a72da1b77121089bf16fd09832e9be0caf920254f42a637e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWGHYY7NALACXYC3K2KGALE3V6/bundle.json","state_url":"https://pith.science/pith/AWGHYY7NALACXYC3K2KGALE3V6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWGHYY7NALACXYC3K2KGALE3V6/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-06T05:43:00Z","links":{"resolver":"https://pith.science/pith/AWGHYY7NALACXYC3K2KGALE3V6","bundle":"https://pith.science/pith/AWGHYY7NALACXYC3K2KGALE3V6/bundle.json","state":"https://pith.science/pith/AWGHYY7NALACXYC3K2KGALE3V6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWGHYY7NALACXYC3K2KGALE3V6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AWGHYY7NALACXYC3K2KGALE3V6","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c295311c01e9bca70458d22fa301899c8656059daf145d0f05f8cf5e221edb92","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-07-21T15:34:48Z","title_canon_sha256":"02a6e842686996f9f0eca7565079291f0b18a1e6aee122672ce89dd0121cb1d4"},"schema_version":"1.0","source":{"id":"2607.19202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19202","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19202v1","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19202","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"AWGHYY7NALAC","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"pith_short_16","alias_value":"AWGHYY7NALACXYC3","created_at":"2026-07-22T01:24:13Z"},{"alias_kind":"pith_short_8","alias_value":"AWGHYY7N","created_at":"2026-07-22T01:24:13Z"}],"graph_snapshots":[{"event_id":"sha256:18c29044c72fcb1ce91264cc85aeb7d42d04a17e9e8d0b92ad15b1e068741830","target":"graph","created_at":"2026-07-22T01:24:13Z","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.19202/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that $(k+1)$-uniform hypergraphs definable in an NIP strongly $k$-distal structure satisfy a homogeneous regularity lemma -- they can be partitioned into a bounded number of simplicial complexes, most of which are homogeneous (meaning that the restriction of the hypergraph to the simplicial complex is either complete or empty). Furthermore, the parts of the partition can be chosen uniformly definably, and the size of the partition is polynomial in the reciprocal of the error parameter. This extends the homogeneous regularity lemma proven by Chernikov and Starchenko for hypergraphs def","authors_text":"Mervyn Tong","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-07-21T15:34:48Z","title":"Homogeneous hypergraph regularity lemmas via $k$-strong honest definitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19202","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:b2312623de110e4897b7745bbc8ff128bbb81ced1ee888967d658e621881d9f5","target":"record","created_at":"2026-07-22T01:24:13Z","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":"c295311c01e9bca70458d22fa301899c8656059daf145d0f05f8cf5e221edb92","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-07-21T15:34:48Z","title_canon_sha256":"02a6e842686996f9f0eca7565079291f0b18a1e6aee122672ce89dd0121cb1d4"},"schema_version":"1.0","source":{"id":"2607.19202","kind":"arxiv","version":1}},"canonical_sha256":"058c7c63ed02c02be05b5694602c9baf895201bf4d4e1042d4a8eedc89d3e904","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"058c7c63ed02c02be05b5694602c9baf895201bf4d4e1042d4a8eedc89d3e904","first_computed_at":"2026-07-22T01:24:13.996794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-22T01:24:13.996794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LgZOVVf9YWTQtxkHlHT/wDFz1DonmKoH6Hh1sQT+dmF7Ce4GoOHsnwWVePJ8xL2oo+Kw4s8Tk/l8ohK5YLlcAg==","signature_status":"signed_v1","signed_at":"2026-07-22T01:24:13.997660Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.19202","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:1206a66c27628070a72da1b77121089bf16fd09832e9be0caf920254f42a637e","sha256:5ad224969c06f951089c794ffcb415b9e8628066f0a6cb2292c23744a82174ab"]}],"invalid_events":[],"applied_event_ids":["sha256:b2312623de110e4897b7745bbc8ff128bbb81ced1ee888967d658e621881d9f5","sha256:18c29044c72fcb1ce91264cc85aeb7d42d04a17e9e8d0b92ad15b1e068741830"],"state_sha256":"34aae27a8aec4760dadda7b68434e2f1ae724b58268ae927eedd615d19a6124f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTIM85l1xA/8NWbjNtuneSsf/4UP6xjjVYds4hs3mVMiihaZFQF+6GRZIj1nTBM5Hzquq3bdWLsyMrdb7erIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T05:43:00.467345Z","bundle_sha256":"1406d73bb96e1fc215a69c32b96ff65d35dcba22068f263943cf141d1ebcb393"}}