{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DRJOGCJOME47FMYUS2JMVVD4E4","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":"25b5bc81175b908fa12bc320717564b101d5340ef5822e432699fc3e0fdf998a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-12T13:51:17Z","title_canon_sha256":"3efb1eb7c3aa7b600168f3c6621cc7a0bf92698fba2cf3db9e74e6334204fd01"},"schema_version":"1.0","source":{"id":"1609.03401","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03401","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03401v3","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03401","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"DRJOGCJOME47","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRJOGCJOME47FMYU","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRJOGCJO","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:bca736e3c5ea14d2721cc92a1a09bc1a21ae28824675387fe3c1ffc3b3791576","target":"graph","created_at":"2026-05-18T00:44:33Z","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 $\\mathcal{F}$ be an $r$-uniform hypergraph and $G$ be a multigraph. The hypergraph $\\mathcal{F}$ is a Berge-$G$ if there is a bijection $f: E(G) \\rightarrow E( \\mathcal{F} )$ such that $e \\subseteq f(e)$ for each $e \\in E(G)$. Given a family of multigraphs $\\mathcal{G}$, a hypergraph $\\mathcal{H}$ is said to be $\\mathcal{G}$-free if for each $G \\in \\mathcal{G}$, $\\mathcal{H}$ does not contain a subhypergraph that is isomorphic to a Berge-$G$. We prove bounds on the maximum number of edges in an $r$-uniform linear hypergraph that is $K_{2,t}$-free. We also determine an asymptotic formula fo","authors_text":"Craig Timmons","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-12T13:51:17Z","title":"On $r$-uniform linear hypergraphs with no Berge-$K_{2,t}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03401","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:3c2fea9d219422ad8fc89873d6fea9a54ffe25fc03df2c7576d3818ad5a2294b","target":"record","created_at":"2026-05-18T00:44:33Z","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":"25b5bc81175b908fa12bc320717564b101d5340ef5822e432699fc3e0fdf998a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-12T13:51:17Z","title_canon_sha256":"3efb1eb7c3aa7b600168f3c6621cc7a0bf92698fba2cf3db9e74e6334204fd01"},"schema_version":"1.0","source":{"id":"1609.03401","kind":"arxiv","version":3}},"canonical_sha256":"1c52e3092e6139f2b3149692cad47c27193b00a6203665ca9c7e53a16baf30a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c52e3092e6139f2b3149692cad47c27193b00a6203665ca9c7e53a16baf30a0","first_computed_at":"2026-05-18T00:44:33.719884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:33.719884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TB1httyhMBKnJKJelT955TuOQrX7OV7ozZG6NWB8YwHv6eSLV34Eq8X+1SMHIcZOpx8W8OKb1oATi1KrQCEgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:33.720337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03401","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c2fea9d219422ad8fc89873d6fea9a54ffe25fc03df2c7576d3818ad5a2294b","sha256:bca736e3c5ea14d2721cc92a1a09bc1a21ae28824675387fe3c1ffc3b3791576"],"state_sha256":"bfa8201684ca165d46b613747a54f5ca56ffb51700b69ca344f7acd1a289d434"}