{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3ICGWCA4M5FR7UJZU55IMESNXI","short_pith_number":"pith:3ICGWCA4","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"},"canonical_sha256":"da046b081c674b1fd139a77a86124dba29699f1b0541167d5859a03fe1be8c6b","source":{"kind":"arxiv","id":"1611.07011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07011","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07011v1","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07011","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"3ICGWCA4M5FR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3ICGWCA4M5FR7UJZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3ICGWCA4","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3ICGWCA4M5FR7UJZU55IMESNXI","target":"record","payload":{"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"},"canonical_sha256":"da046b081c674b1fd139a77a86124dba29699f1b0541167d5859a03fe1be8c6b","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"},"source_kind":"arxiv","source_id":"1611.07011","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-18T00:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soZFM4Q9tksFN9k3Kgalo5rlm29zyQI1VDVCb4Vxy7wfI+cEeejA0QtVlclsdx6HTnNQffiznxxAYp2TquQwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:26:44.591147Z"},"content_sha256":"9268fe4e8e499a6c0d88caafd0825b77dba5dd5acfb9660fbab4c5f3d35cf444","schema_version":"1.0","event_id":"sha256:9268fe4e8e499a6c0d88caafd0825b77dba5dd5acfb9660fbab4c5f3d35cf444"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3ICGWCA4M5FR7UJZU55IMESNXI","target":"graph","payload":{"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"},"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-18T00:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jv58avY8xjiURybidmUlQnbD+HawTK+2sNdwpbIImLQUBXXOH+XrZLFTdzUgv+Tzs5LZlOtRCfvQVY2Ui4YmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:26:44.591779Z"},"content_sha256":"f863a9da6574fa1bc85002ad4d073e66dcd3faa4d4fe68d8845e1654b6f04887","schema_version":"1.0","event_id":"sha256:f863a9da6574fa1bc85002ad4d073e66dcd3faa4d4fe68d8845e1654b6f04887"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI/bundle.json","state_url":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ICGWCA4M5FR7UJZU55IMESNXI/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-06T15:26:44Z","links":{"resolver":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI","bundle":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI/bundle.json","state":"https://pith.science/pith/3ICGWCA4M5FR7UJZU55IMESNXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ICGWCA4M5FR7UJZU55IMESNXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3ICGWCA4M5FR7UJZU55IMESNXI","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":"2bcba5e2bde1ce56356d24d81f737f609090f5892a7c0b396ef52b6fec46d416","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T20:57:09Z","title_canon_sha256":"9ae509ca9418dadf174d64a766006658cea144be9dc89008c637f5011b23412f"},"schema_version":"1.0","source":{"id":"1611.07011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07011","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07011v1","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07011","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"3ICGWCA4M5FR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3ICGWCA4M5FR7UJZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3ICGWCA4","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:f863a9da6574fa1bc85002ad4d073e66dcd3faa4d4fe68d8845e1654b6f04887","target":"graph","created_at":"2026-05-18T00:57:32Z","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":"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","authors_text":"Carl Johan Casselgren, Hrant H. Khachatrian, Petros A. Petrosyan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T20:57:09Z","title":"Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07011","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:9268fe4e8e499a6c0d88caafd0825b77dba5dd5acfb9660fbab4c5f3d35cf444","target":"record","created_at":"2026-05-18T00:57:32Z","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":"2bcba5e2bde1ce56356d24d81f737f609090f5892a7c0b396ef52b6fec46d416","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T20:57:09Z","title_canon_sha256":"9ae509ca9418dadf174d64a766006658cea144be9dc89008c637f5011b23412f"},"schema_version":"1.0","source":{"id":"1611.07011","kind":"arxiv","version":1}},"canonical_sha256":"da046b081c674b1fd139a77a86124dba29699f1b0541167d5859a03fe1be8c6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da046b081c674b1fd139a77a86124dba29699f1b0541167d5859a03fe1be8c6b","first_computed_at":"2026-05-18T00:57:32.360667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:32.360667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2npa/QkNz73k4+/FYnWISJBqeXVD4BAN1duzeF3ZG/46vpS1+slXyzAymZxwyXSk/NepxP2g4AegjJluFbm2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:32.361088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9268fe4e8e499a6c0d88caafd0825b77dba5dd5acfb9660fbab4c5f3d35cf444","sha256:f863a9da6574fa1bc85002ad4d073e66dcd3faa4d4fe68d8845e1654b6f04887"],"state_sha256":"1592db2ba733f335075222c10aa7a7038d4bce177596a0353692d870c3ec7e17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMalApM75/Z2ZE/2oh7vrzL0iktPYWLNCZc1FN+89Dm/VQwjXnA+/5Lwcvd2tBVTACi+OogQcYvcVH4LzytWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:26:44.594992Z","bundle_sha256":"270364ed89c37d6d40ee0abd956a7f0e77daa8a9f9bce9d6e883a1efd4a7b01a"}}