{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G3W7VFZFMR7IZSNTDAJBBIVA7C","short_pith_number":"pith:G3W7VFZF","schema_version":"1.0","canonical_sha256":"36edfa9725647e8cc9b3181210a2a0f8ac43fdedc00c7a12ba9b888b69be51f7","source":{"kind":"arxiv","id":"1606.09389","version":2},"attestation_state":"computed","paper":{"title":"Some Results on Cyclic Interval Edge Colorings of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan","submitted_at":"2016-06-30T08:34:53Z","abstract_excerpt":"A proper edge coloring of a graph $G$ with colors $1,2,\\dots,t$ is called a \\emph{cyclic interval $t$-coloring} if for each vertex $v$ of $G$ the edges incident to $v$ are colored by consecutive colors, under the condition that color $1$ is considered as consecutive to color $t$. We prove that a bipartite graph $G$ with even maximum degree $\\Delta(G)\\geq 4$ admits a cyclic interval $\\Delta(G)$-coloring if for every vertex $v$ the degree $d_G(v)$ satisfies either $d_G(v)\\geq \\Delta(G)-2$ or $d_G(v)\\leq 2$. We also prove that every Eulerian bipartite graph $G$ with maximum degree at most $8$ has"},"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":"1606.09389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-30T08:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"0f5559c0c2d0406c344c49b6864e969f8bcb017ec0112c0135e926d9cd121457","abstract_canon_sha256":"ce660f168cace17afdbcbd48e5fc1dff4710239d629b517b6addc1b33f3aab67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:42.929770Z","signature_b64":"UGeTlTJyRgGAaynSSpdkJfXqJgX8L0f6y9rLDxkloAW2DRaciAecykCjSqu1hbbm6CSplMitFkgoY1uOsg9oDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36edfa9725647e8cc9b3181210a2a0f8ac43fdedc00c7a12ba9b888b69be51f7","last_reissued_at":"2026-05-18T00:47:42.929062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:42.929062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Results on Cyclic Interval Edge Colorings of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan","submitted_at":"2016-06-30T08:34:53Z","abstract_excerpt":"A proper edge coloring of a graph $G$ with colors $1,2,\\dots,t$ is called a \\emph{cyclic interval $t$-coloring} if for each vertex $v$ of $G$ the edges incident to $v$ are colored by consecutive colors, under the condition that color $1$ is considered as consecutive to color $t$. We prove that a bipartite graph $G$ with even maximum degree $\\Delta(G)\\geq 4$ admits a cyclic interval $\\Delta(G)$-coloring if for every vertex $v$ the degree $d_G(v)$ satisfies either $d_G(v)\\geq \\Delta(G)-2$ or $d_G(v)\\leq 2$. We also prove that every Eulerian bipartite graph $G$ with maximum degree at most $8$ has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09389","kind":"arxiv","version":2},"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":"1606.09389","created_at":"2026-05-18T00:47:42.929182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.09389v2","created_at":"2026-05-18T00:47:42.929182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09389","created_at":"2026-05-18T00:47:42.929182+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3W7VFZFMR7I","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3W7VFZFMR7IZSNT","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3W7VFZF","created_at":"2026-05-18T12:30:15.759754+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/G3W7VFZFMR7IZSNTDAJBBIVA7C","json":"https://pith.science/pith/G3W7VFZFMR7IZSNTDAJBBIVA7C.json","graph_json":"https://pith.science/api/pith-number/G3W7VFZFMR7IZSNTDAJBBIVA7C/graph.json","events_json":"https://pith.science/api/pith-number/G3W7VFZFMR7IZSNTDAJBBIVA7C/events.json","paper":"https://pith.science/paper/G3W7VFZF"},"agent_actions":{"view_html":"https://pith.science/pith/G3W7VFZFMR7IZSNTDAJBBIVA7C","download_json":"https://pith.science/pith/G3W7VFZFMR7IZSNTDAJBBIVA7C.json","view_paper":"https://pith.science/paper/G3W7VFZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.09389&json=true","fetch_graph":"https://pith.science/api/pith-number/G3W7VFZFMR7IZSNTDAJBBIVA7C/graph.json","fetch_events":"https://pith.science/api/pith-number/G3W7VFZFMR7IZSNTDAJBBIVA7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3W7VFZFMR7IZSNTDAJBBIVA7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3W7VFZFMR7IZSNTDAJBBIVA7C/action/storage_attestation","attest_author":"https://pith.science/pith/G3W7VFZFMR7IZSNTDAJBBIVA7C/action/author_attestation","sign_citation":"https://pith.science/pith/G3W7VFZFMR7IZSNTDAJBBIVA7C/action/citation_signature","submit_replication":"https://pith.science/pith/G3W7VFZFMR7IZSNTDAJBBIVA7C/action/replication_record"}},"created_at":"2026-05-18T00:47:42.929182+00:00","updated_at":"2026-05-18T00:47:42.929182+00:00"}