{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZULGCPGR74I2FOKKKTUF2NJCKP","short_pith_number":"pith:ZULGCPGR","canonical_record":{"source":{"id":"1708.05454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-17T22:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"b3153c4b55a1edcd7869fd9c10f2dbdc5d06bdbf89a01f61fe8ab1383702d5d3","abstract_canon_sha256":"0b7466b79fe6b8801571bdc8b35389f848e1f0eb39ddabbeac0de45a79484b57"},"schema_version":"1.0"},"canonical_sha256":"cd16613cd1ff11a2b94a54e85d352253fe992b140b02ec442680349656610658","source":{"kind":"arxiv","id":"1708.05454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05454","created_at":"2026-05-18T00:37:50Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05454v1","created_at":"2026-05-18T00:37:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05454","created_at":"2026-05-18T00:37:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZULGCPGR74I2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZULGCPGR74I2FOKK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZULGCPGR","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZULGCPGR74I2FOKKKTUF2NJCKP","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-17T22:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"b3153c4b55a1edcd7869fd9c10f2dbdc5d06bdbf89a01f61fe8ab1383702d5d3","abstract_canon_sha256":"0b7466b79fe6b8801571bdc8b35389f848e1f0eb39ddabbeac0de45a79484b57"},"schema_version":"1.0"},"canonical_sha256":"cd16613cd1ff11a2b94a54e85d352253fe992b140b02ec442680349656610658","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:50.017674Z","signature_b64":"EzLqwz7L/86X8xM+1eb1mf0kskAt92SpPAvsaAj8ar8kFnk8/v9fItPcC87zyijLtcEo4QdUQEh4bFu6Ir6/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd16613cd1ff11a2b94a54e85d352253fe992b140b02ec442680349656610658","last_reissued_at":"2026-05-18T00:37:50.017196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:50.017196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05454","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-18T00:37:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNYcHh8hapUoFkD7BbvLVuIhcHLt9vLgyPbe/0DuLututfMI0c5sQBgUIyEct7RBSBcJ2GEHvDeFeak3eEa9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:29:27.911604Z"},"content_sha256":"682ab495bf919c1ba944ea4d1318efc97750a4450858a6a0de5829359fc9f1ab","schema_version":"1.0","event_id":"sha256:682ab495bf919c1ba944ea4d1318efc97750a4450858a6a0de5829359fc9f1ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZULGCPGR74I2FOKKKTUF2NJCKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On subgraphs of $C_{2k}$-free graphs and a problem of K\\\"uhn and Osthus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Gr\\'osz","submitted_at":"2017-08-17T22:43:55Z","abstract_excerpt":"Let $c$ denote the largest constant such that every $C_{6}$-free graph $G$ contains a bipartite and $C_4$-free subgraph having $c$ fraction of edges of $G$. Gy\\H{o}ri et al. showed that $\\frac{3}{8} \\le c \\le \\frac{2}{5}$. We prove that $c=\\frac{3}{8}$. More generally, we show that for any $\\varepsilon>0$, and any integer $k \\ge 2$, there is a $C_{2k}$-free graph $G_1$ which does not contain a bipartite subgraph of girth greater than $2k$ with more than $\\left(1-\\frac{1}{2^{2k-2}}\\right)\\frac{2}{2k-1}(1+\\varepsilon)$ fraction of the edges of $G_1$. There also exists a $C_{2k}$-free graph $G_2$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05454","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-18T00:37:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnTSEUq3iHiP1+ypWthGgV7Xjln+8ojaxJtjqoaAHtoWftBnR1rgvtV3XQvunyr5m/hY6PKfR11ZzOifYwmgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:29:27.912057Z"},"content_sha256":"674b1aa2b9ef8bb16da62d69858d3ad9622f1d9392f751191daf186dde312fc6","schema_version":"1.0","event_id":"sha256:674b1aa2b9ef8bb16da62d69858d3ad9622f1d9392f751191daf186dde312fc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZULGCPGR74I2FOKKKTUF2NJCKP/bundle.json","state_url":"https://pith.science/pith/ZULGCPGR74I2FOKKKTUF2NJCKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZULGCPGR74I2FOKKKTUF2NJCKP/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-27T09:29:27Z","links":{"resolver":"https://pith.science/pith/ZULGCPGR74I2FOKKKTUF2NJCKP","bundle":"https://pith.science/pith/ZULGCPGR74I2FOKKKTUF2NJCKP/bundle.json","state":"https://pith.science/pith/ZULGCPGR74I2FOKKKTUF2NJCKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZULGCPGR74I2FOKKKTUF2NJCKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZULGCPGR74I2FOKKKTUF2NJCKP","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":"0b7466b79fe6b8801571bdc8b35389f848e1f0eb39ddabbeac0de45a79484b57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-17T22:43:55Z","title_canon_sha256":"b3153c4b55a1edcd7869fd9c10f2dbdc5d06bdbf89a01f61fe8ab1383702d5d3"},"schema_version":"1.0","source":{"id":"1708.05454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05454","created_at":"2026-05-18T00:37:50Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05454v1","created_at":"2026-05-18T00:37:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05454","created_at":"2026-05-18T00:37:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZULGCPGR74I2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZULGCPGR74I2FOKK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZULGCPGR","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:674b1aa2b9ef8bb16da62d69858d3ad9622f1d9392f751191daf186dde312fc6","target":"graph","created_at":"2026-05-18T00:37:50Z","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":"Let $c$ denote the largest constant such that every $C_{6}$-free graph $G$ contains a bipartite and $C_4$-free subgraph having $c$ fraction of edges of $G$. Gy\\H{o}ri et al. showed that $\\frac{3}{8} \\le c \\le \\frac{2}{5}$. We prove that $c=\\frac{3}{8}$. More generally, we show that for any $\\varepsilon>0$, and any integer $k \\ge 2$, there is a $C_{2k}$-free graph $G_1$ which does not contain a bipartite subgraph of girth greater than $2k$ with more than $\\left(1-\\frac{1}{2^{2k-2}}\\right)\\frac{2}{2k-1}(1+\\varepsilon)$ fraction of the edges of $G_1$. There also exists a $C_{2k}$-free graph $G_2$","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Gr\\'osz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-17T22:43:55Z","title":"On subgraphs of $C_{2k}$-free graphs and a problem of K\\\"uhn and Osthus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05454","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:682ab495bf919c1ba944ea4d1318efc97750a4450858a6a0de5829359fc9f1ab","target":"record","created_at":"2026-05-18T00:37:50Z","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":"0b7466b79fe6b8801571bdc8b35389f848e1f0eb39ddabbeac0de45a79484b57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-17T22:43:55Z","title_canon_sha256":"b3153c4b55a1edcd7869fd9c10f2dbdc5d06bdbf89a01f61fe8ab1383702d5d3"},"schema_version":"1.0","source":{"id":"1708.05454","kind":"arxiv","version":1}},"canonical_sha256":"cd16613cd1ff11a2b94a54e85d352253fe992b140b02ec442680349656610658","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd16613cd1ff11a2b94a54e85d352253fe992b140b02ec442680349656610658","first_computed_at":"2026-05-18T00:37:50.017196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:50.017196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EzLqwz7L/86X8xM+1eb1mf0kskAt92SpPAvsaAj8ar8kFnk8/v9fItPcC87zyijLtcEo4QdUQEh4bFu6Ir6/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:50.017674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:682ab495bf919c1ba944ea4d1318efc97750a4450858a6a0de5829359fc9f1ab","sha256:674b1aa2b9ef8bb16da62d69858d3ad9622f1d9392f751191daf186dde312fc6"],"state_sha256":"1df06df8c8dfc8b2886a73610325dff8eadedfab92c8ee6d19a961f2ed23434b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjKovRvgsIgImYaOgjGY9tex9SC+7H7ardpC8dZxLwZSAMLYJLxcJse3nBAt4ksRIPIRMMOH6Bhmfj2re8JHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:29:27.916753Z","bundle_sha256":"d10206238c4a5d4236072c9b9bd8cf35a53fdc1f670e219dc54527a7d36620b9"}}