{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EZLDH5C3MDUHFMNVSLKJIZXXGD","short_pith_number":"pith:EZLDH5C3","canonical_record":{"source":{"id":"1705.04134","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-11T12:30:51Z","cross_cats_sorted":[],"title_canon_sha256":"a52766ed69f7376e2ca295785a6aef5847ac2216b96ae4a1bcbb059edfd65f2d","abstract_canon_sha256":"0a2b13669e01cf58ab94421083fe8634b2ed9607bb9fd6fa08008ffa49a9b8aa"},"schema_version":"1.0"},"canonical_sha256":"265633f45b60e872b1b592d49466f730e29abe5cbc68bf327c5f748afede2058","source":{"kind":"arxiv","id":"1705.04134","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04134","created_at":"2026-05-18T00:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04134v3","created_at":"2026-05-18T00:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04134","created_at":"2026-05-18T00:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"EZLDH5C3MDUH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZLDH5C3MDUHFMNV","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZLDH5C3","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EZLDH5C3MDUHFMNVSLKJIZXXGD","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04134","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-11T12:30:51Z","cross_cats_sorted":[],"title_canon_sha256":"a52766ed69f7376e2ca295785a6aef5847ac2216b96ae4a1bcbb059edfd65f2d","abstract_canon_sha256":"0a2b13669e01cf58ab94421083fe8634b2ed9607bb9fd6fa08008ffa49a9b8aa"},"schema_version":"1.0"},"canonical_sha256":"265633f45b60e872b1b592d49466f730e29abe5cbc68bf327c5f748afede2058","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:53.104931Z","signature_b64":"qHOwUjNn25jV/dlBUogFEn4acn3B1hkWb4bj2GZIwLmnmDc8IXJ6GZtRSc6xpuHN/oA9ANUh/DMxer4tfeZ8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"265633f45b60e872b1b592d49466f730e29abe5cbc68bf327c5f748afede2058","last_reissued_at":"2026-05-18T00:09:53.104259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:53.104259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04134","source_version":3,"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:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ibUxgm2pO89aKSRQbj/LKq0MF0UDyGtj+u67hgSsnCU7Q07/xbOwubn4ZjtaKuQLZVgV0QPuwR7/mTba3wNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:50:15.244634Z"},"content_sha256":"3d981c141f801595e5badba0a2892db934698575bc4899a7da4ad8615fc2933a","schema_version":"1.0","event_id":"sha256:3d981c141f801595e5badba0a2892db934698575bc4899a7da4ad8615fc2933a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EZLDH5C3MDUHFMNVSLKJIZXXGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotics for the Tur\\'an number of Berge-$K_{2,t}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, D\\'aniel Gerbner, M\\'at\\'e Vizer","submitted_at":"2017-05-11T12:30:51Z","abstract_excerpt":"Let $F$ be a graph. A hypergraph is called Berge-$F$ if it can be obtained by replacing each edge of $F$ by a hyperedge containing it. Let $\\mathcal{F}$ be a family of graphs. The Tur\\'an number of Berge-$\\mathcal{F}$ is the maximum possible number of edges in an $r$-uniform hypergraph on $n$ vertices containing no Berge-$F$ as a subhypergraph (for every $F \\in \\mathcal{F}$) and is denoted by $ex_r(n,\\mathcal{F})$.\n  We determine the asymptotics for the Tur\\'an number of Berge-$K_{2,t}$ by showing $$ex_3(n,K_{2,t})=\\frac{1}{6}(t-1)^{3/2} \\cdot n^{3/2}(1+o(1))$$ for any given $t \\ge 7$. We stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04134","kind":"arxiv","version":3},"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:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOmnqNQy9gPjMOLE0MaqExt72BlfY5nPObckX5EzkVMG/8L9yNqHOplabiCBWUGE9Ixc82SGrB3TE8arSs+fAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:50:15.244988Z"},"content_sha256":"2caf055d36543347a8bb0ae3d30d447063117b2c411ad3ffc093199ded9e4be8","schema_version":"1.0","event_id":"sha256:2caf055d36543347a8bb0ae3d30d447063117b2c411ad3ffc093199ded9e4be8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZLDH5C3MDUHFMNVSLKJIZXXGD/bundle.json","state_url":"https://pith.science/pith/EZLDH5C3MDUHFMNVSLKJIZXXGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZLDH5C3MDUHFMNVSLKJIZXXGD/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-30T07:50:15Z","links":{"resolver":"https://pith.science/pith/EZLDH5C3MDUHFMNVSLKJIZXXGD","bundle":"https://pith.science/pith/EZLDH5C3MDUHFMNVSLKJIZXXGD/bundle.json","state":"https://pith.science/pith/EZLDH5C3MDUHFMNVSLKJIZXXGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZLDH5C3MDUHFMNVSLKJIZXXGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EZLDH5C3MDUHFMNVSLKJIZXXGD","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":"0a2b13669e01cf58ab94421083fe8634b2ed9607bb9fd6fa08008ffa49a9b8aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-11T12:30:51Z","title_canon_sha256":"a52766ed69f7376e2ca295785a6aef5847ac2216b96ae4a1bcbb059edfd65f2d"},"schema_version":"1.0","source":{"id":"1705.04134","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04134","created_at":"2026-05-18T00:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04134v3","created_at":"2026-05-18T00:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04134","created_at":"2026-05-18T00:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"EZLDH5C3MDUH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZLDH5C3MDUHFMNV","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZLDH5C3","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:2caf055d36543347a8bb0ae3d30d447063117b2c411ad3ffc093199ded9e4be8","target":"graph","created_at":"2026-05-18T00:09:53Z","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$ be a graph. A hypergraph is called Berge-$F$ if it can be obtained by replacing each edge of $F$ by a hyperedge containing it. Let $\\mathcal{F}$ be a family of graphs. The Tur\\'an number of Berge-$\\mathcal{F}$ is the maximum possible number of edges in an $r$-uniform hypergraph on $n$ vertices containing no Berge-$F$ as a subhypergraph (for every $F \\in \\mathcal{F}$) and is denoted by $ex_r(n,\\mathcal{F})$.\n  We determine the asymptotics for the Tur\\'an number of Berge-$K_{2,t}$ by showing $$ex_3(n,K_{2,t})=\\frac{1}{6}(t-1)^{3/2} \\cdot n^{3/2}(1+o(1))$$ for any given $t \\ge 7$. We stud","authors_text":"Abhishek Methuku, D\\'aniel Gerbner, M\\'at\\'e Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-11T12:30:51Z","title":"Asymptotics for the Tur\\'an number of Berge-$K_{2,t}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04134","kind":"arxiv","version":3},"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:3d981c141f801595e5badba0a2892db934698575bc4899a7da4ad8615fc2933a","target":"record","created_at":"2026-05-18T00:09:53Z","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":"0a2b13669e01cf58ab94421083fe8634b2ed9607bb9fd6fa08008ffa49a9b8aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-11T12:30:51Z","title_canon_sha256":"a52766ed69f7376e2ca295785a6aef5847ac2216b96ae4a1bcbb059edfd65f2d"},"schema_version":"1.0","source":{"id":"1705.04134","kind":"arxiv","version":3}},"canonical_sha256":"265633f45b60e872b1b592d49466f730e29abe5cbc68bf327c5f748afede2058","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"265633f45b60e872b1b592d49466f730e29abe5cbc68bf327c5f748afede2058","first_computed_at":"2026-05-18T00:09:53.104259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:53.104259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qHOwUjNn25jV/dlBUogFEn4acn3B1hkWb4bj2GZIwLmnmDc8IXJ6GZtRSc6xpuHN/oA9ANUh/DMxer4tfeZ8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:53.104931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04134","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d981c141f801595e5badba0a2892db934698575bc4899a7da4ad8615fc2933a","sha256:2caf055d36543347a8bb0ae3d30d447063117b2c411ad3ffc093199ded9e4be8"],"state_sha256":"53535aeb09468727ad3dee5ee1b0eed69502996a513428a30e86a8f2789d3f5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwZeRqV6PvVZhpHDWLKL0gYrd2d2NLRI4r3dg8RkoiWLH5cXBkee6d7YdISbitkkvxRmvhuM4dv8dchXE67lBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:50:15.246981Z","bundle_sha256":"eca633905dfedfe098e7775b913453778f037f417f0859eeb175a7d19479ecdc"}}