{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:H63X3KOVJCYNQEYRZIWGWSD3QA","short_pith_number":"pith:H63X3KOV","canonical_record":{"source":{"id":"1401.0836","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-04T18:48:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d29451fc258b4f0a91d7c7ac45058769affb0cf8f0bbd5531daf64703c15f26d","abstract_canon_sha256":"299917d0e4fc9cecd1bb4b69c333afc1724c4e70024c933549ba634c70f46304"},"schema_version":"1.0"},"canonical_sha256":"3fb77da9d548b0d81311ca2c6b487b802659886f88389338bf0e2c6ef1a55844","source":{"kind":"arxiv","id":"1401.0836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0836","created_at":"2026-05-18T03:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0836v1","created_at":"2026-05-18T03:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0836","created_at":"2026-05-18T03:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"H63X3KOVJCYN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H63X3KOVJCYNQEYR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H63X3KOV","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:H63X3KOVJCYNQEYRZIWGWSD3QA","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0836","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-04T18:48:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d29451fc258b4f0a91d7c7ac45058769affb0cf8f0bbd5531daf64703c15f26d","abstract_canon_sha256":"299917d0e4fc9cecd1bb4b69c333afc1724c4e70024c933549ba634c70f46304"},"schema_version":"1.0"},"canonical_sha256":"3fb77da9d548b0d81311ca2c6b487b802659886f88389338bf0e2c6ef1a55844","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:11.828251Z","signature_b64":"JRP1pW6j6npU9s+S8tBpstxAWQWwmqnRhke40sORZ2BCwFAOPkEZOMotss2ebJ5pGeqQ19bAx9jNqVXiLcbXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb77da9d548b0d81311ca2c6b487b802659886f88389338bf0e2c6ef1a55844","last_reissued_at":"2026-05-18T03:03:11.827401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:11.827401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0836","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-18T03:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"la6uilvHAoA8tkE3zNQBKTPtjZRytRjaCYBlO/rlALm/4eTSCOekMYLd9SXeb3YxB60ZuqFNThQ5cuJQUToJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:04:38.444896Z"},"content_sha256":"393ab9c7ada312526699d6e1bb5beee5531d091c0ae40013c57ce5f1142ca145","schema_version":"1.0","event_id":"sha256:393ab9c7ada312526699d6e1bb5beee5531d091c0ae40013c57ce5f1142ca145"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:H63X3KOVJCYNQEYRZIWGWSD3QA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential edge-coloring on the subset of vertices of almost regular graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Petros A. Petrosyan","submitted_at":"2014-01-04T18:48:01Z","abstract_excerpt":"Let $G$ be a graph and $R\\subseteq V(G)$. A proper edge-coloring of a graph $G$ with colors $1,\\ldots,t$ is called an $R$-sequential $t$-coloring if the edges incident to each vertex $v\\in R$ are colored by the colors $1,\\ldots,d_{G}(v)$, where $d_{G}(v)$ is the degree of the vertex $v$ in $G$. In this note, we show that if $G$ is a graph with $\\Delta(G)-\\delta(G)\\leq 1$ and $\\chi^{\\prime}(G)=\\Delta(G)=r$ ($r\\geq 3$), then $G$ has an $R$-sequential $r$-coloring with $\\vert R\\vert \\geq \\left\\lceil\\frac{(r-1)n_{r}+n}{r}\\right\\rceil$, where $n=\\vert V(G)\\vert$ and $n_{r}=\\vert\\{v\\in V(G):d_{G}(v)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0836","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-18T03:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLOe/poJN+qfBYis/GvfMoiVtYQ395W9LxhDeJ7+L6pMlLtr8xaXbojN2rAs+1wuOVLCfnk7GHR9abKHnwhTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:04:38.445238Z"},"content_sha256":"4cd67790807e0878d23e290472e92fb580ed847019be8ebe4b58595536686f7a","schema_version":"1.0","event_id":"sha256:4cd67790807e0878d23e290472e92fb580ed847019be8ebe4b58595536686f7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H63X3KOVJCYNQEYRZIWGWSD3QA/bundle.json","state_url":"https://pith.science/pith/H63X3KOVJCYNQEYRZIWGWSD3QA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H63X3KOVJCYNQEYRZIWGWSD3QA/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-26T13:04:38Z","links":{"resolver":"https://pith.science/pith/H63X3KOVJCYNQEYRZIWGWSD3QA","bundle":"https://pith.science/pith/H63X3KOVJCYNQEYRZIWGWSD3QA/bundle.json","state":"https://pith.science/pith/H63X3KOVJCYNQEYRZIWGWSD3QA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H63X3KOVJCYNQEYRZIWGWSD3QA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H63X3KOVJCYNQEYRZIWGWSD3QA","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":"299917d0e4fc9cecd1bb4b69c333afc1724c4e70024c933549ba634c70f46304","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-04T18:48:01Z","title_canon_sha256":"d29451fc258b4f0a91d7c7ac45058769affb0cf8f0bbd5531daf64703c15f26d"},"schema_version":"1.0","source":{"id":"1401.0836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0836","created_at":"2026-05-18T03:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0836v1","created_at":"2026-05-18T03:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0836","created_at":"2026-05-18T03:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"H63X3KOVJCYN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H63X3KOVJCYNQEYR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H63X3KOV","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:4cd67790807e0878d23e290472e92fb580ed847019be8ebe4b58595536686f7a","target":"graph","created_at":"2026-05-18T03:03:11Z","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":"Let $G$ be a graph and $R\\subseteq V(G)$. A proper edge-coloring of a graph $G$ with colors $1,\\ldots,t$ is called an $R$-sequential $t$-coloring if the edges incident to each vertex $v\\in R$ are colored by the colors $1,\\ldots,d_{G}(v)$, where $d_{G}(v)$ is the degree of the vertex $v$ in $G$. In this note, we show that if $G$ is a graph with $\\Delta(G)-\\delta(G)\\leq 1$ and $\\chi^{\\prime}(G)=\\Delta(G)=r$ ($r\\geq 3$), then $G$ has an $R$-sequential $r$-coloring with $\\vert R\\vert \\geq \\left\\lceil\\frac{(r-1)n_{r}+n}{r}\\right\\rceil$, where $n=\\vert V(G)\\vert$ and $n_{r}=\\vert\\{v\\in V(G):d_{G}(v)","authors_text":"Petros A. Petrosyan","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-04T18:48:01Z","title":"Sequential edge-coloring on the subset of vertices of almost regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0836","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:393ab9c7ada312526699d6e1bb5beee5531d091c0ae40013c57ce5f1142ca145","target":"record","created_at":"2026-05-18T03:03:11Z","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":"299917d0e4fc9cecd1bb4b69c333afc1724c4e70024c933549ba634c70f46304","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-04T18:48:01Z","title_canon_sha256":"d29451fc258b4f0a91d7c7ac45058769affb0cf8f0bbd5531daf64703c15f26d"},"schema_version":"1.0","source":{"id":"1401.0836","kind":"arxiv","version":1}},"canonical_sha256":"3fb77da9d548b0d81311ca2c6b487b802659886f88389338bf0e2c6ef1a55844","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fb77da9d548b0d81311ca2c6b487b802659886f88389338bf0e2c6ef1a55844","first_computed_at":"2026-05-18T03:03:11.827401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:11.827401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JRP1pW6j6npU9s+S8tBpstxAWQWwmqnRhke40sORZ2BCwFAOPkEZOMotss2ebJ5pGeqQ19bAx9jNqVXiLcbXAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:11.828251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:393ab9c7ada312526699d6e1bb5beee5531d091c0ae40013c57ce5f1142ca145","sha256:4cd67790807e0878d23e290472e92fb580ed847019be8ebe4b58595536686f7a"],"state_sha256":"0dd383a1a19e979b67bb7ad0f48dbc42cd54b8b017a1b3133c0531aad6599569"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0F/SvBbjUiyiBiHHm2lPvHVlY+WU/TRu4HOSZWHp/pn8IqkBEILfb486lzZ3nwxxQOi6bfnpMfeYfAzo3nCIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:04:38.447195Z","bundle_sha256":"6d3b0c505543ec7a90511e925c6e68b7fcc55f90b07fe665e29d8ee1fcbfb6f1"}}