{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZZCYHBERRFH5PNEGTIBZX7EVYO","short_pith_number":"pith:ZZCYHBER","canonical_record":{"source":{"id":"1509.07716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-25T13:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"fc12106c9457a02447a21c9cbb92c63156411880dad29e1f757a5e1f7ed1bd67","abstract_canon_sha256":"ea4b7158c60273f72b17bfd0c4b8c5641b1cb1973849488caeca57df429f6660"},"schema_version":"1.0"},"canonical_sha256":"ce45838491894fd7b4869a039bfc95c3a0c239e0ee46f9dc117dc96430b45689","source":{"kind":"arxiv","id":"1509.07716","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07716","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07716v2","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07716","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZZCYHBERRFH5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZZCYHBERRFH5PNEG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZZCYHBER","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZZCYHBERRFH5PNEGTIBZX7EVYO","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-25T13:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"fc12106c9457a02447a21c9cbb92c63156411880dad29e1f757a5e1f7ed1bd67","abstract_canon_sha256":"ea4b7158c60273f72b17bfd0c4b8c5641b1cb1973849488caeca57df429f6660"},"schema_version":"1.0"},"canonical_sha256":"ce45838491894fd7b4869a039bfc95c3a0c239e0ee46f9dc117dc96430b45689","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:00.863972Z","signature_b64":"UZks9ifYXVq3nk+AdXETFbi4iTZ7oLB0pTgw0wGi2a2ZNDNcweKDmE7/Nbig9SSw1Hxzdnfb7/Oc+I9yF8+GDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce45838491894fd7b4869a039bfc95c3a0c239e0ee46f9dc117dc96430b45689","last_reissued_at":"2026-05-18T00:09:00.863397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:00.863397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07716","source_version":2,"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:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KiLEQEHvgAdjk+pIOQHdTU10Gp6tzzhnYxKVTmx5yndI1m4tCD3cGb5xHH7jdE75KYhWrdjgOExIHza4t58eAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:45:55.868005Z"},"content_sha256":"075c95d415970ecc5f8a9b4ced44e0e6cb2f1f9cf8ceae1b262488c2c5247ffa","schema_version":"1.0","event_id":"sha256:075c95d415970ecc5f8a9b4ced44e0e6cb2f1f9cf8ceae1b262488c2c5247ffa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZZCYHBERRFH5PNEGTIBZX7EVYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The width of quadrangulations of the projective plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis Esperet, Mat\\v{e}j Stehl\\'ik","submitted_at":"2015-09-25T13:50:44Z","abstract_excerpt":"We show that every $4$-chromatic graph on $n$ vertices, with no two vertex-disjoint odd cycles, has an odd cycle of length at most $\\tfrac12\\,(1+\\sqrt{8n-7})$. Let $G$ be a non-bipartite quadrangulation of the projective plane on $n$ vertices. Our result immediately implies that $G$ has edge-width at most $\\tfrac12\\,(1+\\sqrt{8n-7})$, which is sharp for infinitely many values of $n$. We also show that $G$ has face-width (equivalently, contains an odd cycle transversal of cardinality) at most $\\tfrac14(1+\\sqrt{16 n-15})$, which is a constant away from the optimal; we prove a lower bound of $\\sqr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07716","kind":"arxiv","version":2},"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:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"saEnAwjMBZHeNvjEHXaf8bxVNxbEBFzp8KhKs/3nv/8Gk8RgYl18Lyg/Gu/UHcEhOSReqZvT5O6+o2Js3CmSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:45:55.868716Z"},"content_sha256":"1eeec11053e376deae7874ae740f4e6dce9accc8eacec0f5be3a53dd7f6d27e9","schema_version":"1.0","event_id":"sha256:1eeec11053e376deae7874ae740f4e6dce9accc8eacec0f5be3a53dd7f6d27e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZCYHBERRFH5PNEGTIBZX7EVYO/bundle.json","state_url":"https://pith.science/pith/ZZCYHBERRFH5PNEGTIBZX7EVYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZCYHBERRFH5PNEGTIBZX7EVYO/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-06-11T22:45:55Z","links":{"resolver":"https://pith.science/pith/ZZCYHBERRFH5PNEGTIBZX7EVYO","bundle":"https://pith.science/pith/ZZCYHBERRFH5PNEGTIBZX7EVYO/bundle.json","state":"https://pith.science/pith/ZZCYHBERRFH5PNEGTIBZX7EVYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZCYHBERRFH5PNEGTIBZX7EVYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZZCYHBERRFH5PNEGTIBZX7EVYO","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":"ea4b7158c60273f72b17bfd0c4b8c5641b1cb1973849488caeca57df429f6660","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-25T13:50:44Z","title_canon_sha256":"fc12106c9457a02447a21c9cbb92c63156411880dad29e1f757a5e1f7ed1bd67"},"schema_version":"1.0","source":{"id":"1509.07716","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07716","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07716v2","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07716","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZZCYHBERRFH5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZZCYHBERRFH5PNEG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZZCYHBER","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:1eeec11053e376deae7874ae740f4e6dce9accc8eacec0f5be3a53dd7f6d27e9","target":"graph","created_at":"2026-05-18T00:09:00Z","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":"We show that every $4$-chromatic graph on $n$ vertices, with no two vertex-disjoint odd cycles, has an odd cycle of length at most $\\tfrac12\\,(1+\\sqrt{8n-7})$. Let $G$ be a non-bipartite quadrangulation of the projective plane on $n$ vertices. Our result immediately implies that $G$ has edge-width at most $\\tfrac12\\,(1+\\sqrt{8n-7})$, which is sharp for infinitely many values of $n$. We also show that $G$ has face-width (equivalently, contains an odd cycle transversal of cardinality) at most $\\tfrac14(1+\\sqrt{16 n-15})$, which is a constant away from the optimal; we prove a lower bound of $\\sqr","authors_text":"Louis Esperet, Mat\\v{e}j Stehl\\'ik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-25T13:50:44Z","title":"The width of quadrangulations of the projective plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07716","kind":"arxiv","version":2},"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:075c95d415970ecc5f8a9b4ced44e0e6cb2f1f9cf8ceae1b262488c2c5247ffa","target":"record","created_at":"2026-05-18T00:09:00Z","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":"ea4b7158c60273f72b17bfd0c4b8c5641b1cb1973849488caeca57df429f6660","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-25T13:50:44Z","title_canon_sha256":"fc12106c9457a02447a21c9cbb92c63156411880dad29e1f757a5e1f7ed1bd67"},"schema_version":"1.0","source":{"id":"1509.07716","kind":"arxiv","version":2}},"canonical_sha256":"ce45838491894fd7b4869a039bfc95c3a0c239e0ee46f9dc117dc96430b45689","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce45838491894fd7b4869a039bfc95c3a0c239e0ee46f9dc117dc96430b45689","first_computed_at":"2026-05-18T00:09:00.863397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:00.863397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UZks9ifYXVq3nk+AdXETFbi4iTZ7oLB0pTgw0wGi2a2ZNDNcweKDmE7/Nbig9SSw1Hxzdnfb7/Oc+I9yF8+GDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:00.863972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07716","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:075c95d415970ecc5f8a9b4ced44e0e6cb2f1f9cf8ceae1b262488c2c5247ffa","sha256:1eeec11053e376deae7874ae740f4e6dce9accc8eacec0f5be3a53dd7f6d27e9"],"state_sha256":"25d6a0921d7d1730ed510b043e977af378e6c7eac837aae1cebef1ef587d15fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5w0va54R9uR1ZYE1FO+R8KvU0r/ZEuGj5Tsse224jxkDbjxj6dVlyJaoAXOPx0YevUnV1WWUN+/1VrZxeYppAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:45:55.873026Z","bundle_sha256":"3d595e2c1c5ab0f81cf4c96f6e6237dbc93745a23150f3d9e0c75b8c98afe88b"}}