{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IRBWV4QV2HMPNOOYKBODQTJCKV","short_pith_number":"pith:IRBWV4QV","canonical_record":{"source":{"id":"2010.00726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-01T23:41:20Z","cross_cats_sorted":["cs.DM","math.LO"],"title_canon_sha256":"5412f30a27392230923215b65dbce607e405a934a7856eb9e609f0b902551399","abstract_canon_sha256":"6868e9c8dfb8de8fb2adbbf3513881d72215118f3aa21b86b30c2026428cda8b"},"schema_version":"1.0"},"canonical_sha256":"44436af215d1d8f6b9d8505c384d22556b84cbcead799054723f1e8949ced118","source":{"kind":"arxiv","id":"2010.00726","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00726","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00726v1","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00726","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"IRBWV4QV2HMP","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"pith_short_16","alias_value":"IRBWV4QV2HMPNOOY","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"pith_short_8","alias_value":"IRBWV4QV","created_at":"2026-07-05T01:39:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IRBWV4QV2HMPNOOYKBODQTJCKV","target":"record","payload":{"canonical_record":{"source":{"id":"2010.00726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-01T23:41:20Z","cross_cats_sorted":["cs.DM","math.LO"],"title_canon_sha256":"5412f30a27392230923215b65dbce607e405a934a7856eb9e609f0b902551399","abstract_canon_sha256":"6868e9c8dfb8de8fb2adbbf3513881d72215118f3aa21b86b30c2026428cda8b"},"schema_version":"1.0"},"canonical_sha256":"44436af215d1d8f6b9d8505c384d22556b84cbcead799054723f1e8949ced118","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:46.732604Z","signature_b64":"GMe42dQEi+7cGY0RwPlHLjZPoeDRRpFAP/lT5GglpZ35uMsYHJ3E6KY3RGlhE8VYnYV0Ij4d1jkcxtznw68eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44436af215d1d8f6b9d8505c384d22556b84cbcead799054723f1e8949ced118","last_reissued_at":"2026-07-05T01:39:46.732177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:46.732177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.00726","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-05T01:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OveZuUZ2J0z7LDIq4lQAHNXiIfTOZkxEGYVuxawCK0HI6RFr18SYuS8DbkmPgBJpG7ih60s6nxZ43L62akrpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T11:40:50.792030Z"},"content_sha256":"eefc70c357711e4ac149a542d53d502cf5ca64097a93af7c6ddb25fa476068b5","schema_version":"1.0","event_id":"sha256:eefc70c357711e4ac149a542d53d502cf5ca64097a93af7c6ddb25fa476068b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IRBWV4QV2HMPNOOYKBODQTJCKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hypergraph regularity and higher arity VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"math.CO","authors_text":"Artem Chernikov, Henry Towsner","submitted_at":"2020-10-01T23:41:20Z","abstract_excerpt":"We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be approximated by k-ary cylinder sets.\n  In the language of hypergraph regularity, this shows that when H is a k'-uniform hypergraph with small VC_k-dimension for some k<k', the decomposition of H given by hypergraph regularity only needs the first k levels---one can approximate H using sets of vertices, sets of pairs, and so on up to sets of k-tuples---and that on mos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00726","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/2010.00726/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-05T01:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/70HGIHzDCtgukuXhFWEtpe6TA17H1hcYdovBZJAamlkoLfMIyc11mqE6qkYHLTOaM9FNQkx6NClpoNMcL8uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T11:40:50.792617Z"},"content_sha256":"11b13b5ad3100dd1f00b5a762afd23082540da745ae96b0544404f17200c5077","schema_version":"1.0","event_id":"sha256:11b13b5ad3100dd1f00b5a762afd23082540da745ae96b0544404f17200c5077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/bundle.json","state_url":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/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-07T11:40:50Z","links":{"resolver":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV","bundle":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/bundle.json","state":"https://pith.science/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRBWV4QV2HMPNOOYKBODQTJCKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IRBWV4QV2HMPNOOYKBODQTJCKV","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":"6868e9c8dfb8de8fb2adbbf3513881d72215118f3aa21b86b30c2026428cda8b","cross_cats_sorted":["cs.DM","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-01T23:41:20Z","title_canon_sha256":"5412f30a27392230923215b65dbce607e405a934a7856eb9e609f0b902551399"},"schema_version":"1.0","source":{"id":"2010.00726","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00726","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00726v1","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00726","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"IRBWV4QV2HMP","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"pith_short_16","alias_value":"IRBWV4QV2HMPNOOY","created_at":"2026-07-05T01:39:46Z"},{"alias_kind":"pith_short_8","alias_value":"IRBWV4QV","created_at":"2026-07-05T01:39:46Z"}],"graph_snapshots":[{"event_id":"sha256:11b13b5ad3100dd1f00b5a762afd23082540da745ae96b0544404f17200c5077","target":"graph","created_at":"2026-07-05T01:39: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/2010.00726/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be approximated by k-ary cylinder sets.\n  In the language of hypergraph regularity, this shows that when H is a k'-uniform hypergraph with small VC_k-dimension for some k<k', the decomposition of H given by hypergraph regularity only needs the first k levels---one can approximate H using sets of vertices, sets of pairs, and so on up to sets of k-tuples---and that on mos","authors_text":"Artem Chernikov, Henry Towsner","cross_cats":["cs.DM","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-01T23:41:20Z","title":"Hypergraph regularity and higher arity VC-dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00726","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:eefc70c357711e4ac149a542d53d502cf5ca64097a93af7c6ddb25fa476068b5","target":"record","created_at":"2026-07-05T01:39: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":"6868e9c8dfb8de8fb2adbbf3513881d72215118f3aa21b86b30c2026428cda8b","cross_cats_sorted":["cs.DM","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-01T23:41:20Z","title_canon_sha256":"5412f30a27392230923215b65dbce607e405a934a7856eb9e609f0b902551399"},"schema_version":"1.0","source":{"id":"2010.00726","kind":"arxiv","version":1}},"canonical_sha256":"44436af215d1d8f6b9d8505c384d22556b84cbcead799054723f1e8949ced118","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44436af215d1d8f6b9d8505c384d22556b84cbcead799054723f1e8949ced118","first_computed_at":"2026-07-05T01:39:46.732177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:39:46.732177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GMe42dQEi+7cGY0RwPlHLjZPoeDRRpFAP/lT5GglpZ35uMsYHJ3E6KY3RGlhE8VYnYV0Ij4d1jkcxtznw68eCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:39:46.732604Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.00726","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eefc70c357711e4ac149a542d53d502cf5ca64097a93af7c6ddb25fa476068b5","sha256:11b13b5ad3100dd1f00b5a762afd23082540da745ae96b0544404f17200c5077"],"state_sha256":"3d0d6e37de08f44664a002d32cf6bcf13e5ca383bb5268847b02e03b1ed9e4f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+KGf+OkAUAJYdd2hf0CE8OCeerUUou81Wkwb7XM4Gn8483/lwQUQESftfNUI4w5ODsaQcdzRtRInpfuKfX4cAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T11:40:50.797932Z","bundle_sha256":"518bc49bf4c97626c2a09ffbf09be268c25e5066ccb071ceb3faaa5c9bbe7581"}}