{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4FYPSDTJX2WOVBNVCVTNTCXSFA","short_pith_number":"pith:4FYPSDTJ","canonical_record":{"source":{"id":"1809.08324","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-21T21:43:15Z","cross_cats_sorted":[],"title_canon_sha256":"1c77f2b6ee5bc313eea413c2f7b8cdfbf8327b514d388e881ab435bf1e0b09bc","abstract_canon_sha256":"a242f574af9f773e68f59017ea48d53887a19e8014c5bab749279938441bab86"},"schema_version":"1.0"},"canonical_sha256":"e170f90e69beacea85b51566d98af22811d48de930e1b0bd96797b78d41b854a","source":{"kind":"arxiv","id":"1809.08324","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08324","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08324v2","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08324","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"4FYPSDTJX2WO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4FYPSDTJX2WOVBNV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4FYPSDTJ","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4FYPSDTJX2WOVBNVCVTNTCXSFA","target":"record","payload":{"canonical_record":{"source":{"id":"1809.08324","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-21T21:43:15Z","cross_cats_sorted":[],"title_canon_sha256":"1c77f2b6ee5bc313eea413c2f7b8cdfbf8327b514d388e881ab435bf1e0b09bc","abstract_canon_sha256":"a242f574af9f773e68f59017ea48d53887a19e8014c5bab749279938441bab86"},"schema_version":"1.0"},"canonical_sha256":"e170f90e69beacea85b51566d98af22811d48de930e1b0bd96797b78d41b854a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:41.636363Z","signature_b64":"NUNcLVplQw7IS0p7I7b7u9z1B0pvyu9DgXTvx7oRAKFczyKfDDmpHUKAuFRBmR/b79TBRZ6ETus4tCYoaFLvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e170f90e69beacea85b51566d98af22811d48de930e1b0bd96797b78d41b854a","last_reissued_at":"2026-05-17T23:39:41.635539Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:41.635539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.08324","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-17T23:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OK+r3OS7V85kuJT64+pHx+qK2AIbDl93hnqRPhkjrwfMiQbLjLNlJQhK9z8ttuQmjzUfVIUGRiGgW7nsRov8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:40:23.639662Z"},"content_sha256":"1ca4d0b96729a086f2db2c4671c661184ccdd2c2d68d0ca2e55cd4effd178404","schema_version":"1.0","event_id":"sha256:1ca4d0b96729a086f2db2c4671c661184ccdd2c2d68d0ca2e55cd4effd178404"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4FYPSDTJX2WOVBNVCVTNTCXSFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short directed cycles in bipartite digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Seymour, Sophie Spirkl","submitted_at":"2018-09-21T21:43:15Z","abstract_excerpt":"The Caccetta-H\\\"aggkvist conjecture implies that for every integer $k\\ge 1$, if $G$ is a bipartite digraph, with $n$ vertices in each part, and every vertex has out-degree more than $n/(k+1)$, then $G$ has a directed cycle of length at most $2k$. If true this is best possible, and we prove this for $k = 1,2,3,4,6$ and all $k\\ge 224,539$.\n  More generally, we conjecture that for every integer $k\\ge 1$, and every pair of reals $\\alpha, \\beta> 0$ with $k\\alpha +\\beta>1$, if $G$ is a bipartite digraph with bipartition $(A,B)$, where every vertex in $A$ has out-degree at least $\\beta|B|$, and every"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08324","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-17T23:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DaKfcC0rvdxSxLN2FK93PLJdVFDQs4U780cqpQo5zAVfM/7+d4Qc4t8NU5yQ9sEiooOEbllzTgwzVf+dGIKWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:40:23.640094Z"},"content_sha256":"32ed4deb9e9b981dd8916e8b91b50c1312aa160c9423be32a38d54e5d618bf70","schema_version":"1.0","event_id":"sha256:32ed4deb9e9b981dd8916e8b91b50c1312aa160c9423be32a38d54e5d618bf70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FYPSDTJX2WOVBNVCVTNTCXSFA/bundle.json","state_url":"https://pith.science/pith/4FYPSDTJX2WOVBNVCVTNTCXSFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FYPSDTJX2WOVBNVCVTNTCXSFA/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-22T17:40:23Z","links":{"resolver":"https://pith.science/pith/4FYPSDTJX2WOVBNVCVTNTCXSFA","bundle":"https://pith.science/pith/4FYPSDTJX2WOVBNVCVTNTCXSFA/bundle.json","state":"https://pith.science/pith/4FYPSDTJX2WOVBNVCVTNTCXSFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FYPSDTJX2WOVBNVCVTNTCXSFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4FYPSDTJX2WOVBNVCVTNTCXSFA","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":"a242f574af9f773e68f59017ea48d53887a19e8014c5bab749279938441bab86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-21T21:43:15Z","title_canon_sha256":"1c77f2b6ee5bc313eea413c2f7b8cdfbf8327b514d388e881ab435bf1e0b09bc"},"schema_version":"1.0","source":{"id":"1809.08324","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08324","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08324v2","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08324","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"4FYPSDTJX2WO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4FYPSDTJX2WOVBNV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4FYPSDTJ","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:32ed4deb9e9b981dd8916e8b91b50c1312aa160c9423be32a38d54e5d618bf70","target":"graph","created_at":"2026-05-17T23:39:41Z","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 Caccetta-H\\\"aggkvist conjecture implies that for every integer $k\\ge 1$, if $G$ is a bipartite digraph, with $n$ vertices in each part, and every vertex has out-degree more than $n/(k+1)$, then $G$ has a directed cycle of length at most $2k$. If true this is best possible, and we prove this for $k = 1,2,3,4,6$ and all $k\\ge 224,539$.\n  More generally, we conjecture that for every integer $k\\ge 1$, and every pair of reals $\\alpha, \\beta> 0$ with $k\\alpha +\\beta>1$, if $G$ is a bipartite digraph with bipartition $(A,B)$, where every vertex in $A$ has out-degree at least $\\beta|B|$, and every","authors_text":"Paul Seymour, Sophie Spirkl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-21T21:43:15Z","title":"Short directed cycles in bipartite digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08324","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:1ca4d0b96729a086f2db2c4671c661184ccdd2c2d68d0ca2e55cd4effd178404","target":"record","created_at":"2026-05-17T23:39:41Z","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":"a242f574af9f773e68f59017ea48d53887a19e8014c5bab749279938441bab86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-21T21:43:15Z","title_canon_sha256":"1c77f2b6ee5bc313eea413c2f7b8cdfbf8327b514d388e881ab435bf1e0b09bc"},"schema_version":"1.0","source":{"id":"1809.08324","kind":"arxiv","version":2}},"canonical_sha256":"e170f90e69beacea85b51566d98af22811d48de930e1b0bd96797b78d41b854a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e170f90e69beacea85b51566d98af22811d48de930e1b0bd96797b78d41b854a","first_computed_at":"2026-05-17T23:39:41.635539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:41.635539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NUNcLVplQw7IS0p7I7b7u9z1B0pvyu9DgXTvx7oRAKFczyKfDDmpHUKAuFRBmR/b79TBRZ6ETus4tCYoaFLvDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:41.636363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08324","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ca4d0b96729a086f2db2c4671c661184ccdd2c2d68d0ca2e55cd4effd178404","sha256:32ed4deb9e9b981dd8916e8b91b50c1312aa160c9423be32a38d54e5d618bf70"],"state_sha256":"f003a80b5dbb14ce8232d33601cc52993f13fc77b109c997f5219979e9b019b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+dYBav7OtVUDBIjPIKNdfCg9ttANliKiw40/J0Bem/XF9o+h1PZfOf8Z3OhqRMCFJwzHXqJrcQzTb/JAd2+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:40:23.642450Z","bundle_sha256":"2d2fe0adb22255454c32091880c5e00fb6cd1daf914fe1b8dc5e8e4a2ae4adc8"}}