{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MZ7WW55DGT2CYXC72SYIJZYXNS","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":"d2102903880da5868f3c2ddba97f7ad47e083c537c13847107abbf04085bec41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-30T15:35:39Z","title_canon_sha256":"ab9f1c0231cbc7b1a4f5f8ab8670a147fb992eedb37a72e8249a74358e4c64df"},"schema_version":"1.0","source":{"id":"2107.14713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.14713","created_at":"2026-07-05T03:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"2107.14713v1","created_at":"2026-07-05T03:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.14713","created_at":"2026-07-05T03:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"MZ7WW55DGT2C","created_at":"2026-07-05T03:02:03Z"},{"alias_kind":"pith_short_16","alias_value":"MZ7WW55DGT2CYXC7","created_at":"2026-07-05T03:02:03Z"},{"alias_kind":"pith_short_8","alias_value":"MZ7WW55D","created_at":"2026-07-05T03:02:03Z"}],"graph_snapshots":[{"event_id":"sha256:8b534e49a066b68a6393fb36043129277bde950511009774e5336bfb877efc2c","target":"graph","created_at":"2026-07-05T03:02:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.14713/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alvaro Carbonero, Andr\\'as Gy\\'arf\\'as, Jing Guo, Rona Wang, Shiyu Yan, Willem Fletcher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-30T15:35:39Z","title":"Crowns in linear $3$-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.14713","kind":"arxiv","version":1},"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:c88e0a96444373675acaac59a17874fefa93831f9188562421caa7471c5f894c","target":"record","created_at":"2026-07-05T03:02:03Z","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":"d2102903880da5868f3c2ddba97f7ad47e083c537c13847107abbf04085bec41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-30T15:35:39Z","title_canon_sha256":"ab9f1c0231cbc7b1a4f5f8ab8670a147fb992eedb37a72e8249a74358e4c64df"},"schema_version":"1.0","source":{"id":"2107.14713","kind":"arxiv","version":1}},"canonical_sha256":"667f6b77a334f42c5c5fd4b084e7176cad020bf8222d83b0906e6acb35c7e192","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"667f6b77a334f42c5c5fd4b084e7176cad020bf8222d83b0906e6acb35c7e192","first_computed_at":"2026-07-05T03:02:03.748080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:02:03.748080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PZJK69K9cehHUbrxy7ckkBTC6ZEBAtXUcg76Uh7Bhu139xL4ZFEb3gxjHVjOaLJn5t9m/FP3L/Ui6k+p6XX7Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:02:03.748916Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.14713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c88e0a96444373675acaac59a17874fefa93831f9188562421caa7471c5f894c","sha256:8b534e49a066b68a6393fb36043129277bde950511009774e5336bfb877efc2c"],"state_sha256":"192795010642b3e81f5fdbaaa6993207d5408b92de77c8de01d8d5d860b7753b"}