{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LUUTTLTM357MY3U4MIWJBI2MRG","short_pith_number":"pith:LUUTTLTM","canonical_record":{"source":{"id":"1108.4281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-22T11:44:32Z","cross_cats_sorted":[],"title_canon_sha256":"387acddd9e9bb5d81d589394c8b99458b73ce87d6240909f25bffdb69e00600c","abstract_canon_sha256":"9062278e47c545c93a3906043a74fa4b635353550ea0e3ce8755e7309fc875a9"},"schema_version":"1.0"},"canonical_sha256":"5d2939ae6cdf7ecc6e9c622c90a34c89b048c344b92577fb31eebe53e98258ff","source":{"kind":"arxiv","id":"1108.4281","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4281","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4281v1","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4281","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"LUUTTLTM357M","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LUUTTLTM357MY3U4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LUUTTLTM","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LUUTTLTM357MY3U4MIWJBI2MRG","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-22T11:44:32Z","cross_cats_sorted":[],"title_canon_sha256":"387acddd9e9bb5d81d589394c8b99458b73ce87d6240909f25bffdb69e00600c","abstract_canon_sha256":"9062278e47c545c93a3906043a74fa4b635353550ea0e3ce8755e7309fc875a9"},"schema_version":"1.0"},"canonical_sha256":"5d2939ae6cdf7ecc6e9c622c90a34c89b048c344b92577fb31eebe53e98258ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:55.809953Z","signature_b64":"wEJ9NxcPw2fyKHXwnULZ2PLIEvhKMuvApeTc1OBtZCppjxikZspOJpXh1H4+EPZNQWSsDlPkAsqMS5uCX0oxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d2939ae6cdf7ecc6e9c622c90a34c89b048c344b92577fb31eebe53e98258ff","last_reissued_at":"2026-05-18T04:14:55.809427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:55.809427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4281","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-18T04:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+bTp7UliNMHQBjo5sJYqJcWOLV0xnZ+OA3cMiU251nebo+1pFCuaJLIF+b1rJqS9Ky8rLF8t7eKh9ofSOsqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:22:57.666667Z"},"content_sha256":"31daf90df3c2cc1b887d1bf81a63f3ce9b1ab1845fcf01f78ba6ca34edb14bb9","schema_version":"1.0","event_id":"sha256:31daf90df3c2cc1b887d1bf81a63f3ce9b1ab1845fcf01f78ba6ca34edb14bb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LUUTTLTM357MY3U4MIWJBI2MRG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Min-max relations for odd cycles in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jean-Sebastien Sereni, Ladislav Stacho","submitted_at":"2011-08-22T11:44:32Z","abstract_excerpt":"Let m(G) be the maximum number of vertex-disjoint odd cycles of a graph G and t(G) the minimum number of vertices whose removal makes G bipartite. We show that t(G)<=6m(G) if G is planar. This improves the previous bound t(G)<=10m(G) by Fiorini, Hardy, Reed and Vetta [Math. Program. Ser. B 110 (2007), 71-91]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4281","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-18T04:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWLfT9E4hHLmc7xpxiBLE0j3T58KVb2LI8qGgb1WSX5XsDlsw/24X99IYAiqTjgPAe3KTvTT+WxAgeSe5yTyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:22:57.667457Z"},"content_sha256":"8d0ad7bb077eae250e288f14da67d04714dba0c52a55d3b2eaac2d2cca6cff8a","schema_version":"1.0","event_id":"sha256:8d0ad7bb077eae250e288f14da67d04714dba0c52a55d3b2eaac2d2cca6cff8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUUTTLTM357MY3U4MIWJBI2MRG/bundle.json","state_url":"https://pith.science/pith/LUUTTLTM357MY3U4MIWJBI2MRG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUUTTLTM357MY3U4MIWJBI2MRG/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-31T20:22:57Z","links":{"resolver":"https://pith.science/pith/LUUTTLTM357MY3U4MIWJBI2MRG","bundle":"https://pith.science/pith/LUUTTLTM357MY3U4MIWJBI2MRG/bundle.json","state":"https://pith.science/pith/LUUTTLTM357MY3U4MIWJBI2MRG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUUTTLTM357MY3U4MIWJBI2MRG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LUUTTLTM357MY3U4MIWJBI2MRG","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":"9062278e47c545c93a3906043a74fa4b635353550ea0e3ce8755e7309fc875a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-22T11:44:32Z","title_canon_sha256":"387acddd9e9bb5d81d589394c8b99458b73ce87d6240909f25bffdb69e00600c"},"schema_version":"1.0","source":{"id":"1108.4281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4281","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4281v1","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4281","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"LUUTTLTM357M","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LUUTTLTM357MY3U4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LUUTTLTM","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:8d0ad7bb077eae250e288f14da67d04714dba0c52a55d3b2eaac2d2cca6cff8a","target":"graph","created_at":"2026-05-18T04:14:55Z","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 m(G) be the maximum number of vertex-disjoint odd cycles of a graph G and t(G) the minimum number of vertices whose removal makes G bipartite. We show that t(G)<=6m(G) if G is planar. This improves the previous bound t(G)<=10m(G) by Fiorini, Hardy, Reed and Vetta [Math. Program. Ser. B 110 (2007), 71-91].","authors_text":"Daniel Kral, Jean-Sebastien Sereni, Ladislav Stacho","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-22T11:44:32Z","title":"Min-max relations for odd cycles in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4281","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:31daf90df3c2cc1b887d1bf81a63f3ce9b1ab1845fcf01f78ba6ca34edb14bb9","target":"record","created_at":"2026-05-18T04:14:55Z","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":"9062278e47c545c93a3906043a74fa4b635353550ea0e3ce8755e7309fc875a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-22T11:44:32Z","title_canon_sha256":"387acddd9e9bb5d81d589394c8b99458b73ce87d6240909f25bffdb69e00600c"},"schema_version":"1.0","source":{"id":"1108.4281","kind":"arxiv","version":1}},"canonical_sha256":"5d2939ae6cdf7ecc6e9c622c90a34c89b048c344b92577fb31eebe53e98258ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d2939ae6cdf7ecc6e9c622c90a34c89b048c344b92577fb31eebe53e98258ff","first_computed_at":"2026-05-18T04:14:55.809427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:55.809427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wEJ9NxcPw2fyKHXwnULZ2PLIEvhKMuvApeTc1OBtZCppjxikZspOJpXh1H4+EPZNQWSsDlPkAsqMS5uCX0oxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:55.809953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31daf90df3c2cc1b887d1bf81a63f3ce9b1ab1845fcf01f78ba6ca34edb14bb9","sha256:8d0ad7bb077eae250e288f14da67d04714dba0c52a55d3b2eaac2d2cca6cff8a"],"state_sha256":"135f5d24a0f282f1865a1eeaf8cfb036b957068241d8ce3a7a4b6d90dfb7f666"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbMwpBD1leLsXqSwkfa0OEwVnreV7T+eVgIwYklCRjSn6EQlvOWKY1Dg9yZHVR1mU6yJ/4HCDstpwKe6lDU1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:22:57.671961Z","bundle_sha256":"856883bb3b3fe4544c3d3f3a8e61f8a6fb9712c3dac85ad31a2d76e233a51c13"}}