{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PTES53KTVFOBDBPUEDM646OYWP","short_pith_number":"pith:PTES53KT","canonical_record":{"source":{"id":"1806.06903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T19:53:53Z","cross_cats_sorted":[],"title_canon_sha256":"23d053ef195bd2c7f8f6ce045e3cb6c16a08be8ed60f9615f6cd19c59f0e5d61","abstract_canon_sha256":"c7d0a92e710410f250920ec608977de11ff96049010fa2ba571a4ab410eb0c37"},"schema_version":"1.0"},"canonical_sha256":"7cc92eed53a95c1185f420d9ee79d8b3d9c14d5d3f3464b66e7955029f5392ca","source":{"kind":"arxiv","id":"1806.06903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06903","created_at":"2026-05-18T00:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06903v1","created_at":"2026-05-18T00:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06903","created_at":"2026-05-18T00:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"PTES53KTVFOB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PTES53KTVFOBDBPU","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PTES53KT","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PTES53KTVFOBDBPUEDM646OYWP","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T19:53:53Z","cross_cats_sorted":[],"title_canon_sha256":"23d053ef195bd2c7f8f6ce045e3cb6c16a08be8ed60f9615f6cd19c59f0e5d61","abstract_canon_sha256":"c7d0a92e710410f250920ec608977de11ff96049010fa2ba571a4ab410eb0c37"},"schema_version":"1.0"},"canonical_sha256":"7cc92eed53a95c1185f420d9ee79d8b3d9c14d5d3f3464b66e7955029f5392ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:58.155209Z","signature_b64":"5CGrnu9oa893Y1GCzDyJPXyCunmJnW+GHQIse74bL1NUNBTbKMHBz0sM1lTPf/fdMm5Y7WcIZEb7CrDwNCWhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cc92eed53a95c1185f420d9ee79d8b3d9c14d5d3f3464b66e7955029f5392ca","last_reissued_at":"2026-05-18T00:12:58.154502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:58.154502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06903","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:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fz74rrXX8BpGBB0lQKflp81GpV+HJ5xU0mbisob2FDGVofNpzsmhP9zFdNvrrUryRAqhvXuJslyghvgGMrl8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:03:52.651753Z"},"content_sha256":"9596230950feadf8fd30a0ddd0b711c1d1542e51d5b476b1c0f5f7a72da748af","schema_version":"1.0","event_id":"sha256:9596230950feadf8fd30a0ddd0b711c1d1542e51d5b476b1c0f5f7a72da748af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PTES53KTVFOBDBPUEDM646OYWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cyclic triangle factors in regular tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lina Li, Theodore Molla","submitted_at":"2018-06-18T19:53:53Z","abstract_excerpt":"Both Cuckler and Yuster independently conjectured that when $n$ is an odd positive multiple of $3$ every regular tournament on $n$ vertices contains a collection of $n/3$ vertex-disjoint copies of the cyclic triangle. Soon after, Keevash and Sudakov proved that if $G$ is an orientation of a graph on $n$ vertices in which every vertex has both indegree and outdegree at least $(1/2 - o(1))n$, then there exists a collection of vertex-disjoint cyclic triangles that covers all but at most $3$ vertices. In this paper, we resolve the conjecture of Cuckler and Yuster for sufficiently large $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06903","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:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Djwr29+yj3JI/zKC3jrIWRhPoett8x05tIkdVH2VRPYTGdO58pH9XTDHIksu8dBSYWtMCQmzHFA6kVer/uc6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:03:52.652345Z"},"content_sha256":"3a54e68526f58e0faef790d7ca33410bc5727e43bb512a14a5320053911c9e7d","schema_version":"1.0","event_id":"sha256:3a54e68526f58e0faef790d7ca33410bc5727e43bb512a14a5320053911c9e7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTES53KTVFOBDBPUEDM646OYWP/bundle.json","state_url":"https://pith.science/pith/PTES53KTVFOBDBPUEDM646OYWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTES53KTVFOBDBPUEDM646OYWP/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-07T09:03:52Z","links":{"resolver":"https://pith.science/pith/PTES53KTVFOBDBPUEDM646OYWP","bundle":"https://pith.science/pith/PTES53KTVFOBDBPUEDM646OYWP/bundle.json","state":"https://pith.science/pith/PTES53KTVFOBDBPUEDM646OYWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTES53KTVFOBDBPUEDM646OYWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PTES53KTVFOBDBPUEDM646OYWP","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":"c7d0a92e710410f250920ec608977de11ff96049010fa2ba571a4ab410eb0c37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T19:53:53Z","title_canon_sha256":"23d053ef195bd2c7f8f6ce045e3cb6c16a08be8ed60f9615f6cd19c59f0e5d61"},"schema_version":"1.0","source":{"id":"1806.06903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06903","created_at":"2026-05-18T00:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06903v1","created_at":"2026-05-18T00:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06903","created_at":"2026-05-18T00:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"PTES53KTVFOB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PTES53KTVFOBDBPU","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PTES53KT","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:3a54e68526f58e0faef790d7ca33410bc5727e43bb512a14a5320053911c9e7d","target":"graph","created_at":"2026-05-18T00:12:58Z","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":"Both Cuckler and Yuster independently conjectured that when $n$ is an odd positive multiple of $3$ every regular tournament on $n$ vertices contains a collection of $n/3$ vertex-disjoint copies of the cyclic triangle. Soon after, Keevash and Sudakov proved that if $G$ is an orientation of a graph on $n$ vertices in which every vertex has both indegree and outdegree at least $(1/2 - o(1))n$, then there exists a collection of vertex-disjoint cyclic triangles that covers all but at most $3$ vertices. In this paper, we resolve the conjecture of Cuckler and Yuster for sufficiently large $n$.","authors_text":"Lina Li, Theodore Molla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T19:53:53Z","title":"Cyclic triangle factors in regular tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06903","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:9596230950feadf8fd30a0ddd0b711c1d1542e51d5b476b1c0f5f7a72da748af","target":"record","created_at":"2026-05-18T00:12:58Z","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":"c7d0a92e710410f250920ec608977de11ff96049010fa2ba571a4ab410eb0c37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T19:53:53Z","title_canon_sha256":"23d053ef195bd2c7f8f6ce045e3cb6c16a08be8ed60f9615f6cd19c59f0e5d61"},"schema_version":"1.0","source":{"id":"1806.06903","kind":"arxiv","version":1}},"canonical_sha256":"7cc92eed53a95c1185f420d9ee79d8b3d9c14d5d3f3464b66e7955029f5392ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cc92eed53a95c1185f420d9ee79d8b3d9c14d5d3f3464b66e7955029f5392ca","first_computed_at":"2026-05-18T00:12:58.154502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:58.154502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5CGrnu9oa893Y1GCzDyJPXyCunmJnW+GHQIse74bL1NUNBTbKMHBz0sM1lTPf/fdMm5Y7WcIZEb7CrDwNCWhDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:58.155209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9596230950feadf8fd30a0ddd0b711c1d1542e51d5b476b1c0f5f7a72da748af","sha256:3a54e68526f58e0faef790d7ca33410bc5727e43bb512a14a5320053911c9e7d"],"state_sha256":"6a627834268924b8bb4270c9678f34ccf99064e430b4253fd890fe2e7a01f58d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ag5ATcIO/e6O9FOSZklY/Coa4igGltn30BA/I49p/gbuL9tOmgq+SSgadoCFapr/pemhaNb9b8K+2RakadYUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:03:52.655580Z","bundle_sha256":"3ad3c6a47cfc207ca49e76b41e4b257c787a945dac3070d0229a0877b1a1a1e8"}}