{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OZFG7BLDGBQTPI4IM2LZHEGC4B","short_pith_number":"pith:OZFG7BLD","schema_version":"1.0","canonical_sha256":"764a6f8563306137a38866979390c2e05ccd28eccc5e791c261bee3666fc94cf","source":{"kind":"arxiv","id":"1411.0290","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.0290","created_at":"2026-05-18T02:38:52.061228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0290v1","created_at":"2026-05-18T02:38:52.061228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0290","created_at":"2026-05-18T02:38:52.061228+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZFG7BLDGBQT","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZFG7BLDGBQTPI4I","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZFG7BLD","created_at":"2026-05-18T12:28:43.426989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B","json":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B.json","graph_json":"https://pith.science/api/pith-number/OZFG7BLDGBQTPI4IM2LZHEGC4B/graph.json","events_json":"https://pith.science/api/pith-number/OZFG7BLDGBQTPI4IM2LZHEGC4B/events.json","paper":"https://pith.science/paper/OZFG7BLD"},"agent_actions":{"view_html":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B","download_json":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B.json","view_paper":"https://pith.science/paper/OZFG7BLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0290&json=true","fetch_graph":"https://pith.science/api/pith-number/OZFG7BLDGBQTPI4IM2LZHEGC4B/graph.json","fetch_events":"https://pith.science/api/pith-number/OZFG7BLDGBQTPI4IM2LZHEGC4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/action/storage_attestation","attest_author":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/action/author_attestation","sign_citation":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/action/citation_signature","submit_replication":"https://pith.science/pith/OZFG7BLDGBQTPI4IM2LZHEGC4B/action/replication_record"}},"created_at":"2026-05-18T02:38:52.061228+00:00","updated_at":"2026-05-18T02:38:52.061228+00:00"}