{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RKR6GLIWLBOZ2DEJJEKAG74FEO","short_pith_number":"pith:RKR6GLIW","canonical_record":{"source":{"id":"1509.05621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T13:30:17Z","cross_cats_sorted":[],"title_canon_sha256":"76bb039b1dba33a23fe12e08a125d70180777549100ec5de25569466ac97b03a","abstract_canon_sha256":"36bdfac7198dd4bb5ca4067599ff271de4d4d18e6d298fc5fb8f66e91c53199a"},"schema_version":"1.0"},"canonical_sha256":"8aa3e32d16585d9d0c894914037f8523bff0a4cf28cec5e21019d77680a08a5b","source":{"kind":"arxiv","id":"1509.05621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05621","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05621v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05621","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"RKR6GLIWLBOZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RKR6GLIWLBOZ2DEJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RKR6GLIW","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RKR6GLIWLBOZ2DEJJEKAG74FEO","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T13:30:17Z","cross_cats_sorted":[],"title_canon_sha256":"76bb039b1dba33a23fe12e08a125d70180777549100ec5de25569466ac97b03a","abstract_canon_sha256":"36bdfac7198dd4bb5ca4067599ff271de4d4d18e6d298fc5fb8f66e91c53199a"},"schema_version":"1.0"},"canonical_sha256":"8aa3e32d16585d9d0c894914037f8523bff0a4cf28cec5e21019d77680a08a5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.740179Z","signature_b64":"XTtHEJZw9AYaVX9QsNR3bg7ApdLtauKQaX3qqWNt//uNcdfaT0wm6QtNQX9hEEyPQeBTqO4UK3eLe/qFcl29Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aa3e32d16585d9d0c894914037f8523bff0a4cf28cec5e21019d77680a08a5b","last_reissued_at":"2026-05-18T01:32:42.739576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.739576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05621","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8iECoyKEzeMzbWcaUO/KnfBiSmoeE4PJry7j4eBBOJjUsZDf86yp8JKcoDUK5KLdq0GIwPFkqsWVCxvPMzduBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:41:12.875418Z"},"content_sha256":"9d58e0d81de0bc2eb803bd0f9f033bde125ea16ea4eb2844b21230bf468801b2","schema_version":"1.0","event_id":"sha256:9d58e0d81de0bc2eb803bd0f9f033bde125ea16ea4eb2844b21230bf468801b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RKR6GLIWLBOZ2DEJJEKAG74FEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Colored graphs without colorful cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ale\\v{s} Pultr, Petr Vojt\\v{e}chovsk\\'y, Richard N. Ball","submitted_at":"2015-09-18T13:30:17Z","abstract_excerpt":"A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a colored graph lacks colorful cycles iff it is Gallai, i.e., lacks colorful triangles. We then show that, under the operation $m\\circ n\\equiv m+n-2$, the omitted lengths of colorful cycles in a colored graph form a monoid isomorphic to a submonoid of the natural numbers which contains all integers past some point. We prove that several but not all such monoids are realized.\n  We then characterize exact Gallai graphs, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05621","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhKtisx+7Z5Q/LFrH6cnGVnr5ItDIF1lOnH8+Ki5kp1icBMiLXNdaHZmsna58+926+O8pMusXXJGl3SAosSECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:41:12.876132Z"},"content_sha256":"5727c597b51ebf078b5951d9ee8c7cec184c358af4e52291ae366331690f24cb","schema_version":"1.0","event_id":"sha256:5727c597b51ebf078b5951d9ee8c7cec184c358af4e52291ae366331690f24cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKR6GLIWLBOZ2DEJJEKAG74FEO/bundle.json","state_url":"https://pith.science/pith/RKR6GLIWLBOZ2DEJJEKAG74FEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKR6GLIWLBOZ2DEJJEKAG74FEO/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-01T01:41:12Z","links":{"resolver":"https://pith.science/pith/RKR6GLIWLBOZ2DEJJEKAG74FEO","bundle":"https://pith.science/pith/RKR6GLIWLBOZ2DEJJEKAG74FEO/bundle.json","state":"https://pith.science/pith/RKR6GLIWLBOZ2DEJJEKAG74FEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKR6GLIWLBOZ2DEJJEKAG74FEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RKR6GLIWLBOZ2DEJJEKAG74FEO","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":"36bdfac7198dd4bb5ca4067599ff271de4d4d18e6d298fc5fb8f66e91c53199a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T13:30:17Z","title_canon_sha256":"76bb039b1dba33a23fe12e08a125d70180777549100ec5de25569466ac97b03a"},"schema_version":"1.0","source":{"id":"1509.05621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05621","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05621v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05621","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"RKR6GLIWLBOZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RKR6GLIWLBOZ2DEJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RKR6GLIW","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:5727c597b51ebf078b5951d9ee8c7cec184c358af4e52291ae366331690f24cb","target":"graph","created_at":"2026-05-18T01:32:42Z","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 colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a colored graph lacks colorful cycles iff it is Gallai, i.e., lacks colorful triangles. We then show that, under the operation $m\\circ n\\equiv m+n-2$, the omitted lengths of colorful cycles in a colored graph form a monoid isomorphic to a submonoid of the natural numbers which contains all integers past some point. We prove that several but not all such monoids are realized.\n  We then characterize exact Gallai graphs, ","authors_text":"Ale\\v{s} Pultr, Petr Vojt\\v{e}chovsk\\'y, Richard N. Ball","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T13:30:17Z","title":"Colored graphs without colorful cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05621","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:9d58e0d81de0bc2eb803bd0f9f033bde125ea16ea4eb2844b21230bf468801b2","target":"record","created_at":"2026-05-18T01:32:42Z","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":"36bdfac7198dd4bb5ca4067599ff271de4d4d18e6d298fc5fb8f66e91c53199a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T13:30:17Z","title_canon_sha256":"76bb039b1dba33a23fe12e08a125d70180777549100ec5de25569466ac97b03a"},"schema_version":"1.0","source":{"id":"1509.05621","kind":"arxiv","version":1}},"canonical_sha256":"8aa3e32d16585d9d0c894914037f8523bff0a4cf28cec5e21019d77680a08a5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8aa3e32d16585d9d0c894914037f8523bff0a4cf28cec5e21019d77680a08a5b","first_computed_at":"2026-05-18T01:32:42.739576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.739576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XTtHEJZw9AYaVX9QsNR3bg7ApdLtauKQaX3qqWNt//uNcdfaT0wm6QtNQX9hEEyPQeBTqO4UK3eLe/qFcl29Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.740179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d58e0d81de0bc2eb803bd0f9f033bde125ea16ea4eb2844b21230bf468801b2","sha256:5727c597b51ebf078b5951d9ee8c7cec184c358af4e52291ae366331690f24cb"],"state_sha256":"e24984ce00ab9557e5c07484fb08a9a7dad9828909a453c03c746befb40057d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8f79iq8AODXfNQraD1Adcms+40sWJAmY01tRTxCVVFSk7vM+PUYNFQD+cHHUUmLui4houBI/ssrvvicBalbXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:41:12.879945Z","bundle_sha256":"ff7d678f220c05bdf58cceec428b1ae4573260bb063417bc459baa7f84600a16"}}