{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4GTHMA7BTVS2F6ENGSJTB5QV2B","short_pith_number":"pith:4GTHMA7B","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"},"canonical_sha256":"e1a67603e19d65a2f88d349330f615d04d6ea2ddce83e2cab025ae96ee25c2e0","source":{"kind":"arxiv","id":"2009.06840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.06840","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"2009.06840v1","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06840","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"4GTHMA7BTVS2","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"pith_short_16","alias_value":"4GTHMA7BTVS2F6EN","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"pith_short_8","alias_value":"4GTHMA7B","created_at":"2026-07-05T01:35:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4GTHMA7BTVS2F6ENGSJTB5QV2B","target":"record","payload":{"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"},"canonical_sha256":"e1a67603e19d65a2f88d349330f615d04d6ea2ddce83e2cab025ae96ee25c2e0","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"},"source_kind":"arxiv","source_id":"2009.06840","source_version":1,"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-05T01:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"flTSPnZiEgsxI0OZuGBEW5Yeflp9y/R3Vt63+VhGgJlCioL/rN4Ah/7nSoQAgTlVxHLzQKOEI8Bw53Cms5nAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T22:17:27.151855Z"},"content_sha256":"0f4a2f557d3d6627c6420234880b2c735155e26f1ad43a57e3ae6c7d2913c1f1","schema_version":"1.0","event_id":"sha256:0f4a2f557d3d6627c6420234880b2c735155e26f1ad43a57e3ae6c7d2913c1f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4GTHMA7BTVS2F6ENGSJTB5QV2B","target":"graph","payload":{"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"},"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-05T01:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqxsJZslxkmVWSvzkioA+PDm8r2aM3mlj6v2BMoIWMz/wlC6ZAP1tLB/tBu44r/eZe2UELSSFJlWzh+TyQW0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T22:17:27.152223Z"},"content_sha256":"7f942acbc4a413f5b4753cad28f9541beb214ca54745b9d8b66fa2fd99464653","schema_version":"1.0","event_id":"sha256:7f942acbc4a413f5b4753cad28f9541beb214ca54745b9d8b66fa2fd99464653"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/bundle.json","state_url":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/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-07-25T22:17:27Z","links":{"resolver":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B","bundle":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/bundle.json","state":"https://pith.science/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GTHMA7BTVS2F6ENGSJTB5QV2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4GTHMA7BTVS2F6ENGSJTB5QV2B","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":"de37a048392c71ba41904de0cd154599d136bbefb5a1b30645dcbc50293fb910","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-15T02:36:01Z","title_canon_sha256":"092ca1039ba5c0a93ef6ea06a0d8a939a1e5cb045363a878ac06dc77384e8e40"},"schema_version":"1.0","source":{"id":"2009.06840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.06840","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"2009.06840v1","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06840","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"4GTHMA7BTVS2","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"pith_short_16","alias_value":"4GTHMA7BTVS2F6EN","created_at":"2026-07-05T01:35:13Z"},{"alias_kind":"pith_short_8","alias_value":"4GTHMA7B","created_at":"2026-07-05T01:35:13Z"}],"graph_snapshots":[{"event_id":"sha256:7f942acbc4a413f5b4753cad28f9541beb214ca54745b9d8b66fa2fd99464653","target":"graph","created_at":"2026-07-05T01:35:13Z","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/2009.06840/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Benjian Lv, Kaishun Wang, Mengyu Cao, Sanming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-15T02:36:01Z","title":"Extremal even-cycle-free subgraphs of the complete transposition graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06840","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:0f4a2f557d3d6627c6420234880b2c735155e26f1ad43a57e3ae6c7d2913c1f1","target":"record","created_at":"2026-07-05T01:35:13Z","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":"de37a048392c71ba41904de0cd154599d136bbefb5a1b30645dcbc50293fb910","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-15T02:36:01Z","title_canon_sha256":"092ca1039ba5c0a93ef6ea06a0d8a939a1e5cb045363a878ac06dc77384e8e40"},"schema_version":"1.0","source":{"id":"2009.06840","kind":"arxiv","version":1}},"canonical_sha256":"e1a67603e19d65a2f88d349330f615d04d6ea2ddce83e2cab025ae96ee25c2e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1a67603e19d65a2f88d349330f615d04d6ea2ddce83e2cab025ae96ee25c2e0","first_computed_at":"2026-07-05T01:35:13.806492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:35:13.806492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CF2Uzan2J9mWVHtkS1ZvVTOFjefMN2ihpidvV9WTebJmSz/VInao4ZWODAn/XtTdhCZrDP1LRro5LYa8DwYTDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:35:13.806895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.06840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f4a2f557d3d6627c6420234880b2c735155e26f1ad43a57e3ae6c7d2913c1f1","sha256:7f942acbc4a413f5b4753cad28f9541beb214ca54745b9d8b66fa2fd99464653"],"state_sha256":"e415f5a45fb2e54c4e49b8f22edf66ecacad558120a11803e585e0cad35cba97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BTonYaj3APngFJ40gHq7/VvNnVkAOLar4PT1lwr0382Flh6WAk8RmIwwU+OgFNJ3nBOLfI1xAupasyQB+QLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T22:17:27.154263Z","bundle_sha256":"20b47d2be097d76b90dff7e5c342a42ca16df363f270856eaaaff04dfc5897fc"}}