{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OZFG7BLDGBQTPI4IM2LZHEGC4B","short_pith_number":"pith:OZFG7BLD","canonical_record":{"source":{"id":"1411.0290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-11-02T18:17:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7bdf3ca31562cf98ba19d6c0cf35f0b6507bc63f8fd96ed32e3775f04ec3d8cc","abstract_canon_sha256":"7b285407f10845eda09e0d1a664841079bb92c11ae6ec84293fb869302bd7d1c"},"schema_version":"1.0"},"canonical_sha256":"764a6f8563306137a38866979390c2e05ccd28eccc5e791c261bee3666fc94cf","source":{"kind":"arxiv","id":"1411.0290","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0290","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0290v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0290","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"OZFG7BLDGBQT","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZFG7BLDGBQTPI4I","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZFG7BLD","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OZFG7BLDGBQTPI4IM2LZHEGC4B","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-11-02T18:17:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7bdf3ca31562cf98ba19d6c0cf35f0b6507bc63f8fd96ed32e3775f04ec3d8cc","abstract_canon_sha256":"7b285407f10845eda09e0d1a664841079bb92c11ae6ec84293fb869302bd7d1c"},"schema_version":"1.0"},"canonical_sha256":"764a6f8563306137a38866979390c2e05ccd28eccc5e791c261bee3666fc94cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:52.061603Z","signature_b64":"jgQRLElmRkJIgbHCMHNRKt920Atj0KfWb0MSL3+frJ8Iym/3YVUTJAod2WiI0wfdC7rKBmoRj7YtnL26XQrDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"764a6f8563306137a38866979390c2e05ccd28eccc5e791c261bee3666fc94cf","last_reissued_at":"2026-05-18T02:38:52.061156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:52.061156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0290","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-18T02:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EH8z2q2BLXSua1FT/EY5Hg9KztygJA/CqWVRDBpM+rK7zN38jirYjQKtrSDROTHicGiwVtkhVB/dPlHkkX9BCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:37:38.563281Z"},"content_sha256":"f59d4fb3445f4a0216d872f9f569e6ffec86abd49b89271fa841ef06f7498c97","schema_version":"1.0","event_id":"sha256:f59d4fb3445f4a0216d872f9f569e6ffec86abd49b89271fa841ef06f7498c97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OZFG7BLDGBQTPI4IM2LZHEGC4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interval cyclic edge-colorings of graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Petros A. Petrosyan, Sargis T. Mkhitaryan","submitted_at":"2014-11-02T18:17:01Z","abstract_excerpt":"A proper edge-coloring of a graph $G$ with colors $1,\\ldots,t$ is called an \\emph{interval cyclic $t$-coloring} if all colors are used, and the edges incident to each vertex $v\\in V(G)$ are colored by $d_{G}(v)$ consecutive colors modulo $t$, where $d_{G}(v)$ is the degree of a vertex $v$ in $G$. A graph $G$ is \\emph{interval cyclically colorable} if it has an interval cyclic $t$-coloring for some positive integer $t$. The set of all interval cyclically colorable graphs is denoted by $\\mathfrak{N}_{c}$. For a graph $G\\in \\mathfrak{N}_{c}$, the least and the greatest values of $t$ for which it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0290","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-18T02:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJOG55r9A+NBgZICQLUA+tSH4KoylThOL3i/B0VQ5XV3nPXjXSimVAUe4hsMSktrzL6WguUEm+4FsqDfbrMrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:37:38.563639Z"},"content_sha256":"ca289c7e30151538acc099d91a194094c9e5e3fd22a0fd322dc5dc5c43459fd4","schema_version":"1.0","event_id":"sha256:ca289c7e30151538acc099d91a194094c9e5e3fd22a0fd322dc5dc5c43459fd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/bundle.json","state_url":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/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-26T13:37:38Z","links":{"resolver":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B","bundle":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/bundle.json","state":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OZFG7BLDGBQTPI4IM2LZHEGC4B","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":"7b285407f10845eda09e0d1a664841079bb92c11ae6ec84293fb869302bd7d1c","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-11-02T18:17:01Z","title_canon_sha256":"7bdf3ca31562cf98ba19d6c0cf35f0b6507bc63f8fd96ed32e3775f04ec3d8cc"},"schema_version":"1.0","source":{"id":"1411.0290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0290","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0290v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0290","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"OZFG7BLDGBQT","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZFG7BLDGBQTPI4I","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZFG7BLD","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:ca289c7e30151538acc099d91a194094c9e5e3fd22a0fd322dc5dc5c43459fd4","target":"graph","created_at":"2026-05-18T02:38:52Z","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 proper edge-coloring of a graph $G$ with colors $1,\\ldots,t$ is called an \\emph{interval cyclic $t$-coloring} if all colors are used, and the edges incident to each vertex $v\\in V(G)$ are colored by $d_{G}(v)$ consecutive colors modulo $t$, where $d_{G}(v)$ is the degree of a vertex $v$ in $G$. A graph $G$ is \\emph{interval cyclically colorable} if it has an interval cyclic $t$-coloring for some positive integer $t$. The set of all interval cyclically colorable graphs is denoted by $\\mathfrak{N}_{c}$. For a graph $G\\in \\mathfrak{N}_{c}$, the least and the greatest values of $t$ for which it ","authors_text":"Petros A. Petrosyan, Sargis T. Mkhitaryan","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-11-02T18:17:01Z","title":"Interval cyclic edge-colorings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0290","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:f59d4fb3445f4a0216d872f9f569e6ffec86abd49b89271fa841ef06f7498c97","target":"record","created_at":"2026-05-18T02:38:52Z","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":"7b285407f10845eda09e0d1a664841079bb92c11ae6ec84293fb869302bd7d1c","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-11-02T18:17:01Z","title_canon_sha256":"7bdf3ca31562cf98ba19d6c0cf35f0b6507bc63f8fd96ed32e3775f04ec3d8cc"},"schema_version":"1.0","source":{"id":"1411.0290","kind":"arxiv","version":1}},"canonical_sha256":"764a6f8563306137a38866979390c2e05ccd28eccc5e791c261bee3666fc94cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"764a6f8563306137a38866979390c2e05ccd28eccc5e791c261bee3666fc94cf","first_computed_at":"2026-05-18T02:38:52.061156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:52.061156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jgQRLElmRkJIgbHCMHNRKt920Atj0KfWb0MSL3+frJ8Iym/3YVUTJAod2WiI0wfdC7rKBmoRj7YtnL26XQrDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:52.061603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f59d4fb3445f4a0216d872f9f569e6ffec86abd49b89271fa841ef06f7498c97","sha256:ca289c7e30151538acc099d91a194094c9e5e3fd22a0fd322dc5dc5c43459fd4"],"state_sha256":"ccaee6999b83da5a83b2216d0a7a313812d626a6ed768fed8637e50e19d0476b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5w5EY1YQa1CMV8H/RJVVzG2vD0NqWX0zqWkfUUiFdjJouf3BD8QupXeR3NkR6Vj7236ZdfZNiNz0uTTXYUJ4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:37:38.565544Z","bundle_sha256":"5f02b88171a4951c7be00ba794a23d225d6b8340f6c9065b804c8eb55da97386"}}