{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P7QDZU3HOH3N7WTIXAYGIN7JP7","short_pith_number":"pith:P7QDZU3H","schema_version":"1.0","canonical_sha256":"7fe03cd36771f6dfda68b8306437e97fee6cc17bf57288366c5b163594599132","source":{"kind":"arxiv","id":"1902.08135","version":1},"attestation_state":"computed","paper":{"title":"Coloring squares of graphs with mad constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Herv\\'e Hocquard, Seog-Jin Kim, Th\\'eo Pierron","submitted_at":"2019-02-21T16:47:36Z","abstract_excerpt":"A proper vertex $k$-coloring of a graph $G=(V,E)$ is an assignment $c:V\\to \\{1,2,\\ldots,k\\}$ of colors to the vertices of the graph such that no two adjacent vertices are associated with the same color. The square $G^2$ of a graph $G$ is the graph defined by $V(G)=V(G^2)$ and $uv \\in E(G^2)$ if and only if the distance between $u$ and $v$ is at most two. We denote by $\\chi(G^2)$ the chromatic number of $G^2$, which is the least integer $k$ such that a $k$-coloring of $G^2$ exists. By definition, at least $\\Delta(G)+1$ colors are needed for this goal, where $\\Delta(G)$ denotes the maximum degre"},"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":"1902.08135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-21T16:47:36Z","cross_cats_sorted":[],"title_canon_sha256":"79a1721a6ec53f8ac5ec861043db74f1334525cf8df7c2550e0242d12273e181","abstract_canon_sha256":"636dc89357a55eda9101cf8bf1a4b4fcbc22bc9401e8839b4105592e99331163"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:01.989753Z","signature_b64":"lh8XYD+IAt7zZ1qbgTsJS8gW6lI442kMKFf2C1RUp8BQTwEbzYf/PBdDQUXl1WWN4+wMmsI2FYIHiPkJodGgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fe03cd36771f6dfda68b8306437e97fee6cc17bf57288366c5b163594599132","last_reissued_at":"2026-05-17T23:53:01.989270Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:01.989270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring squares of graphs with mad constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Herv\\'e Hocquard, Seog-Jin Kim, Th\\'eo Pierron","submitted_at":"2019-02-21T16:47:36Z","abstract_excerpt":"A proper vertex $k$-coloring of a graph $G=(V,E)$ is an assignment $c:V\\to \\{1,2,\\ldots,k\\}$ of colors to the vertices of the graph such that no two adjacent vertices are associated with the same color. The square $G^2$ of a graph $G$ is the graph defined by $V(G)=V(G^2)$ and $uv \\in E(G^2)$ if and only if the distance between $u$ and $v$ is at most two. We denote by $\\chi(G^2)$ the chromatic number of $G^2$, which is the least integer $k$ such that a $k$-coloring of $G^2$ exists. By definition, at least $\\Delta(G)+1$ colors are needed for this goal, where $\\Delta(G)$ denotes the maximum degre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08135","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":"1902.08135","created_at":"2026-05-17T23:53:01.989347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08135v1","created_at":"2026-05-17T23:53:01.989347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08135","created_at":"2026-05-17T23:53:01.989347+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7QDZU3HOH3N","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7QDZU3HOH3N7WTI","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7QDZU3H","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":97,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7","json":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7.json","graph_json":"https://pith.science/api/pith-number/P7QDZU3HOH3N7WTIXAYGIN7JP7/graph.json","events_json":"https://pith.science/api/pith-number/P7QDZU3HOH3N7WTIXAYGIN7JP7/events.json","paper":"https://pith.science/paper/P7QDZU3H"},"agent_actions":{"view_html":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7","download_json":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7.json","view_paper":"https://pith.science/paper/P7QDZU3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08135&json=true","fetch_graph":"https://pith.science/api/pith-number/P7QDZU3HOH3N7WTIXAYGIN7JP7/graph.json","fetch_events":"https://pith.science/api/pith-number/P7QDZU3HOH3N7WTIXAYGIN7JP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/action/storage_attestation","attest_author":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/action/author_attestation","sign_citation":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/action/citation_signature","submit_replication":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/action/replication_record"}},"created_at":"2026-05-17T23:53:01.989347+00:00","updated_at":"2026-05-17T23:53:01.989347+00:00"}