{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4NQTGYXK3GBRS4BXM3XJRFLWS6","short_pith_number":"pith:4NQTGYXK","canonical_record":{"source":{"id":"1807.02411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T00:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"31e5c897ad58cd72f59ed9fe97562287320e8df2299bc89d6b489dd0af6fb861","abstract_canon_sha256":"4a31890faa5f0a655253f4aa9cec0a8a166f0bfaf69d4a8c467c3649dc83af96"},"schema_version":"1.0"},"canonical_sha256":"e3613362ead98319703766ee9895769794d5fa04c1525c33fe9a1a9bd02cc8e6","source":{"kind":"arxiv","id":"1807.02411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02411","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02411v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02411","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"4NQTGYXK3GBR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4NQTGYXK3GBRS4BX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4NQTGYXK","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4NQTGYXK3GBRS4BXM3XJRFLWS6","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T00:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"31e5c897ad58cd72f59ed9fe97562287320e8df2299bc89d6b489dd0af6fb861","abstract_canon_sha256":"4a31890faa5f0a655253f4aa9cec0a8a166f0bfaf69d4a8c467c3649dc83af96"},"schema_version":"1.0"},"canonical_sha256":"e3613362ead98319703766ee9895769794d5fa04c1525c33fe9a1a9bd02cc8e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:22.143158Z","signature_b64":"qN62DxH2YuxVuqGUttPoTTLBxIEy2suzz+2PJG5ZvgXBmm8Ic/rkQlaoUo5dRSxXdnzyQy6TLuFRs5mnaEf9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3613362ead98319703766ee9895769794d5fa04c1525c33fe9a1a9bd02cc8e6","last_reissued_at":"2026-05-18T00:11:22.142523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:22.142523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02411","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-05-18T00:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwrOuloqHmjKVDnQuKfKS+4/vaziOUZBEuFIfVmy562i7zzRxTWHsnkTCFp1ZiB0MgBPrBEQavxDjTPpCq7eCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:48:56.501771Z"},"content_sha256":"b5aeafa63162a57c75fa40e2149bebb027180ca573b90931fd721b61efc7439c","schema_version":"1.0","event_id":"sha256:b5aeafa63162a57c75fa40e2149bebb027180ca573b90931fd721b61efc7439c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4NQTGYXK3GBRS4BXM3XJRFLWS6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved bounds on the extremal function of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"William Zhang","submitted_at":"2018-07-05T00:46:02Z","abstract_excerpt":"A fundamental problem in pattern avoidance is describing the asymptotic behavior of the extremal function and its generalizations. We prove an equivalence between the asymptotics of the graph extremal function for a class of bipartite graphs and the asymptotics of the matrix extremal function. We use the equivalence to prove several new bounds on the extremal functions of graphs. We develop a new method to bound the extremal function of hypergraphs in terms of the extremal function of their associated multidimensional matrices, improving the bound of the extremal function of $d$-permutation hy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02411","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":""},"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-05-18T00:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fT3eD63fygvIcokwa1eOu7lfQ3MpOFjuas7a/BP0+v+pDRcg9q/6FJQSNOEG3SxpKsRZfCkMBCupK9qUv3fYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:48:56.502151Z"},"content_sha256":"06c1206f01f2b41f01566be7ad0b5f7204d9942f01ef9d9c2b6dc58cf1382f11","schema_version":"1.0","event_id":"sha256:06c1206f01f2b41f01566be7ad0b5f7204d9942f01ef9d9c2b6dc58cf1382f11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NQTGYXK3GBRS4BXM3XJRFLWS6/bundle.json","state_url":"https://pith.science/pith/4NQTGYXK3GBRS4BXM3XJRFLWS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NQTGYXK3GBRS4BXM3XJRFLWS6/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-06-06T08:48:56Z","links":{"resolver":"https://pith.science/pith/4NQTGYXK3GBRS4BXM3XJRFLWS6","bundle":"https://pith.science/pith/4NQTGYXK3GBRS4BXM3XJRFLWS6/bundle.json","state":"https://pith.science/pith/4NQTGYXK3GBRS4BXM3XJRFLWS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NQTGYXK3GBRS4BXM3XJRFLWS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4NQTGYXK3GBRS4BXM3XJRFLWS6","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":"4a31890faa5f0a655253f4aa9cec0a8a166f0bfaf69d4a8c467c3649dc83af96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T00:46:02Z","title_canon_sha256":"31e5c897ad58cd72f59ed9fe97562287320e8df2299bc89d6b489dd0af6fb861"},"schema_version":"1.0","source":{"id":"1807.02411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02411","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02411v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02411","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"4NQTGYXK3GBR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4NQTGYXK3GBRS4BX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4NQTGYXK","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:06c1206f01f2b41f01566be7ad0b5f7204d9942f01ef9d9c2b6dc58cf1382f11","target":"graph","created_at":"2026-05-18T00:11:22Z","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"},"paper":{"abstract_excerpt":"A fundamental problem in pattern avoidance is describing the asymptotic behavior of the extremal function and its generalizations. We prove an equivalence between the asymptotics of the graph extremal function for a class of bipartite graphs and the asymptotics of the matrix extremal function. We use the equivalence to prove several new bounds on the extremal functions of graphs. We develop a new method to bound the extremal function of hypergraphs in terms of the extremal function of their associated multidimensional matrices, improving the bound of the extremal function of $d$-permutation hy","authors_text":"William Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T00:46:02Z","title":"Improved bounds on the extremal function of hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02411","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:b5aeafa63162a57c75fa40e2149bebb027180ca573b90931fd721b61efc7439c","target":"record","created_at":"2026-05-18T00:11:22Z","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":"4a31890faa5f0a655253f4aa9cec0a8a166f0bfaf69d4a8c467c3649dc83af96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T00:46:02Z","title_canon_sha256":"31e5c897ad58cd72f59ed9fe97562287320e8df2299bc89d6b489dd0af6fb861"},"schema_version":"1.0","source":{"id":"1807.02411","kind":"arxiv","version":1}},"canonical_sha256":"e3613362ead98319703766ee9895769794d5fa04c1525c33fe9a1a9bd02cc8e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3613362ead98319703766ee9895769794d5fa04c1525c33fe9a1a9bd02cc8e6","first_computed_at":"2026-05-18T00:11:22.142523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:22.142523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qN62DxH2YuxVuqGUttPoTTLBxIEy2suzz+2PJG5ZvgXBmm8Ic/rkQlaoUo5dRSxXdnzyQy6TLuFRs5mnaEf9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:22.143158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5aeafa63162a57c75fa40e2149bebb027180ca573b90931fd721b61efc7439c","sha256:06c1206f01f2b41f01566be7ad0b5f7204d9942f01ef9d9c2b6dc58cf1382f11"],"state_sha256":"83559b452782b15ac7bf6ae39110307266221a9cfd64b78dacf636938d6d2988"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzsaObj9jcngT+PibYGNFaFv3amswKN6pFLyhGYdIhK0+UeWtsP83Bly1WdSGhYp/INq8yQTp9ztaDcCjK34DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:48:56.504500Z","bundle_sha256":"bc6db5f27b233f060458454ff837af8b88c3b0ec60c4282c7dc0aa65ca32f8d7"}}