{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4GTHMA7BTVS2F6ENGSJTB5QV2B","short_pith_number":"pith:4GTHMA7B","schema_version":"1.0","canonical_sha256":"e1a67603e19d65a2f88d349330f615d04d6ea2ddce83e2cab025ae96ee25c2e0","source":{"kind":"arxiv","id":"2009.06840","version":1},"attestation_state":"computed","paper":{"title":"Extremal even-cycle-free subgraphs of the complete transposition graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjian Lv, Kaishun Wang, Mengyu Cao, Sanming Zhou","submitted_at":"2020-09-15T02:36:01Z","abstract_excerpt":"Given graphs $G$ and $H$, the generalized Tur\\'{a}n number ${\\rm ex}(G,H)$ is the maximum number of edges in an $H$-free subgraph of $G$. In this paper, we obtain an asymptotic upper bound on ${\\rm ex}(CT_n,C_{2l})$ for any $n \\ge 3$ and $l\\geq2$, where $C_{2l}$ is the cycle of length $2l$ and $CT_n$ is the complete transposition graph which is defined as the Cayley graph on the symmetric group ${\\rm S}_n$ with respect to the set of all transpositions of ${\\rm S}_n$."},"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":"2009.06840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-15T02:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"092ca1039ba5c0a93ef6ea06a0d8a939a1e5cb045363a878ac06dc77384e8e40","abstract_canon_sha256":"de37a048392c71ba41904de0cd154599d136bbefb5a1b30645dcbc50293fb910"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:35:13.806895Z","signature_b64":"CF2Uzan2J9mWVHtkS1ZvVTOFjefMN2ihpidvV9WTebJmSz/VInao4ZWODAn/XtTdhCZrDP1LRro5LYa8DwYTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1a67603e19d65a2f88d349330f615d04d6ea2ddce83e2cab025ae96ee25c2e0","last_reissued_at":"2026-07-05T01:35:13.806492Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:35:13.806492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal even-cycle-free subgraphs of the complete transposition graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjian Lv, Kaishun Wang, Mengyu Cao, Sanming Zhou","submitted_at":"2020-09-15T02:36:01Z","abstract_excerpt":"Given graphs $G$ and $H$, the generalized Tur\\'{a}n number ${\\rm ex}(G,H)$ is the maximum number of edges in an $H$-free subgraph of $G$. In this paper, we obtain an asymptotic upper bound on ${\\rm ex}(CT_n,C_{2l})$ for any $n \\ge 3$ and $l\\geq2$, where $C_{2l}$ is the cycle of length $2l$ and $CT_n$ is the complete transposition graph which is defined as the Cayley graph on the symmetric group ${\\rm S}_n$ with respect to the set of all transpositions of ${\\rm S}_n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06840","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/2009.06840/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":"2009.06840","created_at":"2026-07-05T01:35:13.806549+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.06840v1","created_at":"2026-07-05T01:35:13.806549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06840","created_at":"2026-07-05T01:35:13.806549+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GTHMA7BTVS2","created_at":"2026-07-05T01:35:13.806549+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GTHMA7BTVS2F6EN","created_at":"2026-07-05T01:35:13.806549+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GTHMA7B","created_at":"2026-07-05T01:35:13.806549+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B","json":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B.json","graph_json":"https://pith.science/api/pith-number/4GTHMA7BTVS2F6ENGSJTB5QV2B/graph.json","events_json":"https://pith.science/api/pith-number/4GTHMA7BTVS2F6ENGSJTB5QV2B/events.json","paper":"https://pith.science/paper/4GTHMA7B"},"agent_actions":{"view_html":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B","download_json":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B.json","view_paper":"https://pith.science/paper/4GTHMA7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.06840&json=true","fetch_graph":"https://pith.science/api/pith-number/4GTHMA7BTVS2F6ENGSJTB5QV2B/graph.json","fetch_events":"https://pith.science/api/pith-number/4GTHMA7BTVS2F6ENGSJTB5QV2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/action/storage_attestation","attest_author":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/action/author_attestation","sign_citation":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/action/citation_signature","submit_replication":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/action/replication_record"}},"created_at":"2026-07-05T01:35:13.806549+00:00","updated_at":"2026-07-05T01:35:13.806549+00:00"}