{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MWQBADXXLCKPBF4TZUSBT2BMOF","short_pith_number":"pith:MWQBADXX","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"},"canonical_sha256":"65a0100ef75894f09793cd2419e82c71573658aa0e0ce742544a3bfadd65c7a5","source":{"kind":"arxiv","id":"1907.02725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02725","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02725v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02725","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"MWQBADXXLCKP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MWQBADXXLCKPBF4T","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MWQBADXX","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MWQBADXXLCKPBF4TZUSBT2BMOF","target":"record","payload":{"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"},"canonical_sha256":"65a0100ef75894f09793cd2419e82c71573658aa0e0ce742544a3bfadd65c7a5","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"},"source_kind":"arxiv","source_id":"1907.02725","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-05-17T23:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ijxksk0LApAJRz0JN1jEdaae2wWgBpFrWPjrGFHfK/cr6JJ9qcuDoyFFf/LmegV7BVUU7roVEuSxAHc5MbqOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:45:25.214199Z"},"content_sha256":"51cbd9316e5de7d83f605f3d532fa1c84668823abf74e7907ee384855def9170","schema_version":"1.0","event_id":"sha256:51cbd9316e5de7d83f605f3d532fa1c84668823abf74e7907ee384855def9170"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MWQBADXXLCKPBF4TZUSBT2BMOF","target":"graph","payload":{"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"},"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:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1HS25StiPBUJTx1FlZuLgaWUgcfnrUe0QxxXDKfFMbto97QE8PE/zLwiElOyjniGNJqEwTAcCQolL3sEVS0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:45:25.214962Z"},"content_sha256":"2b1b490b7bc6fba0f50b62a06e1ac5e8375fe8c43c45147c8d2b00585fa5aa2e","schema_version":"1.0","event_id":"sha256:2b1b490b7bc6fba0f50b62a06e1ac5e8375fe8c43c45147c8d2b00585fa5aa2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/bundle.json","state_url":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/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-05-25T18:45:25Z","links":{"resolver":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF","bundle":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/bundle.json","state":"https://pith.science/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWQBADXXLCKPBF4TZUSBT2BMOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MWQBADXXLCKPBF4TZUSBT2BMOF","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":"f6802e4bb4658109cfa3486368b8efacf3a59599cdc4d1f16b4927b01655a2de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-05T08:41:18Z","title_canon_sha256":"3b4ba488ef85ffa364fed6ab3b138842369b15521b20aacc6c02a67e40789c32"},"schema_version":"1.0","source":{"id":"1907.02725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02725","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02725v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02725","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"MWQBADXXLCKP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MWQBADXXLCKPBF4T","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MWQBADXX","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:2b1b490b7bc6fba0f50b62a06e1ac5e8375fe8c43c45147c8d2b00585fa5aa2e","target":"graph","created_at":"2026-05-17T23:41:23Z","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 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{","authors_text":"Benjian Lv, Kaishun Wang, Mengyu Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-05T08:41:18Z","title":"On even-cycle-free subgraphs of the doubled Johnson graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02725","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:51cbd9316e5de7d83f605f3d532fa1c84668823abf74e7907ee384855def9170","target":"record","created_at":"2026-05-17T23:41:23Z","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":"f6802e4bb4658109cfa3486368b8efacf3a59599cdc4d1f16b4927b01655a2de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-05T08:41:18Z","title_canon_sha256":"3b4ba488ef85ffa364fed6ab3b138842369b15521b20aacc6c02a67e40789c32"},"schema_version":"1.0","source":{"id":"1907.02725","kind":"arxiv","version":1}},"canonical_sha256":"65a0100ef75894f09793cd2419e82c71573658aa0e0ce742544a3bfadd65c7a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65a0100ef75894f09793cd2419e82c71573658aa0e0ce742544a3bfadd65c7a5","first_computed_at":"2026-05-17T23:41:23.379361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:23.379361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZGDg/9MYNid1eD0V8pqUJrw5pyCHxlvkw3VXX1XOzLJfj/175UnUHdZ/X1QeyWp88mG2rZqq48sUiAAB+GVQAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:23.380021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51cbd9316e5de7d83f605f3d532fa1c84668823abf74e7907ee384855def9170","sha256:2b1b490b7bc6fba0f50b62a06e1ac5e8375fe8c43c45147c8d2b00585fa5aa2e"],"state_sha256":"5dcb9dde19f30509c5fa80386103279abfc2f038a22d1d2066811680ff6bf6c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95EFurqIKqavqmolzXuos5toVHBilIukJstodyGGV+k2ia/RVGDVsfHGQQBQVQMWtljyjaalasUIdc30IHejAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:45:25.217938Z","bundle_sha256":"5576b2cfd3248a67527f3e69355dd4bc645e58d3b5dd278c7b9dddcde24a73b2"}}