{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HLSILS6QVF2BAIGHKZMKSZ5WGP","short_pith_number":"pith:HLSILS6Q","canonical_record":{"source":{"id":"2103.10200","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-03-18T12:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"3da02a86801012dd01adb3a5c70fbcf1ac5af1dfceaba83605cc6064f1bcec94","abstract_canon_sha256":"0f9e8163366c2b297178f2abf8216bf0449409ee25ca382ededbbdd6f714295a"},"schema_version":"1.0"},"canonical_sha256":"3ae485cbd0a9741020c75658a967b633e53afa40742b86b115b8c5f44c61a27c","source":{"kind":"arxiv","id":"2103.10200","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.10200","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"2103.10200v3","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.10200","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"HLSILS6QVF2B","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"pith_short_16","alias_value":"HLSILS6QVF2BAIGH","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"pith_short_8","alias_value":"HLSILS6Q","created_at":"2026-07-05T05:43:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HLSILS6QVF2BAIGHKZMKSZ5WGP","target":"record","payload":{"canonical_record":{"source":{"id":"2103.10200","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-03-18T12:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"3da02a86801012dd01adb3a5c70fbcf1ac5af1dfceaba83605cc6064f1bcec94","abstract_canon_sha256":"0f9e8163366c2b297178f2abf8216bf0449409ee25ca382ededbbdd6f714295a"},"schema_version":"1.0"},"canonical_sha256":"3ae485cbd0a9741020c75658a967b633e53afa40742b86b115b8c5f44c61a27c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:43:07.326324Z","signature_b64":"Cew4CXXNm83r4Ywiz0/gHovzshWzfjEtKVWAgjMMPukwXlQ90jEYgCxaKsJSkUh8YGl3rt9d3qIL/LEiDGthDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ae485cbd0a9741020c75658a967b633e53afa40742b86b115b8c5f44c61a27c","last_reissued_at":"2026-07-05T05:43:07.325800Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:43:07.325800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.10200","source_version":3,"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-07-05T05:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdzxnGDb19t3hpriLTNRUPWDDfpszDrPnjwd2wxwho5u7m2FkY5Anjs/0v48Oc++fpsrR8Ojp8YVtZH1X8jbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:09:43.244469Z"},"content_sha256":"d2f986b2ffb32641c06a3b7f7a5c440b94b76f2df9c2fa65ef894cbbf0177a22","schema_version":"1.0","event_id":"sha256:d2f986b2ffb32641c06a3b7f7a5c440b94b76f2df9c2fa65ef894cbbf0177a22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HLSILS6QVF2BAIGHKZMKSZ5WGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Tur\\'an Number of Generalized Theta Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiao-Chuan Liu, Xu Yang","submitted_at":"2021-03-18T12:07:26Z","abstract_excerpt":"Let $\\Theta_{k_1,\\cdots,k_\\ell}$ denote the generalized theta graph, which consists of $\\ell$ internally disjoint paths with lengths $k_1,\\cdots, k_{\\ell}$, connecting two fixed vertices. We estimate the corresponding extremal number $\\text{ex}(n,\\Theta_{k_1,\\cdots,k_\\ell})$. When the lengths of all paths have the same parity and at most one path has length 1, $\\text{ex}(n,\\Theta_{k_1,\\cdots,k_\\ell})$ is $O(n^{1+1/k^\\ast})$, where $2k^\\ast$ is the length of the smallest cycle in $\\Theta_{k_1,\\cdots,k_\\ell}$. We also establish matching lower bound in the particular case of $\\text{ex}(n,\\Theta_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.10200","kind":"arxiv","version":3},"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/2103.10200/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"},"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-07-05T05:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2tXhM0KPS4wQPkkjLbgWH3yzqK+eHA3T1SjMKQhjX502AwkE8swkZ8GNS8946rn2aYgDjYRSZbosFx0npZ3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:09:43.245156Z"},"content_sha256":"0bb0df558bc9c738bd957aa2a8ff40ec15e462cbaf7c7d342cd85fb631a9e06a","schema_version":"1.0","event_id":"sha256:0bb0df558bc9c738bd957aa2a8ff40ec15e462cbaf7c7d342cd85fb631a9e06a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLSILS6QVF2BAIGHKZMKSZ5WGP/bundle.json","state_url":"https://pith.science/pith/HLSILS6QVF2BAIGHKZMKSZ5WGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLSILS6QVF2BAIGHKZMKSZ5WGP/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-08-05T11:09:43Z","links":{"resolver":"https://pith.science/pith/HLSILS6QVF2BAIGHKZMKSZ5WGP","bundle":"https://pith.science/pith/HLSILS6QVF2BAIGHKZMKSZ5WGP/bundle.json","state":"https://pith.science/pith/HLSILS6QVF2BAIGHKZMKSZ5WGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLSILS6QVF2BAIGHKZMKSZ5WGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HLSILS6QVF2BAIGHKZMKSZ5WGP","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":"0f9e8163366c2b297178f2abf8216bf0449409ee25ca382ededbbdd6f714295a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-03-18T12:07:26Z","title_canon_sha256":"3da02a86801012dd01adb3a5c70fbcf1ac5af1dfceaba83605cc6064f1bcec94"},"schema_version":"1.0","source":{"id":"2103.10200","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.10200","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"2103.10200v3","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.10200","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"HLSILS6QVF2B","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"pith_short_16","alias_value":"HLSILS6QVF2BAIGH","created_at":"2026-07-05T05:43:07Z"},{"alias_kind":"pith_short_8","alias_value":"HLSILS6Q","created_at":"2026-07-05T05:43:07Z"}],"graph_snapshots":[{"event_id":"sha256:0bb0df558bc9c738bd957aa2a8ff40ec15e462cbaf7c7d342cd85fb631a9e06a","target":"graph","created_at":"2026-07-05T05:43:07Z","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/2103.10200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\Theta_{k_1,\\cdots,k_\\ell}$ denote the generalized theta graph, which consists of $\\ell$ internally disjoint paths with lengths $k_1,\\cdots, k_{\\ell}$, connecting two fixed vertices. We estimate the corresponding extremal number $\\text{ex}(n,\\Theta_{k_1,\\cdots,k_\\ell})$. When the lengths of all paths have the same parity and at most one path has length 1, $\\text{ex}(n,\\Theta_{k_1,\\cdots,k_\\ell})$ is $O(n^{1+1/k^\\ast})$, where $2k^\\ast$ is the length of the smallest cycle in $\\Theta_{k_1,\\cdots,k_\\ell}$. We also establish matching lower bound in the particular case of $\\text{ex}(n,\\Theta_{","authors_text":"Xiao-Chuan Liu, Xu Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-03-18T12:07:26Z","title":"On the Tur\\'an Number of Generalized Theta Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.10200","kind":"arxiv","version":3},"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:d2f986b2ffb32641c06a3b7f7a5c440b94b76f2df9c2fa65ef894cbbf0177a22","target":"record","created_at":"2026-07-05T05:43:07Z","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":"0f9e8163366c2b297178f2abf8216bf0449409ee25ca382ededbbdd6f714295a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-03-18T12:07:26Z","title_canon_sha256":"3da02a86801012dd01adb3a5c70fbcf1ac5af1dfceaba83605cc6064f1bcec94"},"schema_version":"1.0","source":{"id":"2103.10200","kind":"arxiv","version":3}},"canonical_sha256":"3ae485cbd0a9741020c75658a967b633e53afa40742b86b115b8c5f44c61a27c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ae485cbd0a9741020c75658a967b633e53afa40742b86b115b8c5f44c61a27c","first_computed_at":"2026-07-05T05:43:07.325800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:43:07.325800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cew4CXXNm83r4Ywiz0/gHovzshWzfjEtKVWAgjMMPukwXlQ90jEYgCxaKsJSkUh8YGl3rt9d3qIL/LEiDGthDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:43:07.326324Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.10200","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2f986b2ffb32641c06a3b7f7a5c440b94b76f2df9c2fa65ef894cbbf0177a22","sha256:0bb0df558bc9c738bd957aa2a8ff40ec15e462cbaf7c7d342cd85fb631a9e06a"],"state_sha256":"ca141dc08f70a2926e0ae846a3109d30f7548d430997a30bafe4da85516d9623"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SWeiuJOEozuhHQDUHuDxlYqbzYQbi5u3zDeoi0I7VtPRF4Utmqh+0Q3Q9Ku3bAiQyNbY08wJUZL7P3KXCU3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T11:09:43.251202Z","bundle_sha256":"31f72c33520cd5b151c6f9cf703cb268a9fb07ad021b508dbbfd0f77c9142bee"}}