{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TAWXTQA4IEBRKJSAE67ORCETAK","short_pith_number":"pith:TAWXTQA4","schema_version":"1.0","canonical_sha256":"982d79c01c410315264027bee88893028e34195b864b478fe9ae760199cd9fae","source":{"kind":"arxiv","id":"1602.09111","version":1},"attestation_state":"computed","paper":{"title":"2-Distance Colorings of Integer Distance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Brahim Benmedjdoub (L'IFORCE), Eric Sopena (LaBRI), Isma Bouchemakh (L'IFORCE)","submitted_at":"2016-02-29T19:32:14Z","abstract_excerpt":"A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. .. , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-distance chromatic number $\\chi$ 2 (G) of G is then the mallest k for which G admits a 2-distance k-coloring. For any finite set of positive integers D = {d 1 ,. .. , d k }, the integer distance graph G = G(D) is the infinite graph defined by V (G) = Z and uv $\\in$ E(G) if and only if |v -- u| $\\in$ D. We study the 2-distance chromatic number of integer distance graphs for several types of sets D. In each case, we provi"},"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":"1602.09111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-29T19:32:14Z","cross_cats_sorted":[],"title_canon_sha256":"605f4189ceccd4bf2d96c96f8dd9d7639f46cde80adc239399bb516c8615f1b8","abstract_canon_sha256":"f1dc6a8e556f9d6c068a89b1f11e8e613d2a2e6d4258dbf9246b2bbb52ba77bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:51.271896Z","signature_b64":"4EfHPdEiRdx1nIS7S7PZ5K1oOGT0mRBB4JA7OpfMHI5uKcJOvMJyJo0aJ2R7WSXFDja6TEkR+Hm5AIB/mgwvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"982d79c01c410315264027bee88893028e34195b864b478fe9ae760199cd9fae","last_reissued_at":"2026-05-18T01:19:51.271256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:51.271256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-Distance Colorings of Integer Distance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Brahim Benmedjdoub (L'IFORCE), Eric Sopena (LaBRI), Isma Bouchemakh (L'IFORCE)","submitted_at":"2016-02-29T19:32:14Z","abstract_excerpt":"A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. .. , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-distance chromatic number $\\chi$ 2 (G) of G is then the mallest k for which G admits a 2-distance k-coloring. For any finite set of positive integers D = {d 1 ,. .. , d k }, the integer distance graph G = G(D) is the infinite graph defined by V (G) = Z and uv $\\in$ E(G) if and only if |v -- u| $\\in$ D. We study the 2-distance chromatic number of integer distance graphs for several types of sets D. In each case, we provi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.09111","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":"1602.09111","created_at":"2026-05-18T01:19:51.271355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.09111v1","created_at":"2026-05-18T01:19:51.271355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.09111","created_at":"2026-05-18T01:19:51.271355+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAWXTQA4IEBR","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAWXTQA4IEBRKJSA","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAWXTQA4","created_at":"2026-05-18T12:30:44.179134+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/TAWXTQA4IEBRKJSAE67ORCETAK","json":"https://pith.science/pith/TAWXTQA4IEBRKJSAE67ORCETAK.json","graph_json":"https://pith.science/api/pith-number/TAWXTQA4IEBRKJSAE67ORCETAK/graph.json","events_json":"https://pith.science/api/pith-number/TAWXTQA4IEBRKJSAE67ORCETAK/events.json","paper":"https://pith.science/paper/TAWXTQA4"},"agent_actions":{"view_html":"https://pith.science/pith/TAWXTQA4IEBRKJSAE67ORCETAK","download_json":"https://pith.science/pith/TAWXTQA4IEBRKJSAE67ORCETAK.json","view_paper":"https://pith.science/paper/TAWXTQA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.09111&json=true","fetch_graph":"https://pith.science/api/pith-number/TAWXTQA4IEBRKJSAE67ORCETAK/graph.json","fetch_events":"https://pith.science/api/pith-number/TAWXTQA4IEBRKJSAE67ORCETAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAWXTQA4IEBRKJSAE67ORCETAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAWXTQA4IEBRKJSAE67ORCETAK/action/storage_attestation","attest_author":"https://pith.science/pith/TAWXTQA4IEBRKJSAE67ORCETAK/action/author_attestation","sign_citation":"https://pith.science/pith/TAWXTQA4IEBRKJSAE67ORCETAK/action/citation_signature","submit_replication":"https://pith.science/pith/TAWXTQA4IEBRKJSAE67ORCETAK/action/replication_record"}},"created_at":"2026-05-18T01:19:51.271355+00:00","updated_at":"2026-05-18T01:19:51.271355+00:00"}