{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SBZUDL47YDKWONBGA3JVWPJ6A5","short_pith_number":"pith:SBZUDL47","canonical_record":{"source":{"id":"1804.01317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T09:33:58Z","cross_cats_sorted":[],"title_canon_sha256":"92786b9310db59cce6ba7dd312891a739b0eda91bd859641b1d2ce9983d67680","abstract_canon_sha256":"0210abf86911738b5117b03c2c68295de41502ca7fbdde7c0cc909e191ef0979"},"schema_version":"1.0"},"canonical_sha256":"907341af9fc0d567342606d35b3d3e0759adfb178db1394b8801534acd602cea","source":{"kind":"arxiv","id":"1804.01317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01317","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01317v1","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01317","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"SBZUDL47YDKW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBZUDL47YDKWONBG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBZUDL47","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SBZUDL47YDKWONBGA3JVWPJ6A5","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T09:33:58Z","cross_cats_sorted":[],"title_canon_sha256":"92786b9310db59cce6ba7dd312891a739b0eda91bd859641b1d2ce9983d67680","abstract_canon_sha256":"0210abf86911738b5117b03c2c68295de41502ca7fbdde7c0cc909e191ef0979"},"schema_version":"1.0"},"canonical_sha256":"907341af9fc0d567342606d35b3d3e0759adfb178db1394b8801534acd602cea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:15.434695Z","signature_b64":"w4Ou/VFr4g64t08ERqL9qNV8dzmqKmNGueT7cnmgevs+BLedccJA0sqDG0S6MMeU7ZN0IWZexfiY0rNll3lZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"907341af9fc0d567342606d35b3d3e0759adfb178db1394b8801534acd602cea","last_reissued_at":"2026-05-18T00:19:15.434071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:15.434071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01317","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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/qprSq1ulIiU5I4P+++DFJl32RGK46x1GbvF6JNCQopOECvSqWeF9s83V0nsujKnYOEWsJ5BVImC6TGOffpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:37:52.059562Z"},"content_sha256":"72b11d623e17ffe4beb31470121e19dd489102563f65741834dc9d90a2281bb8","schema_version":"1.0","event_id":"sha256:72b11d623e17ffe4beb31470121e19dd489102563f65741834dc9d90a2281bb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SBZUDL47YDKWONBGA3JVWPJ6A5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow triangles and the Caccetta-H\\\"aggkvist conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthew DeVos, Ron Aharoni, Ron Holzman","submitted_at":"2018-04-04T09:33:58Z","abstract_excerpt":"A famous conjecture of Caccetta and H\\\"aggkvist is that in a digraph on $n$ vertices and minimum out-degree at least $\\frac{n}{r}$ there is a directed cycle of length $r$ or less. We consider the following generalization: in an undirected graph on $n$ vertices, any collection of $n$ disjoint sets of edges, each of size at least $\\frac{n}{r}$, has a rainbow cycle of length $r$ or less. We focus on the case $r=3$, and prove the existence of a rainbow triangle under somewhat stronger conditions than in the conjecture. For any fixed $k$ and large enough $n$, we determine the maximum number of edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01317","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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+emu6rplNT6E41dNfVZGMnPb+49+Zm+PNjQaTynumf+KYN2Gk78XDKP3Q4jVUoEfxhIuhv9Q/5uqRouchXiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:37:52.060208Z"},"content_sha256":"ccf72a618f2da4afb60bfb5b3ccb82ce3d5488daafdac65b2b25f57498ff69ef","schema_version":"1.0","event_id":"sha256:ccf72a618f2da4afb60bfb5b3ccb82ce3d5488daafdac65b2b25f57498ff69ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBZUDL47YDKWONBGA3JVWPJ6A5/bundle.json","state_url":"https://pith.science/pith/SBZUDL47YDKWONBGA3JVWPJ6A5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBZUDL47YDKWONBGA3JVWPJ6A5/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-25T02:37:52Z","links":{"resolver":"https://pith.science/pith/SBZUDL47YDKWONBGA3JVWPJ6A5","bundle":"https://pith.science/pith/SBZUDL47YDKWONBGA3JVWPJ6A5/bundle.json","state":"https://pith.science/pith/SBZUDL47YDKWONBGA3JVWPJ6A5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBZUDL47YDKWONBGA3JVWPJ6A5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SBZUDL47YDKWONBGA3JVWPJ6A5","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":"0210abf86911738b5117b03c2c68295de41502ca7fbdde7c0cc909e191ef0979","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T09:33:58Z","title_canon_sha256":"92786b9310db59cce6ba7dd312891a739b0eda91bd859641b1d2ce9983d67680"},"schema_version":"1.0","source":{"id":"1804.01317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01317","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01317v1","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01317","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"SBZUDL47YDKW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBZUDL47YDKWONBG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBZUDL47","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:ccf72a618f2da4afb60bfb5b3ccb82ce3d5488daafdac65b2b25f57498ff69ef","target":"graph","created_at":"2026-05-18T00:19:15Z","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":"A famous conjecture of Caccetta and H\\\"aggkvist is that in a digraph on $n$ vertices and minimum out-degree at least $\\frac{n}{r}$ there is a directed cycle of length $r$ or less. We consider the following generalization: in an undirected graph on $n$ vertices, any collection of $n$ disjoint sets of edges, each of size at least $\\frac{n}{r}$, has a rainbow cycle of length $r$ or less. We focus on the case $r=3$, and prove the existence of a rainbow triangle under somewhat stronger conditions than in the conjecture. For any fixed $k$ and large enough $n$, we determine the maximum number of edge","authors_text":"Matthew DeVos, Ron Aharoni, Ron Holzman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T09:33:58Z","title":"Rainbow triangles and the Caccetta-H\\\"aggkvist conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01317","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:72b11d623e17ffe4beb31470121e19dd489102563f65741834dc9d90a2281bb8","target":"record","created_at":"2026-05-18T00:19:15Z","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":"0210abf86911738b5117b03c2c68295de41502ca7fbdde7c0cc909e191ef0979","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T09:33:58Z","title_canon_sha256":"92786b9310db59cce6ba7dd312891a739b0eda91bd859641b1d2ce9983d67680"},"schema_version":"1.0","source":{"id":"1804.01317","kind":"arxiv","version":1}},"canonical_sha256":"907341af9fc0d567342606d35b3d3e0759adfb178db1394b8801534acd602cea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"907341af9fc0d567342606d35b3d3e0759adfb178db1394b8801534acd602cea","first_computed_at":"2026-05-18T00:19:15.434071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:15.434071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w4Ou/VFr4g64t08ERqL9qNV8dzmqKmNGueT7cnmgevs+BLedccJA0sqDG0S6MMeU7ZN0IWZexfiY0rNll3lZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:15.434695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72b11d623e17ffe4beb31470121e19dd489102563f65741834dc9d90a2281bb8","sha256:ccf72a618f2da4afb60bfb5b3ccb82ce3d5488daafdac65b2b25f57498ff69ef"],"state_sha256":"1828fdf27a8a294874ed9587f85f6fb6c7f9e02adc305cb8b8cd1c8165a30fcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aE6fG+Rh4/7BAX1PsCHMYNgSB0YWJSbi6gP50lvWG76ABMlq+ZCs1QifSa5As6Vqbf1LwMAPMxseXZhCV2iTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:37:52.063511Z","bundle_sha256":"930a4d0c85b23b45aec60041245641ab717e6b436cf8e74a395ae8d8efc2dfa6"}}