{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6EUL5A4WLHXGAEFU2V2AZL5AE6","short_pith_number":"pith:6EUL5A4W","schema_version":"1.0","canonical_sha256":"f128be839659ee6010b4d5740cafa027ada6ea2fbc652c609e6760fb99fea41e","source":{"kind":"arxiv","id":"2012.03230","version":2},"attestation_state":"computed","paper":{"title":"Graph Polynomials and Group Coloring of Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bart{\\l}omiej Bosek, Grzegorz Gutowski, Jaros{\\l}aw Grytczuk, Mariusz Zaj\\k{a}c, Oriol Serra","submitted_at":"2020-12-06T10:46:44Z","abstract_excerpt":"Let $\\Gamma$ be an Abelian group and let $G$ be a simple graph. We say that $G$ is $\\Gamma$-colorable if for some fixed orientation of $G$ and every edge labeling $\\ell:E(G)\\rightarrow \\Gamma$, there exists a vertex coloring $c$ by the elements of $\\Gamma$ such that $c(y)-c(x)\\neq \\ell(e)$, for every edge $e=xy$ (oriented from $x$ to $y$).\n  Langhede and Thomassen proved recently that every planar graph on $n$ vertices has at least $2^{n/9}$ different $\\mathbb{Z}_5$-colorings. By using a different approach based on graph polynomials, we extend this result to $K_5$-minor-free graphs in the more"},"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":"2012.03230","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2020-12-06T10:46:44Z","cross_cats_sorted":[],"title_canon_sha256":"2ffc246b622ecf64050f6d16ead3fd1550fd56f62da96169476c5473af764bd9","abstract_canon_sha256":"e39e47f34df1a6fda0104d558d1ff0751e033cd3eca4c93791d7d85019fe545f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:39.945034Z","signature_b64":"cqmrJvIJLN64pLvG3QjX/G5TVdoWzCXs5kdaKoff8DYA+f8H3Z0wCuFifKq1M4ywMJuDb3Z7+kkbtCLH1npGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f128be839659ee6010b4d5740cafa027ada6ea2fbc652c609e6760fb99fea41e","last_reissued_at":"2026-07-05T07:19:39.944603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:39.944603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Polynomials and Group Coloring of Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bart{\\l}omiej Bosek, Grzegorz Gutowski, Jaros{\\l}aw Grytczuk, Mariusz Zaj\\k{a}c, Oriol Serra","submitted_at":"2020-12-06T10:46:44Z","abstract_excerpt":"Let $\\Gamma$ be an Abelian group and let $G$ be a simple graph. We say that $G$ is $\\Gamma$-colorable if for some fixed orientation of $G$ and every edge labeling $\\ell:E(G)\\rightarrow \\Gamma$, there exists a vertex coloring $c$ by the elements of $\\Gamma$ such that $c(y)-c(x)\\neq \\ell(e)$, for every edge $e=xy$ (oriented from $x$ to $y$).\n  Langhede and Thomassen proved recently that every planar graph on $n$ vertices has at least $2^{n/9}$ different $\\mathbb{Z}_5$-colorings. By using a different approach based on graph polynomials, we extend this result to $K_5$-minor-free graphs in the more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.03230","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.03230/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2012.03230","created_at":"2026-07-05T07:19:39.944668+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.03230v2","created_at":"2026-07-05T07:19:39.944668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.03230","created_at":"2026-07-05T07:19:39.944668+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EUL5A4WLHXG","created_at":"2026-07-05T07:19:39.944668+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EUL5A4WLHXGAEFU","created_at":"2026-07-05T07:19:39.944668+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EUL5A4W","created_at":"2026-07-05T07:19:39.944668+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/6EUL5A4WLHXGAEFU2V2AZL5AE6","json":"https://pith.science/pith/6EUL5A4WLHXGAEFU2V2AZL5AE6.json","graph_json":"https://pith.science/api/pith-number/6EUL5A4WLHXGAEFU2V2AZL5AE6/graph.json","events_json":"https://pith.science/api/pith-number/6EUL5A4WLHXGAEFU2V2AZL5AE6/events.json","paper":"https://pith.science/paper/6EUL5A4W"},"agent_actions":{"view_html":"https://pith.science/pith/6EUL5A4WLHXGAEFU2V2AZL5AE6","download_json":"https://pith.science/pith/6EUL5A4WLHXGAEFU2V2AZL5AE6.json","view_paper":"https://pith.science/paper/6EUL5A4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.03230&json=true","fetch_graph":"https://pith.science/api/pith-number/6EUL5A4WLHXGAEFU2V2AZL5AE6/graph.json","fetch_events":"https://pith.science/api/pith-number/6EUL5A4WLHXGAEFU2V2AZL5AE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EUL5A4WLHXGAEFU2V2AZL5AE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EUL5A4WLHXGAEFU2V2AZL5AE6/action/storage_attestation","attest_author":"https://pith.science/pith/6EUL5A4WLHXGAEFU2V2AZL5AE6/action/author_attestation","sign_citation":"https://pith.science/pith/6EUL5A4WLHXGAEFU2V2AZL5AE6/action/citation_signature","submit_replication":"https://pith.science/pith/6EUL5A4WLHXGAEFU2V2AZL5AE6/action/replication_record"}},"created_at":"2026-07-05T07:19:39.944668+00:00","updated_at":"2026-07-05T07:19:39.944668+00:00"}