{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:A3WJIP2PGVEF3W3LF4KR77YA4B","short_pith_number":"pith:A3WJIP2P","canonical_record":{"source":{"id":"1908.02902","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T01:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"398b3c3e311ce288ea0f84ad78e4924955b849a3f70a17ae26016deccd35a457","abstract_canon_sha256":"ebc83634d3be0f75bbe097bd9c23650b42a14c722da676067b1fe4e4a63cf0e0"},"schema_version":"1.0"},"canonical_sha256":"06ec943f4f35485ddb6b2f151fff00e0779d84ddc3222751600793579e73039a","source":{"kind":"arxiv","id":"1908.02902","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02902","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02902v4","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02902","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"A3WJIP2PGVEF","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_16","alias_value":"A3WJIP2PGVEF3W3L","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_8","alias_value":"A3WJIP2P","created_at":"2026-07-05T04:34:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:A3WJIP2PGVEF3W3LF4KR77YA4B","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02902","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T01:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"398b3c3e311ce288ea0f84ad78e4924955b849a3f70a17ae26016deccd35a457","abstract_canon_sha256":"ebc83634d3be0f75bbe097bd9c23650b42a14c722da676067b1fe4e4a63cf0e0"},"schema_version":"1.0"},"canonical_sha256":"06ec943f4f35485ddb6b2f151fff00e0779d84ddc3222751600793579e73039a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:25.010941Z","signature_b64":"0s2Ygzc/BsYg2Nv2lGaSB8a7RguV6OR5JddPEYWpfeVGq0rEgxU2IzL2iiUGnR0VWb3qJqjNXvzSBB8XjlddDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06ec943f4f35485ddb6b2f151fff00e0779d84ddc3222751600793579e73039a","last_reissued_at":"2026-07-05T04:34:25.010516Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:25.010516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02902","source_version":4,"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-07-05T04:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfI06qiE7WZG4Czwv1o6PsbsMYHsTCz+QN3bps0U+ntIYPzn7SKwRp1iwDqV6asOubJHMR/ZDDkKSTAu76wsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:19:07.101539Z"},"content_sha256":"25b4bda05bb4de91bfcfb73dd8e372780019e027820b1cc18f18e75a61472803","schema_version":"1.0","event_id":"sha256:25b4bda05bb4de91bfcfb73dd8e372780019e027820b1cc18f18e75a61472803"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:A3WJIP2PGVEF3W3LF4KR77YA4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proof of the Caccetta-Haggkvist conjecture for digraphs with small independence number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Patrick Hompe","submitted_at":"2019-08-08T01:51:33Z","abstract_excerpt":"For a digraph $G$ and $v \\in V(G)$, let $\\delta^+(v)$ be the number of out-neighbors of $v$ in $G$. The Caccetta-H\\\"{a}ggkvist conjecture states that for all $k \\ge 1$, if $G$ is a digraph with $n = |V(G)|$ such that $\\delta^+(v) \\ge n/k$ for all $v \\in V(G)$, then G contains a directed cycle of length at most $k$. In [2], N. Lichiardopol proved that this conjecture is true for digraphs with independence number equal to two. In this paper, we generalize that result, proving that the conjecture is true for digraphs with independence number at most $(k+1)/2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02902","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02902/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfNKck1hyj9CP0SQP36KOKWwTEfeun0JViGXxATk8Cphm/FbYVpZ7YLA4iAArthzZvlaFmKcUVcQc9qC8sqdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:19:07.102520Z"},"content_sha256":"440f0f182e66d960c828e036cddf7e46d853543eeaeeb09a1686e7f7f1df2291","schema_version":"1.0","event_id":"sha256:440f0f182e66d960c828e036cddf7e46d853543eeaeeb09a1686e7f7f1df2291"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3WJIP2PGVEF3W3LF4KR77YA4B/bundle.json","state_url":"https://pith.science/pith/A3WJIP2PGVEF3W3LF4KR77YA4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3WJIP2PGVEF3W3LF4KR77YA4B/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-08-16T13:19:07Z","links":{"resolver":"https://pith.science/pith/A3WJIP2PGVEF3W3LF4KR77YA4B","bundle":"https://pith.science/pith/A3WJIP2PGVEF3W3LF4KR77YA4B/bundle.json","state":"https://pith.science/pith/A3WJIP2PGVEF3W3LF4KR77YA4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3WJIP2PGVEF3W3LF4KR77YA4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:A3WJIP2PGVEF3W3LF4KR77YA4B","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":"ebc83634d3be0f75bbe097bd9c23650b42a14c722da676067b1fe4e4a63cf0e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T01:51:33Z","title_canon_sha256":"398b3c3e311ce288ea0f84ad78e4924955b849a3f70a17ae26016deccd35a457"},"schema_version":"1.0","source":{"id":"1908.02902","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02902","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02902v4","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02902","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"A3WJIP2PGVEF","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_16","alias_value":"A3WJIP2PGVEF3W3L","created_at":"2026-07-05T04:34:25Z"},{"alias_kind":"pith_short_8","alias_value":"A3WJIP2P","created_at":"2026-07-05T04:34:25Z"}],"graph_snapshots":[{"event_id":"sha256:440f0f182e66d960c828e036cddf7e46d853543eeaeeb09a1686e7f7f1df2291","target":"graph","created_at":"2026-07-05T04:34:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02902/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a digraph $G$ and $v \\in V(G)$, let $\\delta^+(v)$ be the number of out-neighbors of $v$ in $G$. The Caccetta-H\\\"{a}ggkvist conjecture states that for all $k \\ge 1$, if $G$ is a digraph with $n = |V(G)|$ such that $\\delta^+(v) \\ge n/k$ for all $v \\in V(G)$, then G contains a directed cycle of length at most $k$. In [2], N. Lichiardopol proved that this conjecture is true for digraphs with independence number equal to two. In this paper, we generalize that result, proving that the conjecture is true for digraphs with independence number at most $(k+1)/2$.","authors_text":"Patrick Hompe","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T01:51:33Z","title":"Proof of the Caccetta-Haggkvist conjecture for digraphs with small independence number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02902","kind":"arxiv","version":4},"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:25b4bda05bb4de91bfcfb73dd8e372780019e027820b1cc18f18e75a61472803","target":"record","created_at":"2026-07-05T04:34:25Z","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":"ebc83634d3be0f75bbe097bd9c23650b42a14c722da676067b1fe4e4a63cf0e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T01:51:33Z","title_canon_sha256":"398b3c3e311ce288ea0f84ad78e4924955b849a3f70a17ae26016deccd35a457"},"schema_version":"1.0","source":{"id":"1908.02902","kind":"arxiv","version":4}},"canonical_sha256":"06ec943f4f35485ddb6b2f151fff00e0779d84ddc3222751600793579e73039a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06ec943f4f35485ddb6b2f151fff00e0779d84ddc3222751600793579e73039a","first_computed_at":"2026-07-05T04:34:25.010516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:34:25.010516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0s2Ygzc/BsYg2Nv2lGaSB8a7RguV6OR5JddPEYWpfeVGq0rEgxU2IzL2iiUGnR0VWb3qJqjNXvzSBB8XjlddDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:34:25.010941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02902","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25b4bda05bb4de91bfcfb73dd8e372780019e027820b1cc18f18e75a61472803","sha256:440f0f182e66d960c828e036cddf7e46d853543eeaeeb09a1686e7f7f1df2291"],"state_sha256":"f1c304eba765cb45d31c4f808e81b32ca5a9c2ca052611086498cee6003e0769"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BpTB1FrSQFQ4JAqBkSqYfGTPouXDV3im7VeSKYwypf+cSfd5WtCv2SWzydxjK6Va8Kk1rflLky+pXGaL9X9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:19:07.111018Z","bundle_sha256":"a3255d25e1930434f0b9f257a7781ff1d8358cc597c809d39a27073f0e986d9e"}}