{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7FHJRNVJC634B2YDNGFHTE6X4K","short_pith_number":"pith:7FHJRNVJ","canonical_record":{"source":{"id":"1904.07728","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T14:22:26Z","cross_cats_sorted":[],"title_canon_sha256":"6025abd4b08d1dd1ed8a0171b092573a6d17321060fd9f8129d081d50e300f45","abstract_canon_sha256":"fd6be491c7b80f6bfa27aeaac849fab805e5b746f7f43dbe581493da2aac3d50"},"schema_version":"1.0"},"canonical_sha256":"f94e98b6a917b7c0eb03698a7993d7e2aa346a51c840f5c6c66b39b47f961cc8","source":{"kind":"arxiv","id":"1904.07728","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07728","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07728v2","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07728","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"7FHJRNVJC634","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7FHJRNVJC634B2YD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7FHJRNVJ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7FHJRNVJC634B2YDNGFHTE6X4K","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07728","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T14:22:26Z","cross_cats_sorted":[],"title_canon_sha256":"6025abd4b08d1dd1ed8a0171b092573a6d17321060fd9f8129d081d50e300f45","abstract_canon_sha256":"fd6be491c7b80f6bfa27aeaac849fab805e5b746f7f43dbe581493da2aac3d50"},"schema_version":"1.0"},"canonical_sha256":"f94e98b6a917b7c0eb03698a7993d7e2aa346a51c840f5c6c66b39b47f961cc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:08.977750Z","signature_b64":"FWuT2FKN7pzMnkCgy+bWXTiX9zwvpwYs/8WrhV8pJYe0giatO3qd+hmYX9qOB1q5Rnn9luEC6luuVP0fti5CAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f94e98b6a917b7c0eb03698a7993d7e2aa346a51c840f5c6c66b39b47f961cc8","last_reissued_at":"2026-05-17T23:45:08.977091Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:08.977091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07728","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-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+d2gqCbau7sdlvDx1XN9kd3csW0ICL29t12iLAti4TrnpXhLgzhZCvxq8ym5YiDkALQ0YbQno5k94tAPV/+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:13:03.467403Z"},"content_sha256":"eb2fe934c739e72f7acbb7ad4538789349caa0b1cc5eac02be08b3166233fbe0","schema_version":"1.0","event_id":"sha256:eb2fe934c739e72f7acbb7ad4538789349caa0b1cc5eac02be08b3166233fbe0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7FHJRNVJC634B2YDNGFHTE6X4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On restricted colorings of $(d,s)$-edge colorable graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lan Anh Pham","submitted_at":"2019-04-15T14:22:26Z","abstract_excerpt":"A cycle is $2$-colored if its edges are properly colored by two distinct colors. A $(d,s)$-edge colorable graph $G$ is a $d$-regular graph that admits a proper $d$-edge coloring in which every edge of $G$ is in at least $s-1$ $2$-colored $4$-cycles. Given a $(d,s)$-edge colorable graph $G$ and a list assigment $L$ of forbidden colors for the edges of $G$ satisfying certain sparsity conditions, we prove that there is a proper $d$-edge coloring of $G$ that avoids $L$, that is, a proper edge coloring $\\varphi$ of $G$ such that $\\varphi(e) \\notin L(e)$ for every edge $e$ of $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07728","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-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RZ7zBx3ogRRWIomRJchUqrT71N6TrfIuoF0xVFAnBHKCw6iPHWgjQW64l3gktqj+jJcA7i/fh5VroIvegqzgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:13:03.467754Z"},"content_sha256":"39971b9fcf4115d11fa228e24e0071d2053181c090fe27707366cca1b4c0f57a","schema_version":"1.0","event_id":"sha256:39971b9fcf4115d11fa228e24e0071d2053181c090fe27707366cca1b4c0f57a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FHJRNVJC634B2YDNGFHTE6X4K/bundle.json","state_url":"https://pith.science/pith/7FHJRNVJC634B2YDNGFHTE6X4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FHJRNVJC634B2YDNGFHTE6X4K/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-12T09:13:03Z","links":{"resolver":"https://pith.science/pith/7FHJRNVJC634B2YDNGFHTE6X4K","bundle":"https://pith.science/pith/7FHJRNVJC634B2YDNGFHTE6X4K/bundle.json","state":"https://pith.science/pith/7FHJRNVJC634B2YDNGFHTE6X4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FHJRNVJC634B2YDNGFHTE6X4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7FHJRNVJC634B2YDNGFHTE6X4K","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":"fd6be491c7b80f6bfa27aeaac849fab805e5b746f7f43dbe581493da2aac3d50","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T14:22:26Z","title_canon_sha256":"6025abd4b08d1dd1ed8a0171b092573a6d17321060fd9f8129d081d50e300f45"},"schema_version":"1.0","source":{"id":"1904.07728","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07728","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07728v2","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07728","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"7FHJRNVJC634","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7FHJRNVJC634B2YD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7FHJRNVJ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:39971b9fcf4115d11fa228e24e0071d2053181c090fe27707366cca1b4c0f57a","target":"graph","created_at":"2026-05-17T23:45:08Z","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":"A cycle is $2$-colored if its edges are properly colored by two distinct colors. A $(d,s)$-edge colorable graph $G$ is a $d$-regular graph that admits a proper $d$-edge coloring in which every edge of $G$ is in at least $s-1$ $2$-colored $4$-cycles. Given a $(d,s)$-edge colorable graph $G$ and a list assigment $L$ of forbidden colors for the edges of $G$ satisfying certain sparsity conditions, we prove that there is a proper $d$-edge coloring of $G$ that avoids $L$, that is, a proper edge coloring $\\varphi$ of $G$ such that $\\varphi(e) \\notin L(e)$ for every edge $e$ of $G$.","authors_text":"Lan Anh Pham","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T14:22:26Z","title":"On restricted colorings of $(d,s)$-edge colorable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07728","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:eb2fe934c739e72f7acbb7ad4538789349caa0b1cc5eac02be08b3166233fbe0","target":"record","created_at":"2026-05-17T23:45:08Z","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":"fd6be491c7b80f6bfa27aeaac849fab805e5b746f7f43dbe581493da2aac3d50","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T14:22:26Z","title_canon_sha256":"6025abd4b08d1dd1ed8a0171b092573a6d17321060fd9f8129d081d50e300f45"},"schema_version":"1.0","source":{"id":"1904.07728","kind":"arxiv","version":2}},"canonical_sha256":"f94e98b6a917b7c0eb03698a7993d7e2aa346a51c840f5c6c66b39b47f961cc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f94e98b6a917b7c0eb03698a7993d7e2aa346a51c840f5c6c66b39b47f961cc8","first_computed_at":"2026-05-17T23:45:08.977091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:08.977091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FWuT2FKN7pzMnkCgy+bWXTiX9zwvpwYs/8WrhV8pJYe0giatO3qd+hmYX9qOB1q5Rnn9luEC6luuVP0fti5CAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:08.977750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07728","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb2fe934c739e72f7acbb7ad4538789349caa0b1cc5eac02be08b3166233fbe0","sha256:39971b9fcf4115d11fa228e24e0071d2053181c090fe27707366cca1b4c0f57a"],"state_sha256":"f4bfb668e04085417459a90ef994d4ed7d7e6180e693b9dd5af09fd98e9bb4b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4c0IGsJ8mYR76F85BEvmSslXi10YOQw2LeSlZFlTQ9PQdVASyHaQLvnwa3w4y2ssDjIOR0dgVEqkrUaLZfjfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:13:03.470019Z","bundle_sha256":"d698896b0372431d909909a70ec6d3eba4dddd8d816a007202b76f9fbf2f1cd3"}}