{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P7QDZU3HOH3N7WTIXAYGIN7JP7","short_pith_number":"pith:P7QDZU3H","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"},"canonical_sha256":"7fe03cd36771f6dfda68b8306437e97fee6cc17bf57288366c5b163594599132","source":{"kind":"arxiv","id":"1902.08135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08135","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08135v1","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08135","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"pith_short_12","alias_value":"P7QDZU3HOH3N","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P7QDZU3HOH3N7WTI","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P7QDZU3H","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P7QDZU3HOH3N7WTIXAYGIN7JP7","target":"record","payload":{"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"},"canonical_sha256":"7fe03cd36771f6dfda68b8306437e97fee6cc17bf57288366c5b163594599132","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"},"source_kind":"arxiv","source_id":"1902.08135","source_version":1,"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:53:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LF54s7JVT9NCyCPy6SA5HSEsxPIQBLjw1E6npQHqdz4RY/6ktRTRMfkxmjHpcMXcoNoescUVm2o/qj6sPEpTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:00:40.397148Z"},"content_sha256":"68de2f4a55624ce9c4c2ac8ef9fe47967f996bb5f61283de31837dc5f58d5701","schema_version":"1.0","event_id":"sha256:68de2f4a55624ce9c4c2ac8ef9fe47967f996bb5f61283de31837dc5f58d5701"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P7QDZU3HOH3N7WTIXAYGIN7JP7","target":"graph","payload":{"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"},"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:53:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5x7JGaxmez9DtkXhMwKVtuyvwlRxcJOtikEz+8xi03RMP9Elwq/tjd+Ypu2RhlZ9+5+AJlteP430prJlP7zABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:00:40.397539Z"},"content_sha256":"76d24807f1e91af24ca87b4f429ca037b799e2150c5e62a54e712e12adeb8cc9","schema_version":"1.0","event_id":"sha256:76d24807f1e91af24ca87b4f429ca037b799e2150c5e62a54e712e12adeb8cc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/bundle.json","state_url":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/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-23T19:00:40Z","links":{"resolver":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7","bundle":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/bundle.json","state":"https://pith.science/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7QDZU3HOH3N7WTIXAYGIN7JP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P7QDZU3HOH3N7WTIXAYGIN7JP7","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":"636dc89357a55eda9101cf8bf1a4b4fcbc22bc9401e8839b4105592e99331163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-21T16:47:36Z","title_canon_sha256":"79a1721a6ec53f8ac5ec861043db74f1334525cf8df7c2550e0242d12273e181"},"schema_version":"1.0","source":{"id":"1902.08135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08135","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08135v1","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08135","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"pith_short_12","alias_value":"P7QDZU3HOH3N","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P7QDZU3HOH3N7WTI","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P7QDZU3H","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:76d24807f1e91af24ca87b4f429ca037b799e2150c5e62a54e712e12adeb8cc9","target":"graph","created_at":"2026-05-17T23:53:01Z","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 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","authors_text":"Herv\\'e Hocquard, Seog-Jin Kim, Th\\'eo Pierron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-21T16:47:36Z","title":"Coloring squares of graphs with mad constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08135","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:68de2f4a55624ce9c4c2ac8ef9fe47967f996bb5f61283de31837dc5f58d5701","target":"record","created_at":"2026-05-17T23:53:01Z","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":"636dc89357a55eda9101cf8bf1a4b4fcbc22bc9401e8839b4105592e99331163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-21T16:47:36Z","title_canon_sha256":"79a1721a6ec53f8ac5ec861043db74f1334525cf8df7c2550e0242d12273e181"},"schema_version":"1.0","source":{"id":"1902.08135","kind":"arxiv","version":1}},"canonical_sha256":"7fe03cd36771f6dfda68b8306437e97fee6cc17bf57288366c5b163594599132","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fe03cd36771f6dfda68b8306437e97fee6cc17bf57288366c5b163594599132","first_computed_at":"2026-05-17T23:53:01.989270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:01.989270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lh8XYD+IAt7zZ1qbgTsJS8gW6lI442kMKFf2C1RUp8BQTwEbzYf/PBdDQUXl1WWN4+wMmsI2FYIHiPkJodGgCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:01.989753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68de2f4a55624ce9c4c2ac8ef9fe47967f996bb5f61283de31837dc5f58d5701","sha256:76d24807f1e91af24ca87b4f429ca037b799e2150c5e62a54e712e12adeb8cc9"],"state_sha256":"13c46586bc1c063cfdc73b383b2564cd9699a72f35f882aeef73b060d93faf27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5TkAcVjPF9ljODsp5ZpIL2KGnq4E70Xo3mRT95oGhFR0bKFMgTwuoi3noVAmcMQR8sJaBd/LI2MmjTRDmh4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:00:40.399785Z","bundle_sha256":"2c4c6383e929f3b52d3f83cd3e0ea8fb4b4372099ba76cae5c3004f0acc7f487"}}