{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:L7LZZW66KNKOI5U63PC6D45QHB","short_pith_number":"pith:L7LZZW66","canonical_record":{"source":{"id":"1110.1161","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2011-10-06T07:08:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d64cdbe705d4c0bed4173e556da814fbedc578863726adda7daeb16cc1ddc340","abstract_canon_sha256":"22a2c98ae3386c18019e428c10d4d6d54f4d077dfb15acd9af1d7103bf810ef0"},"schema_version":"1.0"},"canonical_sha256":"5fd79cdbde5354e4769edbc5e1f3b0386940ee3029fe3cc31b559c248e27282b","source":{"kind":"arxiv","id":"1110.1161","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1161","created_at":"2026-05-18T04:11:39Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1161v1","created_at":"2026-05-18T04:11:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1161","created_at":"2026-05-18T04:11:39Z"},{"alias_kind":"pith_short_12","alias_value":"L7LZZW66KNKO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L7LZZW66KNKOI5U6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L7LZZW66","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:L7LZZW66KNKOI5U63PC6D45QHB","target":"record","payload":{"canonical_record":{"source":{"id":"1110.1161","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2011-10-06T07:08:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d64cdbe705d4c0bed4173e556da814fbedc578863726adda7daeb16cc1ddc340","abstract_canon_sha256":"22a2c98ae3386c18019e428c10d4d6d54f4d077dfb15acd9af1d7103bf810ef0"},"schema_version":"1.0"},"canonical_sha256":"5fd79cdbde5354e4769edbc5e1f3b0386940ee3029fe3cc31b559c248e27282b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:39.130894Z","signature_b64":"aNccOwcOCotPux9StR+cj0gjbuK2anhgp58D2+xw6FiPE8TQexLhZEoBNlkjURLrNhxWrtFLqp1jONzmSYM3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fd79cdbde5354e4769edbc5e1f3b0386940ee3029fe3cc31b559c248e27282b","last_reissued_at":"2026-05-18T04:11:39.130487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:39.130487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.1161","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-18T04:11:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YACNv2A80P2Bx+7z+zX3dKxav46A+Stie1vLXv94kqs1QyktA4wEE1oYfbz4EPyr75KETcMydx2mGY2Vf+1jAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:44:41.446381Z"},"content_sha256":"701450413127a26be7831d0e91b09896462af427865fe9b5990764eafe1d4dfd","schema_version":"1.0","event_id":"sha256:701450413127a26be7831d0e91b09896462af427865fe9b5990764eafe1d4dfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:L7LZZW66KNKOI5U63PC6D45QHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interval edge-colorings of cubic graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Petros A. Petrosyan","submitted_at":"2011-10-06T07:08:00Z","abstract_excerpt":"An edge-coloring of a multigraph G with colors 1,2,...,t is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this paper we prove that if G is a connected cubic multigraph (a connected cubic graph) that admits an interval t-coloring, then t\\leq |V(G)| +1 (t\\leq |V(G)|), where V(G) is the set of vertices of G. Moreover, if G is a connected cubic graph, G\\neq K_{4}, and G has an interval t-coloring, then t\\leq |V(G)| -1. We also show that these upper bounds are sharp. Finally, we prove that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1161","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-18T04:11:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyZGJcviwjp6ne3tGYSdmD6IJQl4a4QV0E/9+EWsDQSnSn+euz3NLizs/cnNMSYp1OtrdmU+Wy3VKPkR4Qr5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:44:41.446742Z"},"content_sha256":"ef52738fdc4da661268331ca3f9e6ba0ac2111f647e60edcfdcf9cff7596dc5d","schema_version":"1.0","event_id":"sha256:ef52738fdc4da661268331ca3f9e6ba0ac2111f647e60edcfdcf9cff7596dc5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7LZZW66KNKOI5U63PC6D45QHB/bundle.json","state_url":"https://pith.science/pith/L7LZZW66KNKOI5U63PC6D45QHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7LZZW66KNKOI5U63PC6D45QHB/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-26T10:44:41Z","links":{"resolver":"https://pith.science/pith/L7LZZW66KNKOI5U63PC6D45QHB","bundle":"https://pith.science/pith/L7LZZW66KNKOI5U63PC6D45QHB/bundle.json","state":"https://pith.science/pith/L7LZZW66KNKOI5U63PC6D45QHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7LZZW66KNKOI5U63PC6D45QHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:L7LZZW66KNKOI5U63PC6D45QHB","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":"22a2c98ae3386c18019e428c10d4d6d54f4d077dfb15acd9af1d7103bf810ef0","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2011-10-06T07:08:00Z","title_canon_sha256":"d64cdbe705d4c0bed4173e556da814fbedc578863726adda7daeb16cc1ddc340"},"schema_version":"1.0","source":{"id":"1110.1161","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1161","created_at":"2026-05-18T04:11:39Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1161v1","created_at":"2026-05-18T04:11:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1161","created_at":"2026-05-18T04:11:39Z"},{"alias_kind":"pith_short_12","alias_value":"L7LZZW66KNKO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L7LZZW66KNKOI5U6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L7LZZW66","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:ef52738fdc4da661268331ca3f9e6ba0ac2111f647e60edcfdcf9cff7596dc5d","target":"graph","created_at":"2026-05-18T04:11:39Z","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 edge-coloring of a multigraph G with colors 1,2,...,t is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this paper we prove that if G is a connected cubic multigraph (a connected cubic graph) that admits an interval t-coloring, then t\\leq |V(G)| +1 (t\\leq |V(G)|), where V(G) is the set of vertices of G. Moreover, if G is a connected cubic graph, G\\neq K_{4}, and G has an interval t-coloring, then t\\leq |V(G)| -1. We also show that these upper bounds are sharp. Finally, we prove that ","authors_text":"Petros A. Petrosyan","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2011-10-06T07:08:00Z","title":"Interval edge-colorings of cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1161","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:701450413127a26be7831d0e91b09896462af427865fe9b5990764eafe1d4dfd","target":"record","created_at":"2026-05-18T04:11:39Z","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":"22a2c98ae3386c18019e428c10d4d6d54f4d077dfb15acd9af1d7103bf810ef0","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2011-10-06T07:08:00Z","title_canon_sha256":"d64cdbe705d4c0bed4173e556da814fbedc578863726adda7daeb16cc1ddc340"},"schema_version":"1.0","source":{"id":"1110.1161","kind":"arxiv","version":1}},"canonical_sha256":"5fd79cdbde5354e4769edbc5e1f3b0386940ee3029fe3cc31b559c248e27282b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fd79cdbde5354e4769edbc5e1f3b0386940ee3029fe3cc31b559c248e27282b","first_computed_at":"2026-05-18T04:11:39.130487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:39.130487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aNccOwcOCotPux9StR+cj0gjbuK2anhgp58D2+xw6FiPE8TQexLhZEoBNlkjURLrNhxWrtFLqp1jONzmSYM3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:39.130894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1161","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:701450413127a26be7831d0e91b09896462af427865fe9b5990764eafe1d4dfd","sha256:ef52738fdc4da661268331ca3f9e6ba0ac2111f647e60edcfdcf9cff7596dc5d"],"state_sha256":"4d341d6713f49d76b272cbe262eb838a6239534709ef9b57225716f4a7278b26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Pcfj721k0w+5xQgzWirQmsp/L/onfdmtbQW7mFLO6gL5tI8V1ciqSShUwX1a+cYiFP1C8lGBZcW0Bpl40zJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:44:41.448757Z","bundle_sha256":"297b05da75a27e23a38a1da153b227f15b34a0552ff007786856588760c4b515"}}