{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O3NRBXSLRGTSEB7MDCUR7BRMU2","short_pith_number":"pith:O3NRBXSL","canonical_record":{"source":{"id":"1708.08641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T08:44:24Z","cross_cats_sorted":[],"title_canon_sha256":"ffd79562b8f660e9bc52dd49e5f0b85296b82fc60af37a57aedd3236b3bc0d07","abstract_canon_sha256":"06e0d0e42c5666cd55a0872e9d695ec4017071f70907d397c066347c58e9b061"},"schema_version":"1.0"},"canonical_sha256":"76db10de4b89a72207ec18a91f862ca6a9af2c21c507bd8177049e8ab3badc1a","source":{"kind":"arxiv","id":"1708.08641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08641","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08641v1","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08641","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"pith_short_12","alias_value":"O3NRBXSLRGTS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O3NRBXSLRGTSEB7M","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O3NRBXSL","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O3NRBXSLRGTSEB7MDCUR7BRMU2","target":"record","payload":{"canonical_record":{"source":{"id":"1708.08641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T08:44:24Z","cross_cats_sorted":[],"title_canon_sha256":"ffd79562b8f660e9bc52dd49e5f0b85296b82fc60af37a57aedd3236b3bc0d07","abstract_canon_sha256":"06e0d0e42c5666cd55a0872e9d695ec4017071f70907d397c066347c58e9b061"},"schema_version":"1.0"},"canonical_sha256":"76db10de4b89a72207ec18a91f862ca6a9af2c21c507bd8177049e8ab3badc1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:27.202202Z","signature_b64":"JiL3xoZuZ+Tn3eb77ssJCR5/lujzMuxph6Yo+zFBigptTvYTc42ttMjIsYHVfyni7UxJdaz1JBwD0UTmMQB3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76db10de4b89a72207ec18a91f862ca6a9af2c21c507bd8177049e8ab3badc1a","last_reissued_at":"2026-05-18T00:36:27.201377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:27.201377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.08641","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:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4+P3AtOnjo2jReWSAGmFCn+aNRo5u6FWm9gnTpuAS1AFEHF8mbxpGO6xdWLr+wvYUXPWIlNWGFp1H0gdMZvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:18:18.704968Z"},"content_sha256":"a216f367ff03215ddc600785c504ab8d8b56ec3013d76617f9a8e9287cdd4397","schema_version":"1.0","event_id":"sha256:a216f367ff03215ddc600785c504ab8d8b56ec3013d76617f9a8e9287cdd4397"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O3NRBXSLRGTSEB7MDCUR7BRMU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hajo Broersma, Ruonan Li, Shenggui Zhang","submitted_at":"2017-08-29T08:44:24Z","abstract_excerpt":"It is conjectured that every edge-colored complete graph $G$ on $n$ vertices satisfying $\\Delta^{mon}(G)\\leq n-3k+1$ contains $k$ vertex-disjoint properly edge-colored cycles. We confirm this conjecture for $k=2$, prove several additional weaker results for general $k$, and we establish structural properties of possible minimum counterexamples to the conjecture. We also reveal a close relationship between properly edge-colored cycles in edge-colored complete graphs and directed cycles in multi-partite tournaments. Using this relationship and our results on edge-colored complete graphs, we obta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08641","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:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARaz5IVBIWXY0nQ0gkGwXeTwdiH3u2fnONCPH7RI3sW7MoqXb1GFbs3efdrBSw8VPlWX2kQeSWg6MFTlibcUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:18:18.705309Z"},"content_sha256":"36396287b04d8fed4e981bd930cb18743fb278cfa6d175ef4241048cf68546b6","schema_version":"1.0","event_id":"sha256:36396287b04d8fed4e981bd930cb18743fb278cfa6d175ef4241048cf68546b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3NRBXSLRGTSEB7MDCUR7BRMU2/bundle.json","state_url":"https://pith.science/pith/O3NRBXSLRGTSEB7MDCUR7BRMU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3NRBXSLRGTSEB7MDCUR7BRMU2/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-30T07:18:18Z","links":{"resolver":"https://pith.science/pith/O3NRBXSLRGTSEB7MDCUR7BRMU2","bundle":"https://pith.science/pith/O3NRBXSLRGTSEB7MDCUR7BRMU2/bundle.json","state":"https://pith.science/pith/O3NRBXSLRGTSEB7MDCUR7BRMU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3NRBXSLRGTSEB7MDCUR7BRMU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O3NRBXSLRGTSEB7MDCUR7BRMU2","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":"06e0d0e42c5666cd55a0872e9d695ec4017071f70907d397c066347c58e9b061","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T08:44:24Z","title_canon_sha256":"ffd79562b8f660e9bc52dd49e5f0b85296b82fc60af37a57aedd3236b3bc0d07"},"schema_version":"1.0","source":{"id":"1708.08641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08641","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08641v1","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08641","created_at":"2026-05-18T00:36:27Z"},{"alias_kind":"pith_short_12","alias_value":"O3NRBXSLRGTS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O3NRBXSLRGTSEB7M","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O3NRBXSL","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:36396287b04d8fed4e981bd930cb18743fb278cfa6d175ef4241048cf68546b6","target":"graph","created_at":"2026-05-18T00:36:27Z","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":"It is conjectured that every edge-colored complete graph $G$ on $n$ vertices satisfying $\\Delta^{mon}(G)\\leq n-3k+1$ contains $k$ vertex-disjoint properly edge-colored cycles. We confirm this conjecture for $k=2$, prove several additional weaker results for general $k$, and we establish structural properties of possible minimum counterexamples to the conjecture. We also reveal a close relationship between properly edge-colored cycles in edge-colored complete graphs and directed cycles in multi-partite tournaments. Using this relationship and our results on edge-colored complete graphs, we obta","authors_text":"Hajo Broersma, Ruonan Li, Shenggui Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T08:44:24Z","title":"Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08641","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:a216f367ff03215ddc600785c504ab8d8b56ec3013d76617f9a8e9287cdd4397","target":"record","created_at":"2026-05-18T00:36:27Z","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":"06e0d0e42c5666cd55a0872e9d695ec4017071f70907d397c066347c58e9b061","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T08:44:24Z","title_canon_sha256":"ffd79562b8f660e9bc52dd49e5f0b85296b82fc60af37a57aedd3236b3bc0d07"},"schema_version":"1.0","source":{"id":"1708.08641","kind":"arxiv","version":1}},"canonical_sha256":"76db10de4b89a72207ec18a91f862ca6a9af2c21c507bd8177049e8ab3badc1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76db10de4b89a72207ec18a91f862ca6a9af2c21c507bd8177049e8ab3badc1a","first_computed_at":"2026-05-18T00:36:27.201377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:27.201377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JiL3xoZuZ+Tn3eb77ssJCR5/lujzMuxph6Yo+zFBigptTvYTc42ttMjIsYHVfyni7UxJdaz1JBwD0UTmMQB3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:27.202202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a216f367ff03215ddc600785c504ab8d8b56ec3013d76617f9a8e9287cdd4397","sha256:36396287b04d8fed4e981bd930cb18743fb278cfa6d175ef4241048cf68546b6"],"state_sha256":"363ab1daef8ac1edcbb3b0102f24252391b6546aea628169e47896a0adb74ef7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUYdtC4hSuBJ73dCzT1Q54FAaypMieMiVe0sJXM42CV1xAlizfxeRlssmkrt2WB6ekpwsCknAiAKkUjy50TBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:18:18.707215Z","bundle_sha256":"3032d5769afdeec55bffe46cc7bf64ab1a4c3d10097c7e0c926a60c789aab336"}}