{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AZQSZBH5M7CDW3ZS2WD6HLIFU7","short_pith_number":"pith:AZQSZBH5","canonical_record":{"source":{"id":"1803.01953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T22:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"66b8bc9aab1bd6bcbe5d34450b25561dc61add60206bedc8cfd9f180ca9aa95d","abstract_canon_sha256":"534d0e98473c8b564295b1aac0fe858bf92917055f88bcac1d61ca7e94520796"},"schema_version":"1.0"},"canonical_sha256":"06612c84fd67c43b6f32d587e3ad05a7fc53150c9b773c0b96d1bf25e0d27c5b","source":{"kind":"arxiv","id":"1803.01953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01953","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01953v1","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01953","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"AZQSZBH5M7CD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AZQSZBH5M7CDW3ZS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AZQSZBH5","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AZQSZBH5M7CDW3ZS2WD6HLIFU7","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T22:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"66b8bc9aab1bd6bcbe5d34450b25561dc61add60206bedc8cfd9f180ca9aa95d","abstract_canon_sha256":"534d0e98473c8b564295b1aac0fe858bf92917055f88bcac1d61ca7e94520796"},"schema_version":"1.0"},"canonical_sha256":"06612c84fd67c43b6f32d587e3ad05a7fc53150c9b773c0b96d1bf25e0d27c5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:56.222134Z","signature_b64":"5shIZlohalo1icx3AdenoCDc7cLTOj1Tr8+cyyGqjWdpSMBJ1h8Ez3qXReyspsmIOIZf0XH8cXOVZ+Rtp0EKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06612c84fd67c43b6f32d587e3ad05a7fc53150c9b773c0b96d1bf25e0d27c5b","last_reissued_at":"2026-05-18T00:21:56.221584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:56.221584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01953","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:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+t1LOYoHjgP4y35MVNmRS4CLdJhj4xugm//DXdHboZ+Uw346bf885fV/I7p+hdVvEIYrvkLB8X3rYH8QvtmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:37:49.841231Z"},"content_sha256":"4fcf9d1784cde5293054cb4c0413ad9cd0bd51b53e0ef519cd586a45592aef47","schema_version":"1.0","event_id":"sha256:4fcf9d1784cde5293054cb4c0413ad9cd0bd51b53e0ef519cd586a45592aef47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AZQSZBH5M7CDW3ZS2WD6HLIFU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniformity thresholds for the asymptotic size of extremal Berge-$F$-free hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Gr\\'osz","submitted_at":"2018-03-05T22:41:00Z","abstract_excerpt":"Let $F = (U,E)$ be a graph and $\\mathcal{H} = (V,\\mathcal{E})$ be a hypergraph. We say that $\\mathcal{H}$ contains a Berge-$F$ if there exist injections $\\psi:U\\to V$ and $\\varphi:E\\to \\mathcal{E}$ such that for every $e=\\{u,v\\}\\in E$, $\\{\\psi(u),\\psi(v)\\}\\subset\\varphi(e)$. Let $ex_r(n,F)$ denote the maximum number of hyperedges in an $r$-uniform hypergraph on $n$ vertices which does not contain a Berge-$F$.\n  For small enough $r$ and non-bipartite $F$, $ex_r(n,F)=\\Omega(n^2)$; we show that for sufficiently large $r$, $ex_r(n,F)=o(n^2)$. Let $thres(F) = \\min\\{r_0 :ex_r(n,F) = o(n^2) \\text{ fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01953","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:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQ438n5oBkI1KF6+d6tmwXwIIqhEycHIsAzrvNUErxWBCd8jo6wCyXaQ1/lx/AWAeN7TmG8rGtKG/xo41kUqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:37:49.841932Z"},"content_sha256":"207e3c55e37aafb8a4f559637c6ed0c4be423057cc06deed89e08128e3f86aef","schema_version":"1.0","event_id":"sha256:207e3c55e37aafb8a4f559637c6ed0c4be423057cc06deed89e08128e3f86aef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZQSZBH5M7CDW3ZS2WD6HLIFU7/bundle.json","state_url":"https://pith.science/pith/AZQSZBH5M7CDW3ZS2WD6HLIFU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZQSZBH5M7CDW3ZS2WD6HLIFU7/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-05-27T05:37:49Z","links":{"resolver":"https://pith.science/pith/AZQSZBH5M7CDW3ZS2WD6HLIFU7","bundle":"https://pith.science/pith/AZQSZBH5M7CDW3ZS2WD6HLIFU7/bundle.json","state":"https://pith.science/pith/AZQSZBH5M7CDW3ZS2WD6HLIFU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZQSZBH5M7CDW3ZS2WD6HLIFU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AZQSZBH5M7CDW3ZS2WD6HLIFU7","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":"534d0e98473c8b564295b1aac0fe858bf92917055f88bcac1d61ca7e94520796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T22:41:00Z","title_canon_sha256":"66b8bc9aab1bd6bcbe5d34450b25561dc61add60206bedc8cfd9f180ca9aa95d"},"schema_version":"1.0","source":{"id":"1803.01953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01953","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01953v1","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01953","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"AZQSZBH5M7CD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AZQSZBH5M7CDW3ZS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AZQSZBH5","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:207e3c55e37aafb8a4f559637c6ed0c4be423057cc06deed89e08128e3f86aef","target":"graph","created_at":"2026-05-18T00:21:56Z","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":"Let $F = (U,E)$ be a graph and $\\mathcal{H} = (V,\\mathcal{E})$ be a hypergraph. We say that $\\mathcal{H}$ contains a Berge-$F$ if there exist injections $\\psi:U\\to V$ and $\\varphi:E\\to \\mathcal{E}$ such that for every $e=\\{u,v\\}\\in E$, $\\{\\psi(u),\\psi(v)\\}\\subset\\varphi(e)$. Let $ex_r(n,F)$ denote the maximum number of hyperedges in an $r$-uniform hypergraph on $n$ vertices which does not contain a Berge-$F$.\n  For small enough $r$ and non-bipartite $F$, $ex_r(n,F)=\\Omega(n^2)$; we show that for sufficiently large $r$, $ex_r(n,F)=o(n^2)$. Let $thres(F) = \\min\\{r_0 :ex_r(n,F) = o(n^2) \\text{ fo","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Gr\\'osz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T22:41:00Z","title":"Uniformity thresholds for the asymptotic size of extremal Berge-$F$-free hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01953","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:4fcf9d1784cde5293054cb4c0413ad9cd0bd51b53e0ef519cd586a45592aef47","target":"record","created_at":"2026-05-18T00:21:56Z","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":"534d0e98473c8b564295b1aac0fe858bf92917055f88bcac1d61ca7e94520796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T22:41:00Z","title_canon_sha256":"66b8bc9aab1bd6bcbe5d34450b25561dc61add60206bedc8cfd9f180ca9aa95d"},"schema_version":"1.0","source":{"id":"1803.01953","kind":"arxiv","version":1}},"canonical_sha256":"06612c84fd67c43b6f32d587e3ad05a7fc53150c9b773c0b96d1bf25e0d27c5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06612c84fd67c43b6f32d587e3ad05a7fc53150c9b773c0b96d1bf25e0d27c5b","first_computed_at":"2026-05-18T00:21:56.221584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:56.221584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5shIZlohalo1icx3AdenoCDc7cLTOj1Tr8+cyyGqjWdpSMBJ1h8Ez3qXReyspsmIOIZf0XH8cXOVZ+Rtp0EKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:56.222134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fcf9d1784cde5293054cb4c0413ad9cd0bd51b53e0ef519cd586a45592aef47","sha256:207e3c55e37aafb8a4f559637c6ed0c4be423057cc06deed89e08128e3f86aef"],"state_sha256":"154563563122c466f6f190573c1c284ea19054ae8bd7a81c952eb12b6af602da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVnbej+/g5N6f2g4gjmys7zEDdgNIW70uz9h6kgueQWZlCQh47+vrHqjvzZdA0fZnTUdt+TQQQ4ESPur2+0KAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:37:49.845204Z","bundle_sha256":"66073b99bb4ef0140d17c56b76c964fb804500aca733d4274a19282aa237d142"}}