{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A2GLU77OHYYWUQTCG5AO5KMFIG","short_pith_number":"pith:A2GLU77O","schema_version":"1.0","canonical_sha256":"068cba7fee3e316a42623740eea98541a0831da2f46b99862f908088d7beb909","source":{"kind":"arxiv","id":"1802.05953","version":1},"attestation_state":"computed","paper":{"title":"Weak Dynamic Coloring of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caroline Accurso, Leaha Hand, Paul Wenger, Sogol Jahanbekam, Vitaliy Chernyshov","submitted_at":"2018-02-16T14:39:53Z","abstract_excerpt":"The \\textit{$k$-weak-dynamic number} of a graph $G$ is the smallest number of colors we need to color the vertices of $G$ in such a way that each vertex $v$ of degree $d(v)$ sees at least $\\rm{min}\\{k,d(v)\\}$ colors on its neighborhood. We use reducible configurations and list coloring of graphs to prove that all planar graphs have 3-weak-dynamic number at most 6."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.05953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-16T14:39:53Z","cross_cats_sorted":[],"title_canon_sha256":"497c3ad926e91d8d8151cfa8c103889842cd2932c7178a858744f871c2f43428","abstract_canon_sha256":"8f980c0d903bd71a77c4ed7c6b86d05f6c3b020fd6cc50687f55e4b37a466313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:10.352063Z","signature_b64":"vZVxi4vWyc+xcxuUt6Z/jmmoXuthYOCGakfZWVKZmLogcvns/d8tYWhbMkFpVHJ9qRdzrWQUBjinUsskuwcQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"068cba7fee3e316a42623740eea98541a0831da2f46b99862f908088d7beb909","last_reissued_at":"2026-05-18T00:23:10.351330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:10.351330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak Dynamic Coloring of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caroline Accurso, Leaha Hand, Paul Wenger, Sogol Jahanbekam, Vitaliy Chernyshov","submitted_at":"2018-02-16T14:39:53Z","abstract_excerpt":"The \\textit{$k$-weak-dynamic number} of a graph $G$ is the smallest number of colors we need to color the vertices of $G$ in such a way that each vertex $v$ of degree $d(v)$ sees at least $\\rm{min}\\{k,d(v)\\}$ colors on its neighborhood. We use reducible configurations and list coloring of graphs to prove that all planar graphs have 3-weak-dynamic number at most 6."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05953","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.05953","created_at":"2026-05-18T00:23:10.351445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05953v1","created_at":"2026-05-18T00:23:10.351445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05953","created_at":"2026-05-18T00:23:10.351445+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2GLU77OHYYW","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2GLU77OHYYWUQTC","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2GLU77O","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A2GLU77OHYYWUQTCG5AO5KMFIG","json":"https://pith.science/pith/A2GLU77OHYYWUQTCG5AO5KMFIG.json","graph_json":"https://pith.science/api/pith-number/A2GLU77OHYYWUQTCG5AO5KMFIG/graph.json","events_json":"https://pith.science/api/pith-number/A2GLU77OHYYWUQTCG5AO5KMFIG/events.json","paper":"https://pith.science/paper/A2GLU77O"},"agent_actions":{"view_html":"https://pith.science/pith/A2GLU77OHYYWUQTCG5AO5KMFIG","download_json":"https://pith.science/pith/A2GLU77OHYYWUQTCG5AO5KMFIG.json","view_paper":"https://pith.science/paper/A2GLU77O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05953&json=true","fetch_graph":"https://pith.science/api/pith-number/A2GLU77OHYYWUQTCG5AO5KMFIG/graph.json","fetch_events":"https://pith.science/api/pith-number/A2GLU77OHYYWUQTCG5AO5KMFIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2GLU77OHYYWUQTCG5AO5KMFIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2GLU77OHYYWUQTCG5AO5KMFIG/action/storage_attestation","attest_author":"https://pith.science/pith/A2GLU77OHYYWUQTCG5AO5KMFIG/action/author_attestation","sign_citation":"https://pith.science/pith/A2GLU77OHYYWUQTCG5AO5KMFIG/action/citation_signature","submit_replication":"https://pith.science/pith/A2GLU77OHYYWUQTCG5AO5KMFIG/action/replication_record"}},"created_at":"2026-05-18T00:23:10.351445+00:00","updated_at":"2026-05-18T00:23:10.351445+00:00"}