{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3ICGWCA4M5FR7UJZU55IMESNXI","short_pith_number":"pith:3ICGWCA4","schema_version":"1.0","canonical_sha256":"da046b081c674b1fd139a77a86124dba29699f1b0541167d5859a03fe1be8c6b","source":{"kind":"arxiv","id":"1611.07011","version":1},"attestation_state":"computed","paper":{"title":"Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Johan Casselgren, Hrant H. Khachatrian, Petros A. Petrosyan","submitted_at":"2016-11-21T20:57:09Z","abstract_excerpt":"An \\emph{interval $t$-coloring} of a multigraph $G$ is a proper edge coloring with colors $1,\\dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors. A \\emph{cyclic interval $t$-coloring} of a multigraph $G$ is a proper edge coloring with colors $1,\\dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors, under the condition that color $1$ is considered as consecutive to color $t$. Denote by $w(G)$ ($w_{c}(G)$) and $W(G)$ ($W_{c}(G)$) the minimum and maximum number of colors in a (cyclic) i"},"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":"1611.07011","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T20:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"9ae509ca9418dadf174d64a766006658cea144be9dc89008c637f5011b23412f","abstract_canon_sha256":"2bcba5e2bde1ce56356d24d81f737f609090f5892a7c0b396ef52b6fec46d416"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:32.361088Z","signature_b64":"2npa/QkNz73k4+/FYnWISJBqeXVD4BAN1duzeF3ZG/46vpS1+slXyzAymZxwyXSk/NepxP2g4AegjJluFbm2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da046b081c674b1fd139a77a86124dba29699f1b0541167d5859a03fe1be8c6b","last_reissued_at":"2026-05-18T00:57:32.360667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:32.360667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Johan Casselgren, Hrant H. Khachatrian, Petros A. Petrosyan","submitted_at":"2016-11-21T20:57:09Z","abstract_excerpt":"An \\emph{interval $t$-coloring} of a multigraph $G$ is a proper edge coloring with colors $1,\\dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors. A \\emph{cyclic interval $t$-coloring} of a multigraph $G$ is a proper edge coloring with colors $1,\\dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors, under the condition that color $1$ is considered as consecutive to color $t$. Denote by $w(G)$ ($w_{c}(G)$) and $W(G)$ ($W_{c}(G)$) the minimum and maximum number of colors in a (cyclic) i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07011","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":"1611.07011","created_at":"2026-05-18T00:57:32.360739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07011v1","created_at":"2026-05-18T00:57:32.360739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07011","created_at":"2026-05-18T00:57:32.360739+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ICGWCA4M5FR","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ICGWCA4M5FR7UJZ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ICGWCA4","created_at":"2026-05-18T12:29:55.572404+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/3ICGWCA4M5FR7UJZU55IMESNXI","json":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI.json","graph_json":"https://pith.science/api/pith-number/3ICGWCA4M5FR7UJZU55IMESNXI/graph.json","events_json":"https://pith.science/api/pith-number/3ICGWCA4M5FR7UJZU55IMESNXI/events.json","paper":"https://pith.science/paper/3ICGWCA4"},"agent_actions":{"view_html":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI","download_json":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI.json","view_paper":"https://pith.science/paper/3ICGWCA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07011&json=true","fetch_graph":"https://pith.science/api/pith-number/3ICGWCA4M5FR7UJZU55IMESNXI/graph.json","fetch_events":"https://pith.science/api/pith-number/3ICGWCA4M5FR7UJZU55IMESNXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI/action/storage_attestation","attest_author":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI/action/author_attestation","sign_citation":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI/action/citation_signature","submit_replication":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI/action/replication_record"}},"created_at":"2026-05-18T00:57:32.360739+00:00","updated_at":"2026-05-18T00:57:32.360739+00:00"}