{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:X3VCZGQH36Z5RRQDWKAM42PF7D","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":"01fbed318e3eddded4d42dd4e5d6944d0b22d8b13287ab014c2aa7ede0b88fea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-28T02:08:56Z","title_canon_sha256":"ecf7725d585345a3aed75a6b3ba334eb1af4cdb493eadcc607bcad1d9f8e0647"},"schema_version":"1.0","source":{"id":"1506.08345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08345","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08345v1","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08345","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"X3VCZGQH36Z5","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"X3VCZGQH36Z5RRQD","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"X3VCZGQH","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:d506175b2caaec50646ca9a104b0604f8ea778303d042aed070108794d4af4f9","target":"graph","created_at":"2026-05-18T00:34:45Z","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 $c:E(G)\\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\\bar{c}(v)=(a_1,\\ldots,a_k)$, where $a_i$ is the number of edges incident to $v$ with color $i$. Reorder $\\bar{c}(v)$ for every $v$ in $G$ in nonincreasing order to obtain $c^*(v)$, the color-blind partition of $v$. When $c^*$ induces a proper vertex coloring, that is, $c^*(u)\\neq c^*(v)$ for every edge $uv$ in $G$, we say that $c$ is color-blind distinguishing. The minimum $k$ for which there exists a color-blind distinguishing edge coloring $c:E(G)\\to [k]$ is the color-blind index of $G$","authors_text":"Charlie Suer, Derrick Stolee, Devon Sigler, Jennifer Diemunsch, Lauren M. Nelsen, Lucas Kramer, Luke L. Nelsen, Nathan Graber, Victor Larsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-28T02:08:56Z","title":"Color-blind index in graphs of very low degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08345","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:059e66b13370072f3da67024cf0799cc62b5d14f7189860e968b4e42dbcfdefe","target":"record","created_at":"2026-05-18T00:34:45Z","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":"01fbed318e3eddded4d42dd4e5d6944d0b22d8b13287ab014c2aa7ede0b88fea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-28T02:08:56Z","title_canon_sha256":"ecf7725d585345a3aed75a6b3ba334eb1af4cdb493eadcc607bcad1d9f8e0647"},"schema_version":"1.0","source":{"id":"1506.08345","kind":"arxiv","version":1}},"canonical_sha256":"beea2c9a07dfb3d8c603b280ce69e5f8ce4a23edcf4985afcfb19d0b4ac10a15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"beea2c9a07dfb3d8c603b280ce69e5f8ce4a23edcf4985afcfb19d0b4ac10a15","first_computed_at":"2026-05-18T00:34:45.082526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:45.082526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r8u3qPTIkQLI/z/TyrtUFqHcD2O4niVhD1reQOJBQb1DH/enR14kGUdjtngTOvnol66rDT1iWnZ946lHkbGnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:45.083204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:059e66b13370072f3da67024cf0799cc62b5d14f7189860e968b4e42dbcfdefe","sha256:d506175b2caaec50646ca9a104b0604f8ea778303d042aed070108794d4af4f9"],"state_sha256":"d4759295f36e00a7e8a17980fc399c94c5f29a0e443ccb983a1c6864117124ec"}