{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3O2GKEFSH6GY4AA7VWCTZM3BRG","short_pith_number":"pith:3O2GKEFS","schema_version":"1.0","canonical_sha256":"dbb46510b23f8d8e001fad853cb36189a0afb8932e17e8989b65868686956a4c","source":{"kind":"arxiv","id":"2007.01827","version":2},"attestation_state":"computed","paper":{"title":"Forbidding $K_{2,t}$ traces in triple systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruth Luo, Sam Spiro","submitted_at":"2020-07-03T17:32:08Z","abstract_excerpt":"Let $H$ and $F$ be hypergraphs. We say $H$ contains $F$ as a trace if there exists some set $S \\subseteq V(H)$ such that $H|_S:=\\{E\\cap S: E \\in E(H)\\}$ contains a subhypergraph isomorphic to $F$. In this paper we give an upper bound on the number of edges in a $3$-uniform hypergraph that does not contain $K_{2,t}$ as a trace when $t$ is large. In particular, we show that $ \\lim_{t\\to \\infty}\\lim_{n\\to \\infty} \\frac{\\mathrm{ex}(n, \\mathrm{Tr}_3(K_{2,t}))}{t^{3/2}n^{3/2}} = \\frac{1}{6}.$\n  Moreover, we show $\\frac{1}{2} n^{3/2} + o(n^{3/2}) \\leq \\mathrm{ex}(n, \\mathrm{Tr}_3(C_4)) \\leq \\frac{5}{"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2007.01827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-03T17:32:08Z","cross_cats_sorted":[],"title_canon_sha256":"08c1bb8ec44a85f371a2091dafa888902c4f8f234d10b1113929a5a823b52760","abstract_canon_sha256":"a953d4265397744be1894e086e707d320ae29fdf759b365c0e22f6bc3aac764b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:57.388165Z","signature_b64":"eJxODo52YRvoHSWBRfDmZ9UDgWJEW0W/aFvst2A99cFvFfUSTHsE3XWfRUnQ/Ran6DfHIxfN8hmNYdk9xVqtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbb46510b23f8d8e001fad853cb36189a0afb8932e17e8989b65868686956a4c","last_reissued_at":"2026-07-05T01:16:57.387824Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:57.387824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forbidding $K_{2,t}$ traces in triple systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruth Luo, Sam Spiro","submitted_at":"2020-07-03T17:32:08Z","abstract_excerpt":"Let $H$ and $F$ be hypergraphs. We say $H$ contains $F$ as a trace if there exists some set $S \\subseteq V(H)$ such that $H|_S:=\\{E\\cap S: E \\in E(H)\\}$ contains a subhypergraph isomorphic to $F$. In this paper we give an upper bound on the number of edges in a $3$-uniform hypergraph that does not contain $K_{2,t}$ as a trace when $t$ is large. In particular, we show that $ \\lim_{t\\to \\infty}\\lim_{n\\to \\infty} \\frac{\\mathrm{ex}(n, \\mathrm{Tr}_3(K_{2,t}))}{t^{3/2}n^{3/2}} = \\frac{1}{6}.$\n  Moreover, we show $\\frac{1}{2} n^{3/2} + o(n^{3/2}) \\leq \\mathrm{ex}(n, \\mathrm{Tr}_3(C_4)) \\leq \\frac{5}{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.01827","kind":"arxiv","version":2},"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/2007.01827/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2007.01827","created_at":"2026-07-05T01:16:57.387885+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.01827v2","created_at":"2026-07-05T01:16:57.387885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.01827","created_at":"2026-07-05T01:16:57.387885+00:00"},{"alias_kind":"pith_short_12","alias_value":"3O2GKEFSH6GY","created_at":"2026-07-05T01:16:57.387885+00:00"},{"alias_kind":"pith_short_16","alias_value":"3O2GKEFSH6GY4AA7","created_at":"2026-07-05T01:16:57.387885+00:00"},{"alias_kind":"pith_short_8","alias_value":"3O2GKEFS","created_at":"2026-07-05T01:16:57.387885+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3O2GKEFSH6GY4AA7VWCTZM3BRG","json":"https://pith.science/pith/3O2GKEFSH6GY4AA7VWCTZM3BRG.json","graph_json":"https://pith.science/api/pith-number/3O2GKEFSH6GY4AA7VWCTZM3BRG/graph.json","events_json":"https://pith.science/api/pith-number/3O2GKEFSH6GY4AA7VWCTZM3BRG/events.json","paper":"https://pith.science/paper/3O2GKEFS"},"agent_actions":{"view_html":"https://pith.science/pith/3O2GKEFSH6GY4AA7VWCTZM3BRG","download_json":"https://pith.science/pith/3O2GKEFSH6GY4AA7VWCTZM3BRG.json","view_paper":"https://pith.science/paper/3O2GKEFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.01827&json=true","fetch_graph":"https://pith.science/api/pith-number/3O2GKEFSH6GY4AA7VWCTZM3BRG/graph.json","fetch_events":"https://pith.science/api/pith-number/3O2GKEFSH6GY4AA7VWCTZM3BRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3O2GKEFSH6GY4AA7VWCTZM3BRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3O2GKEFSH6GY4AA7VWCTZM3BRG/action/storage_attestation","attest_author":"https://pith.science/pith/3O2GKEFSH6GY4AA7VWCTZM3BRG/action/author_attestation","sign_citation":"https://pith.science/pith/3O2GKEFSH6GY4AA7VWCTZM3BRG/action/citation_signature","submit_replication":"https://pith.science/pith/3O2GKEFSH6GY4AA7VWCTZM3BRG/action/replication_record"}},"created_at":"2026-07-05T01:16:57.387885+00:00","updated_at":"2026-07-05T01:16:57.387885+00:00"}