{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QGY7UGXZFROOSUVEN22KQNSSZD","short_pith_number":"pith:QGY7UGXZ","canonical_record":{"source":{"id":"1812.05750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-14T01:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"0b417664c96992375580cb41b7c9adc9b6b0ee606a77c456f7a2589ad80118e6","abstract_canon_sha256":"c4ad253b6be8ff68744664f2f7be15ce0bf780e4d3b1240b8742118e9a32bf23"},"schema_version":"1.0"},"canonical_sha256":"81b1fa1af92c5ce952a46eb4a83652c8c5ddf8ba89bbc7190102870b740414b7","source":{"kind":"arxiv","id":"1812.05750","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05750","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05750v2","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05750","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"QGY7UGXZFROO","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QGY7UGXZFROOSUVE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QGY7UGXZ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QGY7UGXZFROOSUVEN22KQNSSZD","target":"record","payload":{"canonical_record":{"source":{"id":"1812.05750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-14T01:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"0b417664c96992375580cb41b7c9adc9b6b0ee606a77c456f7a2589ad80118e6","abstract_canon_sha256":"c4ad253b6be8ff68744664f2f7be15ce0bf780e4d3b1240b8742118e9a32bf23"},"schema_version":"1.0"},"canonical_sha256":"81b1fa1af92c5ce952a46eb4a83652c8c5ddf8ba89bbc7190102870b740414b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.584405Z","signature_b64":"NbPOuSQPYfBP2XRilGSZjA14Zi+txwyfyQHp1GxqCd5UTkhRR8PK1tCSCP85Ofc2CXN84pvNdkMdA6uyrX3BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81b1fa1af92c5ce952a46eb4a83652c8c5ddf8ba89bbc7190102870b740414b7","last_reissued_at":"2026-05-17T23:54:58.583777Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.583777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.05750","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wHl1Ebojgnql2MaycJjGDl+EwKsaGndUcSlv1UwUL3V7Uvc5DYLntrUM2N8cwazs3BIOQRRe2VnMqHMEEBpWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:34:08.652955Z"},"content_sha256":"266f64a8b65cb1eba438d1ae5a5536a8ed91732d4ee996ac37a764f13c0324a1","schema_version":"1.0","event_id":"sha256:266f64a8b65cb1eba438d1ae5a5536a8ed91732d4ee996ac37a764f13c0324a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QGY7UGXZFROOSUVEN22KQNSSZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ordered and convex geometric trees with linear extremal function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstra\\\"ete, Zolt\\'an F\\\"uredi","submitted_at":"2018-12-14T01:01:01Z","abstract_excerpt":"The extremal functions $ex_{\\rightarrow}(n,F)$ and $ex_{\\cir}(n,F)$ for ordered and convex geometric acyclic graphs $F$ have been extensively investigated by a number of researchers. Basic questions are to determine when $ex_{\\rightarrow}(n,F)$ and $ex_{\\cir}(n,F)$ are linear in $n$, the latter posed by Bra\\ss-K\\'arolyi-Valtr in 2003. In this paper, we answer both these questions for every tree $F$.\n  We give a forbidden subgraph characterization for a family $\\cal T$ of ordered trees with $k$ edges, and show that $ex_{\\rightarrow}(n,T) = (k - 1)n - {k \\choose 2}$ for all $n \\geq k + 1$ when $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05750","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCQXYvT9I20S1HQnLdB/Jpyrc2SA9mEWjhAZzRSby5bTZXynyWi8n+vuZaVAEFwPWEPy4Z90rkMao34cyYv2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:34:08.653632Z"},"content_sha256":"7df27a3a18a8487f930a0a7e0fc4553bba4ec20c86425dfcbd53c48ea7bbd284","schema_version":"1.0","event_id":"sha256:7df27a3a18a8487f930a0a7e0fc4553bba4ec20c86425dfcbd53c48ea7bbd284"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGY7UGXZFROOSUVEN22KQNSSZD/bundle.json","state_url":"https://pith.science/pith/QGY7UGXZFROOSUVEN22KQNSSZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGY7UGXZFROOSUVEN22KQNSSZD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T16:34:08Z","links":{"resolver":"https://pith.science/pith/QGY7UGXZFROOSUVEN22KQNSSZD","bundle":"https://pith.science/pith/QGY7UGXZFROOSUVEN22KQNSSZD/bundle.json","state":"https://pith.science/pith/QGY7UGXZFROOSUVEN22KQNSSZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGY7UGXZFROOSUVEN22KQNSSZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QGY7UGXZFROOSUVEN22KQNSSZD","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":"c4ad253b6be8ff68744664f2f7be15ce0bf780e4d3b1240b8742118e9a32bf23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-14T01:01:01Z","title_canon_sha256":"0b417664c96992375580cb41b7c9adc9b6b0ee606a77c456f7a2589ad80118e6"},"schema_version":"1.0","source":{"id":"1812.05750","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05750","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05750v2","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05750","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"QGY7UGXZFROO","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QGY7UGXZFROOSUVE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QGY7UGXZ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:7df27a3a18a8487f930a0a7e0fc4553bba4ec20c86425dfcbd53c48ea7bbd284","target":"graph","created_at":"2026-05-17T23:54:58Z","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"},"paper":{"abstract_excerpt":"The extremal functions $ex_{\\rightarrow}(n,F)$ and $ex_{\\cir}(n,F)$ for ordered and convex geometric acyclic graphs $F$ have been extensively investigated by a number of researchers. Basic questions are to determine when $ex_{\\rightarrow}(n,F)$ and $ex_{\\cir}(n,F)$ are linear in $n$, the latter posed by Bra\\ss-K\\'arolyi-Valtr in 2003. In this paper, we answer both these questions for every tree $F$.\n  We give a forbidden subgraph characterization for a family $\\cal T$ of ordered trees with $k$ edges, and show that $ex_{\\rightarrow}(n,T) = (k - 1)n - {k \\choose 2}$ for all $n \\geq k + 1$ when $","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstra\\\"ete, Zolt\\'an F\\\"uredi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-14T01:01:01Z","title":"Ordered and convex geometric trees with linear extremal function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05750","kind":"arxiv","version":2},"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:266f64a8b65cb1eba438d1ae5a5536a8ed91732d4ee996ac37a764f13c0324a1","target":"record","created_at":"2026-05-17T23:54:58Z","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":"c4ad253b6be8ff68744664f2f7be15ce0bf780e4d3b1240b8742118e9a32bf23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-14T01:01:01Z","title_canon_sha256":"0b417664c96992375580cb41b7c9adc9b6b0ee606a77c456f7a2589ad80118e6"},"schema_version":"1.0","source":{"id":"1812.05750","kind":"arxiv","version":2}},"canonical_sha256":"81b1fa1af92c5ce952a46eb4a83652c8c5ddf8ba89bbc7190102870b740414b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81b1fa1af92c5ce952a46eb4a83652c8c5ddf8ba89bbc7190102870b740414b7","first_computed_at":"2026-05-17T23:54:58.583777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:58.583777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NbPOuSQPYfBP2XRilGSZjA14Zi+txwyfyQHp1GxqCd5UTkhRR8PK1tCSCP85Ofc2CXN84pvNdkMdA6uyrX3BAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:58.584405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05750","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:266f64a8b65cb1eba438d1ae5a5536a8ed91732d4ee996ac37a764f13c0324a1","sha256:7df27a3a18a8487f930a0a7e0fc4553bba4ec20c86425dfcbd53c48ea7bbd284"],"state_sha256":"70dc73b0f98696810ff2e2af8837fc7944f501e75e5b9ed781d467ee89968fca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxbZGKJLb0QWl+1cPVYD4Bt9xeB9ktD0yPzjpkUqLt3T8IvrcDC6Ckg0e+Ww9TkXUm6aOoEOQj7xy6WEBN4eDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:34:08.656958Z","bundle_sha256":"48d9010edc78f2197191141c2357c52c10a1015999aeeeba06740530ff178009"}}