{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7SSFUMDMATA3C3RVDIFK4EIESH","short_pith_number":"pith:7SSFUMDM","schema_version":"1.0","canonical_sha256":"fca45a306c04c1b16e351a0aae110491e0753e2e84bc2f3ced2244e94998432c","source":{"kind":"arxiv","id":"1806.11465","version":1},"attestation_state":"computed","paper":{"title":"Neighbor-Locating Colorings in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Liliana Alcon, Marisa Gutierrez, Merce Mora","submitted_at":"2018-06-29T15:14:50Z","abstract_excerpt":"A $k$-coloring of a graph $G$ is a $k$-partition $\\Pi=\\{S_1,\\ldots,S_k\\}$ of $V(G)$ into independent sets, called \\emph{colors}. A $k$-coloring is called \\emph{neighbor-locating} if for every pair of vertices $u,v$ belonging to the same color $S_i$, the set of colors of the neighborhood of $u$ is different from the set of colors of the neighborhood of $v$. The neighbor-locating chromatic number $\\chi _{_{NL}}(G)$ is the minimum cardinality of a neighbor-locating coloring of $G$.\n  We establish some tight bounds for the neighbor-locating chromatic number of a graph, in terms of its order, maxim"},"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":"1806.11465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-29T15:14:50Z","cross_cats_sorted":[],"title_canon_sha256":"4cfbdc8a33173d75e954e82cd3f4d970c65a8963599b233d1bdb29d19e064f91","abstract_canon_sha256":"068adb540fa9846e1733027c7f234100cbe34f673881711ad9c8687399e0d48e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:01.801722Z","signature_b64":"Dg7vyCA6WnLTFoMMKkKcaxLz4PP3twkfxBR5Mn6+YJI8R8FjVULIXI6UTBfZy0iK/7neDA3u4jOb6E9l1p4zCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fca45a306c04c1b16e351a0aae110491e0753e2e84bc2f3ced2244e94998432c","last_reissued_at":"2026-05-18T00:12:01.801070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:01.801070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neighbor-Locating Colorings in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Liliana Alcon, Marisa Gutierrez, Merce Mora","submitted_at":"2018-06-29T15:14:50Z","abstract_excerpt":"A $k$-coloring of a graph $G$ is a $k$-partition $\\Pi=\\{S_1,\\ldots,S_k\\}$ of $V(G)$ into independent sets, called \\emph{colors}. A $k$-coloring is called \\emph{neighbor-locating} if for every pair of vertices $u,v$ belonging to the same color $S_i$, the set of colors of the neighborhood of $u$ is different from the set of colors of the neighborhood of $v$. The neighbor-locating chromatic number $\\chi _{_{NL}}(G)$ is the minimum cardinality of a neighbor-locating coloring of $G$.\n  We establish some tight bounds for the neighbor-locating chromatic number of a graph, in terms of its order, maxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11465","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":"1806.11465","created_at":"2026-05-18T00:12:01.801154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.11465v1","created_at":"2026-05-18T00:12:01.801154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11465","created_at":"2026-05-18T00:12:01.801154+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SSFUMDMATA3","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SSFUMDMATA3C3RV","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SSFUMDM","created_at":"2026-05-18T12:32:11.075285+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/7SSFUMDMATA3C3RVDIFK4EIESH","json":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH.json","graph_json":"https://pith.science/api/pith-number/7SSFUMDMATA3C3RVDIFK4EIESH/graph.json","events_json":"https://pith.science/api/pith-number/7SSFUMDMATA3C3RVDIFK4EIESH/events.json","paper":"https://pith.science/paper/7SSFUMDM"},"agent_actions":{"view_html":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH","download_json":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH.json","view_paper":"https://pith.science/paper/7SSFUMDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.11465&json=true","fetch_graph":"https://pith.science/api/pith-number/7SSFUMDMATA3C3RVDIFK4EIESH/graph.json","fetch_events":"https://pith.science/api/pith-number/7SSFUMDMATA3C3RVDIFK4EIESH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH/action/storage_attestation","attest_author":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH/action/author_attestation","sign_citation":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH/action/citation_signature","submit_replication":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH/action/replication_record"}},"created_at":"2026-05-18T00:12:01.801154+00:00","updated_at":"2026-05-18T00:12:01.801154+00:00"}