{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:K6545ARDT3IM2WYIFOFSTAL5LZ","short_pith_number":"pith:K6545ARD","schema_version":"1.0","canonical_sha256":"57bbce82239ed0cd5b082b8b29817d5e59a3137cb1a72a6521010b51fbcd4890","source":{"kind":"arxiv","id":"1303.3191","version":2},"attestation_state":"computed","paper":{"title":"Distance-two coloring of sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis Esperet, Zdenek Dvorak","submitted_at":"2013-03-13T15:30:23Z","abstract_excerpt":"Consider a graph $G = (V, E)$ and, for each vertex $v \\in V$, a subset $\\Sigma(v)$ of neighbors of $v$. A $\\Sigma$-coloring is a coloring of the elements of $V$ so that vertices appearing together in some $\\Sigma(v)$ receive pairwise distinct colors. An obvious lower bound for the minimum number of colors in such a coloring is the maximum size of a set $\\Sigma(v)$, denoted by $\\rho(\\Sigma)$. In this paper we study graph classes $F$ for which there is a function $f$, such that for any graph $G \\in F$ and any $\\Sigma$, there is a $\\Sigma$-coloring using at most $f(\\rho(\\Sigma))$ colors. It is pr"},"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":"1303.3191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-13T15:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"4a900bed77fd2fed390ba66324d442e1a154c99810c3b2a56f163d6a55a410e3","abstract_canon_sha256":"8657933e755305f7610c2082f918fbfa74a188287e17ed6d56b4d52db3eb6004"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:22.308626Z","signature_b64":"iT2GGyLsI39FwSRN+/sK+X6dR7J8ZO7sHac7YZrwEL15FbCKr8iUn99935qVjErg9KUCHWKXnVufZZa8m7CyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57bbce82239ed0cd5b082b8b29817d5e59a3137cb1a72a6521010b51fbcd4890","last_reissued_at":"2026-05-18T03:12:22.307969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:22.307969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance-two coloring of sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis Esperet, Zdenek Dvorak","submitted_at":"2013-03-13T15:30:23Z","abstract_excerpt":"Consider a graph $G = (V, E)$ and, for each vertex $v \\in V$, a subset $\\Sigma(v)$ of neighbors of $v$. A $\\Sigma$-coloring is a coloring of the elements of $V$ so that vertices appearing together in some $\\Sigma(v)$ receive pairwise distinct colors. An obvious lower bound for the minimum number of colors in such a coloring is the maximum size of a set $\\Sigma(v)$, denoted by $\\rho(\\Sigma)$. In this paper we study graph classes $F$ for which there is a function $f$, such that for any graph $G \\in F$ and any $\\Sigma$, there is a $\\Sigma$-coloring using at most $f(\\rho(\\Sigma))$ colors. It is pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3191","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":""},"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":"1303.3191","created_at":"2026-05-18T03:12:22.308097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3191v2","created_at":"2026-05-18T03:12:22.308097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3191","created_at":"2026-05-18T03:12:22.308097+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6545ARDT3IM","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6545ARDT3IM2WYI","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6545ARD","created_at":"2026-05-18T12:27:49.015174+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/K6545ARDT3IM2WYIFOFSTAL5LZ","json":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ.json","graph_json":"https://pith.science/api/pith-number/K6545ARDT3IM2WYIFOFSTAL5LZ/graph.json","events_json":"https://pith.science/api/pith-number/K6545ARDT3IM2WYIFOFSTAL5LZ/events.json","paper":"https://pith.science/paper/K6545ARD"},"agent_actions":{"view_html":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ","download_json":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ.json","view_paper":"https://pith.science/paper/K6545ARD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3191&json=true","fetch_graph":"https://pith.science/api/pith-number/K6545ARDT3IM2WYIFOFSTAL5LZ/graph.json","fetch_events":"https://pith.science/api/pith-number/K6545ARDT3IM2WYIFOFSTAL5LZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/action/storage_attestation","attest_author":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/action/author_attestation","sign_citation":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/action/citation_signature","submit_replication":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/action/replication_record"}},"created_at":"2026-05-18T03:12:22.308097+00:00","updated_at":"2026-05-18T03:12:22.308097+00:00"}