{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MZ7WW55DGT2CYXC72SYIJZYXNS","short_pith_number":"pith:MZ7WW55D","schema_version":"1.0","canonical_sha256":"667f6b77a334f42c5c5fd4b084e7176cad020bf8222d83b0906e6acb35c7e192","source":{"kind":"arxiv","id":"2107.14713","version":1},"attestation_state":"computed","paper":{"title":"Crowns in linear $3$-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alvaro Carbonero, Andr\\'as Gy\\'arf\\'as, Jing Guo, Rona Wang, Shiyu Yan, Willem Fletcher","submitted_at":"2021-07-30T15:35:39Z","abstract_excerpt":"A \\textit{linear $3$-graph}, $H = (V, E)$, is a set, $V$, of vertices together with a set, $E$, of $3$-element subsets of $V$, called edges, so that any two distinct edges intersect in at most one vertex. The linear Tur\\'an number, ${\\rm ex}(n,F)$, is the maximum number of edges in a linear $3$-graph $H$ with $n$ vertices containing no copy of $F$.\n  We focus here on the \\textit{crown}, $C$, which consists of three pairwise disjoint edges (jewels) and a fourth edge (base) which intersects all of the jewels. Our main result is that every linear $3$-graph with minimum degree at least $4$ contain"},"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":"2107.14713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-30T15:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"ab9f1c0231cbc7b1a4f5f8ab8670a147fb992eedb37a72e8249a74358e4c64df","abstract_canon_sha256":"d2102903880da5868f3c2ddba97f7ad47e083c537c13847107abbf04085bec41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:03.748916Z","signature_b64":"PZJK69K9cehHUbrxy7ckkBTC6ZEBAtXUcg76Uh7Bhu139xL4ZFEb3gxjHVjOaLJn5t9m/FP3L/Ui6k+p6XX7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"667f6b77a334f42c5c5fd4b084e7176cad020bf8222d83b0906e6acb35c7e192","last_reissued_at":"2026-07-05T03:02:03.748080Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:03.748080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crowns in linear $3$-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alvaro Carbonero, Andr\\'as Gy\\'arf\\'as, Jing Guo, Rona Wang, Shiyu Yan, Willem Fletcher","submitted_at":"2021-07-30T15:35:39Z","abstract_excerpt":"A \\textit{linear $3$-graph}, $H = (V, E)$, is a set, $V$, of vertices together with a set, $E$, of $3$-element subsets of $V$, called edges, so that any two distinct edges intersect in at most one vertex. The linear Tur\\'an number, ${\\rm ex}(n,F)$, is the maximum number of edges in a linear $3$-graph $H$ with $n$ vertices containing no copy of $F$.\n  We focus here on the \\textit{crown}, $C$, which consists of three pairwise disjoint edges (jewels) and a fourth edge (base) which intersects all of the jewels. Our main result is that every linear $3$-graph with minimum degree at least $4$ contain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.14713","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.14713/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":"2107.14713","created_at":"2026-07-05T03:02:03.748184+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.14713v1","created_at":"2026-07-05T03:02:03.748184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.14713","created_at":"2026-07-05T03:02:03.748184+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZ7WW55DGT2C","created_at":"2026-07-05T03:02:03.748184+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZ7WW55DGT2CYXC7","created_at":"2026-07-05T03:02:03.748184+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZ7WW55D","created_at":"2026-07-05T03:02:03.748184+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.17325","citing_title":"Bounds on Linear Tur\\'{a}n Number for Trees","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10467","citing_title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MZ7WW55DGT2CYXC72SYIJZYXNS","json":"https://pith.science/pith/MZ7WW55DGT2CYXC72SYIJZYXNS.json","graph_json":"https://pith.science/api/pith-number/MZ7WW55DGT2CYXC72SYIJZYXNS/graph.json","events_json":"https://pith.science/api/pith-number/MZ7WW55DGT2CYXC72SYIJZYXNS/events.json","paper":"https://pith.science/paper/MZ7WW55D"},"agent_actions":{"view_html":"https://pith.science/pith/MZ7WW55DGT2CYXC72SYIJZYXNS","download_json":"https://pith.science/pith/MZ7WW55DGT2CYXC72SYIJZYXNS.json","view_paper":"https://pith.science/paper/MZ7WW55D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.14713&json=true","fetch_graph":"https://pith.science/api/pith-number/MZ7WW55DGT2CYXC72SYIJZYXNS/graph.json","fetch_events":"https://pith.science/api/pith-number/MZ7WW55DGT2CYXC72SYIJZYXNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZ7WW55DGT2CYXC72SYIJZYXNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZ7WW55DGT2CYXC72SYIJZYXNS/action/storage_attestation","attest_author":"https://pith.science/pith/MZ7WW55DGT2CYXC72SYIJZYXNS/action/author_attestation","sign_citation":"https://pith.science/pith/MZ7WW55DGT2CYXC72SYIJZYXNS/action/citation_signature","submit_replication":"https://pith.science/pith/MZ7WW55DGT2CYXC72SYIJZYXNS/action/replication_record"}},"created_at":"2026-07-05T03:02:03.748184+00:00","updated_at":"2026-07-05T03:02:03.748184+00:00"}