{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FK6M5GJOW7SRLSOYBSAJ4BBJ76","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":"27dfcbcdced29388fa315c8c348d16cf9ea5a55e40df2a10f68380e0b87a4fd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-17T15:54:48Z","title_canon_sha256":"4988db9cbfda68eb17f255a53fbfcd42370a98862b907faa555a6c385c1193ce"},"schema_version":"1.0","source":{"id":"2606.19217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19217","created_at":"2026-06-19T16:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19217v1","created_at":"2026-06-19T16:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19217","created_at":"2026-06-19T16:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"FK6M5GJOW7SR","created_at":"2026-06-19T16:12:08Z"},{"alias_kind":"pith_short_16","alias_value":"FK6M5GJOW7SRLSOY","created_at":"2026-06-19T16:12:08Z"},{"alias_kind":"pith_short_8","alias_value":"FK6M5GJO","created_at":"2026-06-19T16:12:08Z"}],"graph_snapshots":[{"event_id":"sha256:9f49f0340a1f0a6182896cf8d421152cfa857df5340ad4100f99cc69f5ad420d","target":"graph","created_at":"2026-06-19T16:12:08Z","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/2606.19217/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For graphs $F$ and $H$, let $\\ex(n,F,H)$ denote the maximum number of copies of $F$ in an $n$-vertex $H$-free graph. Janzer, Longbrake and Yepremyan recently proved that, for fixed $3<a\\le b$ and sufficiently large $t$, \\[\n  \\ex(n,K_{a,b},K_{3,t})=\\Theta(n^3). \\] We make their threshold explicit, showing that this conclusion holds for all $t\\ge \\tau(b):=2\\max\\{3,\\lceil b/2\\rceil\\}+1.$ In particular, for every even $b\\ge 6$, this matches the necessary threshold $t=b+1$. The main new ingredient is an explicit finite-field point set whose plane sections are controlled directly, rather than throug","authors_text":"Caiyun Hu, Hezhi Wang, Jianfeng Hou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-17T15:54:48Z","title":"Explicit thresholds in a generalized Tur\\'an problem for \\(K_{3,t}\\)-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19217","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:163002450845faa4c076a51674ce46435c03ba3b04407b8af9dd75f23a7e6a93","target":"record","created_at":"2026-06-19T16:12:08Z","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":"27dfcbcdced29388fa315c8c348d16cf9ea5a55e40df2a10f68380e0b87a4fd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-17T15:54:48Z","title_canon_sha256":"4988db9cbfda68eb17f255a53fbfcd42370a98862b907faa555a6c385c1193ce"},"schema_version":"1.0","source":{"id":"2606.19217","kind":"arxiv","version":1}},"canonical_sha256":"2abcce992eb7e515c9d80c809e0429ffa779210e90bff7e5f610293811357de3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2abcce992eb7e515c9d80c809e0429ffa779210e90bff7e5f610293811357de3","first_computed_at":"2026-06-19T16:12:08.047891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:08.047891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cqwjJuVnWl3vPYrz/KRiwcH1M6yCoEXto6ebC0W2Y15ThLwST3fheWcKYmu0TTewjhIyd1d9sECpgMe0fb9kAQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:08.048233Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:163002450845faa4c076a51674ce46435c03ba3b04407b8af9dd75f23a7e6a93","sha256:9f49f0340a1f0a6182896cf8d421152cfa857df5340ad4100f99cc69f5ad420d"],"state_sha256":"335562761b7442d0a9fd46183551b41af6fdb691f4bad3fca2ebbf1962af6153"}