{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GLLXLNBM5UANXJ3MCXPASAS23B","short_pith_number":"pith:GLLXLNBM","canonical_record":{"source":{"id":"1601.02267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-10T21:25:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c118c789913cb1f931f94ab97bed8d073321a4c56c3a4cd66a870726631b719e","abstract_canon_sha256":"41711aa76047d96b66c488fbdeeed9949f17a44bf05b97893e635a00ebc0ab8d"},"schema_version":"1.0"},"canonical_sha256":"32d775b42ced00dba76c15de09025ad867cea3b543a045944d753d4a32beb17a","source":{"kind":"arxiv","id":"1601.02267","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02267","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02267v2","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02267","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"GLLXLNBM5UAN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GLLXLNBM5UANXJ3M","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GLLXLNBM","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GLLXLNBM5UANXJ3MCXPASAS23B","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-10T21:25:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c118c789913cb1f931f94ab97bed8d073321a4c56c3a4cd66a870726631b719e","abstract_canon_sha256":"41711aa76047d96b66c488fbdeeed9949f17a44bf05b97893e635a00ebc0ab8d"},"schema_version":"1.0"},"canonical_sha256":"32d775b42ced00dba76c15de09025ad867cea3b543a045944d753d4a32beb17a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:04.124705Z","signature_b64":"/BkLEbvHeO4/Cp4EayVkohP4fmI6OHnS6z6vEhCrhubFfsXgoCEkXuAg2dFzKAd5LiPZJBXPZF6QXdLVrF/XAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32d775b42ced00dba76c15de09025ad867cea3b543a045944d753d4a32beb17a","last_reissued_at":"2026-05-18T01:04:04.124142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:04.124142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02267","source_version":2,"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-18T01:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXSDtepnOFYml1BXyX5hSoHy2fU23WM22WhEFWd+4Qs4+TWHWxd2cXKhh5iWu+TDgG8EWpeX3BHv75fPmlReAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:56:15.449597Z"},"content_sha256":"5f512326540fb4555418211ef3c6ec4c7d0122ddd1d6e73bc5721ef5e524eff8","schema_version":"1.0","event_id":"sha256:5f512326540fb4555418211ef3c6ec4c7d0122ddd1d6e73bc5721ef5e524eff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GLLXLNBM5UANXJ3MCXPASAS23B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improper Twin Edge Coloring of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marc Demange, Paniz Abedin, Saieed Akbari, Tinaz Ekim","submitted_at":"2016-01-10T21:25:52Z","abstract_excerpt":"Let $G$ be a graph whose each component has order at least 3. Let $s : E(G) \\rightarrow \\mathbb{Z}_k$ for some integer $k\\geq 2$ be an improper edge coloring of $G$ (where adjacent edges may be assigned the same color). If the induced vertex coloring $c : V (G) \\rightarrow \\mathbb{Z}_k$ defined by $c(v) = \\sum_{e\\in E_v} s(e) \\mbox{ in } \\mathbb{Z}_k,$ (where the indicated sum is computed in $\\mathbb{Z}_k$ and $E_v$ denotes the set of all edges incident to $v$) results in a proper vertex coloring of $G$, then we refer to such a coloring as an improper twin $k$-edge coloring. The minimum $k$ fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02267","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"},"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-18T01:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mwuEbsl2kWX7yKwiuMcWYyZAxvS5ybHfnLeLLT706M1peQCk7eVSKj2dndDYCTAXkPzCSC6XQSezrnEe9PxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:56:15.450329Z"},"content_sha256":"f7be3be600e1f3c3a0e78d11b0ec497673df8cfe759cd268ad0a683fcc6d356a","schema_version":"1.0","event_id":"sha256:f7be3be600e1f3c3a0e78d11b0ec497673df8cfe759cd268ad0a683fcc6d356a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLLXLNBM5UANXJ3MCXPASAS23B/bundle.json","state_url":"https://pith.science/pith/GLLXLNBM5UANXJ3MCXPASAS23B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLLXLNBM5UANXJ3MCXPASAS23B/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-05-31T10:56:15Z","links":{"resolver":"https://pith.science/pith/GLLXLNBM5UANXJ3MCXPASAS23B","bundle":"https://pith.science/pith/GLLXLNBM5UANXJ3MCXPASAS23B/bundle.json","state":"https://pith.science/pith/GLLXLNBM5UANXJ3MCXPASAS23B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLLXLNBM5UANXJ3MCXPASAS23B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GLLXLNBM5UANXJ3MCXPASAS23B","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":"41711aa76047d96b66c488fbdeeed9949f17a44bf05b97893e635a00ebc0ab8d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-10T21:25:52Z","title_canon_sha256":"c118c789913cb1f931f94ab97bed8d073321a4c56c3a4cd66a870726631b719e"},"schema_version":"1.0","source":{"id":"1601.02267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02267","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02267v2","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02267","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"GLLXLNBM5UAN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GLLXLNBM5UANXJ3M","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GLLXLNBM","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:f7be3be600e1f3c3a0e78d11b0ec497673df8cfe759cd268ad0a683fcc6d356a","target":"graph","created_at":"2026-05-18T01:04:04Z","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 whose each component has order at least 3. Let $s : E(G) \\rightarrow \\mathbb{Z}_k$ for some integer $k\\geq 2$ be an improper edge coloring of $G$ (where adjacent edges may be assigned the same color). If the induced vertex coloring $c : V (G) \\rightarrow \\mathbb{Z}_k$ defined by $c(v) = \\sum_{e\\in E_v} s(e) \\mbox{ in } \\mathbb{Z}_k,$ (where the indicated sum is computed in $\\mathbb{Z}_k$ and $E_v$ denotes the set of all edges incident to $v$) results in a proper vertex coloring of $G$, then we refer to such a coloring as an improper twin $k$-edge coloring. The minimum $k$ fo","authors_text":"Marc Demange, Paniz Abedin, Saieed Akbari, Tinaz Ekim","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-10T21:25:52Z","title":"Improper Twin Edge Coloring of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02267","kind":"arxiv","version":2},"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:5f512326540fb4555418211ef3c6ec4c7d0122ddd1d6e73bc5721ef5e524eff8","target":"record","created_at":"2026-05-18T01:04:04Z","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":"41711aa76047d96b66c488fbdeeed9949f17a44bf05b97893e635a00ebc0ab8d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-10T21:25:52Z","title_canon_sha256":"c118c789913cb1f931f94ab97bed8d073321a4c56c3a4cd66a870726631b719e"},"schema_version":"1.0","source":{"id":"1601.02267","kind":"arxiv","version":2}},"canonical_sha256":"32d775b42ced00dba76c15de09025ad867cea3b543a045944d753d4a32beb17a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32d775b42ced00dba76c15de09025ad867cea3b543a045944d753d4a32beb17a","first_computed_at":"2026-05-18T01:04:04.124142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:04.124142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/BkLEbvHeO4/Cp4EayVkohP4fmI6OHnS6z6vEhCrhubFfsXgoCEkXuAg2dFzKAd5LiPZJBXPZF6QXdLVrF/XAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:04.124705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f512326540fb4555418211ef3c6ec4c7d0122ddd1d6e73bc5721ef5e524eff8","sha256:f7be3be600e1f3c3a0e78d11b0ec497673df8cfe759cd268ad0a683fcc6d356a"],"state_sha256":"fc47e94d92b2703ac3b03253215554e38add4da9b0c09c868f229f42671ddc71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"muCqaWjlw+fetprrepir3QFn8xQWiBC4NhasGtgKW4Fczd/FilFrz8ivRM+/axYeTMhVgtnh14QZoRed7Y5nAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:56:15.454121Z","bundle_sha256":"78b25639cb1282225d53c775553fcea1eb695538c4ef661669cbaeacd0486ba2"}}