{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MWQBADXXLCKPBF4TZUSBT2BMOF","short_pith_number":"pith:MWQBADXX","schema_version":"1.0","canonical_sha256":"65a0100ef75894f09793cd2419e82c71573658aa0e0ce742544a3bfadd65c7a5","source":{"kind":"arxiv","id":"1907.02725","version":1},"attestation_state":"computed","paper":{"title":"On even-cycle-free subgraphs of the doubled Johnson 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","submitted_at":"2019-07-05T08:41:18Z","abstract_excerpt":"The generalized Tur\\'{a}n number ${\\rm ex}(G,H)$ is the maximum number of edges in an $H$-free subgraph of a graph $G.$ It is an important extension of the classical Tur\\'{a}n number ${\\rm ex}(n,H)$, which is the maximum number of edges in a graph with $n$ vertices that does not contain $H$ as a subgraph. In this paper, we consider the maximum number of edges in an even-cycle-free subgraph of the doubled Johnson graphs $J(n;k,k+1)$, which are bipartite subgraphs of hypercube graphs. We give an upper bound for ${\\rm ex}(J(n;k,k+1),C_{2r})$ with any fixed $k\\in\\mathbb{Z}^+$ and any $n\\in\\mathbb{"},"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":"1907.02725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-05T08:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"3b4ba488ef85ffa364fed6ab3b138842369b15521b20aacc6c02a67e40789c32","abstract_canon_sha256":"f6802e4bb4658109cfa3486368b8efacf3a59599cdc4d1f16b4927b01655a2de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:23.380021Z","signature_b64":"ZGDg/9MYNid1eD0V8pqUJrw5pyCHxlvkw3VXX1XOzLJfj/175UnUHdZ/X1QeyWp88mG2rZqq48sUiAAB+GVQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65a0100ef75894f09793cd2419e82c71573658aa0e0ce742544a3bfadd65c7a5","last_reissued_at":"2026-05-17T23:41:23.379361Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:23.379361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On even-cycle-free subgraphs of the doubled Johnson 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","submitted_at":"2019-07-05T08:41:18Z","abstract_excerpt":"The generalized Tur\\'{a}n number ${\\rm ex}(G,H)$ is the maximum number of edges in an $H$-free subgraph of a graph $G.$ It is an important extension of the classical Tur\\'{a}n number ${\\rm ex}(n,H)$, which is the maximum number of edges in a graph with $n$ vertices that does not contain $H$ as a subgraph. In this paper, we consider the maximum number of edges in an even-cycle-free subgraph of the doubled Johnson graphs $J(n;k,k+1)$, which are bipartite subgraphs of hypercube graphs. We give an upper bound for ${\\rm ex}(J(n;k,k+1),C_{2r})$ with any fixed $k\\in\\mathbb{Z}^+$ and any $n\\in\\mathbb{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02725","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":""},"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":"1907.02725","created_at":"2026-05-17T23:41:23.379469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02725v1","created_at":"2026-05-17T23:41:23.379469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02725","created_at":"2026-05-17T23:41:23.379469+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWQBADXXLCKP","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWQBADXXLCKPBF4T","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWQBADXX","created_at":"2026-05-18T12:33:24.271573+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/MWQBADXXLCKPBF4TZUSBT2BMOF","json":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF.json","graph_json":"https://pith.science/api/pith-number/MWQBADXXLCKPBF4TZUSBT2BMOF/graph.json","events_json":"https://pith.science/api/pith-number/MWQBADXXLCKPBF4TZUSBT2BMOF/events.json","paper":"https://pith.science/paper/MWQBADXX"},"agent_actions":{"view_html":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF","download_json":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF.json","view_paper":"https://pith.science/paper/MWQBADXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02725&json=true","fetch_graph":"https://pith.science/api/pith-number/MWQBADXXLCKPBF4TZUSBT2BMOF/graph.json","fetch_events":"https://pith.science/api/pith-number/MWQBADXXLCKPBF4TZUSBT2BMOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/action/storage_attestation","attest_author":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/action/author_attestation","sign_citation":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/action/citation_signature","submit_replication":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/action/replication_record"}},"created_at":"2026-05-17T23:41:23.379469+00:00","updated_at":"2026-05-17T23:41:23.379469+00:00"}