{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FIHAO5KGDWRBHRQ3ZXJN6O6YAN","short_pith_number":"pith:FIHAO5KG","schema_version":"1.0","canonical_sha256":"2a0e0775461da213c61bcdd2df3bd80363f8710ae6f9ed7ba7dab2ed39c30a5f","source":{"kind":"arxiv","id":"2109.02729","version":1},"attestation_state":"computed","paper":{"title":"Improved Upper Bound on the Linear Tur\\'an Number of the Crown","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Willem Fletcher","submitted_at":"2021-09-06T20:48:37Z","abstract_excerpt":"A linear $3$-graph is a set of vertices along with a set of edges, which are three element subsets of the vertices, such that any two edges intersect in at most one vertex. The crown, $C$, is a specific $3$-graph consisting of three pairwise disjoint edges, called jewels, along with a fourth edge intersecting all three jewels. For a linear $3$-graph, $F$, the linear Tur\\'an number, $ex(n,F)$, is the maximum number of edges in any linear $3$-graph that does not contain $F$ as a subgraph. Currently, the best known bounds on the linear Tur\\'an number of the crown are\n  \\[ 6 \\Big \\lfloor \\frac{n-3"},"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":"2109.02729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-06T20:48:37Z","cross_cats_sorted":[],"title_canon_sha256":"675d1505f640629b977cdf816c94b2f1b2d2712aac87ef16336e235d7ffb93db","abstract_canon_sha256":"54aef0e835dbe50448429ed163b1a72a7cbe32a2894974a03a859abce4f4b76b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:12:18.467235Z","signature_b64":"C9JHX0DIokWiw4YAlk9FFsE1YT+PqXHkjY5cpxl7Bar4AObUrK/scuU3Bjih+3BphqHNgEuyoEp1YYaeL1yhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a0e0775461da213c61bcdd2df3bd80363f8710ae6f9ed7ba7dab2ed39c30a5f","last_reissued_at":"2026-07-05T03:12:18.466850Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:12:18.466850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Upper Bound on the Linear Tur\\'an Number of the Crown","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Willem Fletcher","submitted_at":"2021-09-06T20:48:37Z","abstract_excerpt":"A linear $3$-graph is a set of vertices along with a set of edges, which are three element subsets of the vertices, such that any two edges intersect in at most one vertex. The crown, $C$, is a specific $3$-graph consisting of three pairwise disjoint edges, called jewels, along with a fourth edge intersecting all three jewels. For a linear $3$-graph, $F$, the linear Tur\\'an number, $ex(n,F)$, is the maximum number of edges in any linear $3$-graph that does not contain $F$ as a subgraph. Currently, the best known bounds on the linear Tur\\'an number of the crown are\n  \\[ 6 \\Big \\lfloor \\frac{n-3"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.02729","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/2109.02729/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":"2109.02729","created_at":"2026-07-05T03:12:18.466902+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.02729v1","created_at":"2026-07-05T03:12:18.466902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.02729","created_at":"2026-07-05T03:12:18.466902+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIHAO5KGDWRB","created_at":"2026-07-05T03:12:18.466902+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIHAO5KGDWRBHRQ3","created_at":"2026-07-05T03:12:18.466902+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIHAO5KG","created_at":"2026-07-05T03:12:18.466902+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":6,"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":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FIHAO5KGDWRBHRQ3ZXJN6O6YAN","json":"https://pith.science/pith/FIHAO5KGDWRBHRQ3ZXJN6O6YAN.json","graph_json":"https://pith.science/api/pith-number/FIHAO5KGDWRBHRQ3ZXJN6O6YAN/graph.json","events_json":"https://pith.science/api/pith-number/FIHAO5KGDWRBHRQ3ZXJN6O6YAN/events.json","paper":"https://pith.science/paper/FIHAO5KG"},"agent_actions":{"view_html":"https://pith.science/pith/FIHAO5KGDWRBHRQ3ZXJN6O6YAN","download_json":"https://pith.science/pith/FIHAO5KGDWRBHRQ3ZXJN6O6YAN.json","view_paper":"https://pith.science/paper/FIHAO5KG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.02729&json=true","fetch_graph":"https://pith.science/api/pith-number/FIHAO5KGDWRBHRQ3ZXJN6O6YAN/graph.json","fetch_events":"https://pith.science/api/pith-number/FIHAO5KGDWRBHRQ3ZXJN6O6YAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIHAO5KGDWRBHRQ3ZXJN6O6YAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIHAO5KGDWRBHRQ3ZXJN6O6YAN/action/storage_attestation","attest_author":"https://pith.science/pith/FIHAO5KGDWRBHRQ3ZXJN6O6YAN/action/author_attestation","sign_citation":"https://pith.science/pith/FIHAO5KGDWRBHRQ3ZXJN6O6YAN/action/citation_signature","submit_replication":"https://pith.science/pith/FIHAO5KGDWRBHRQ3ZXJN6O6YAN/action/replication_record"}},"created_at":"2026-07-05T03:12:18.466902+00:00","updated_at":"2026-07-05T03:12:18.466902+00:00"}