{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WBIPUDTVVN2TXNHBXVQ7V76UO2","short_pith_number":"pith:WBIPUDTV","schema_version":"1.0","canonical_sha256":"b050fa0e75ab753bb4e1bd61faffd476ab43dccb44efb190bff47ebb055ecc51","source":{"kind":"arxiv","id":"1903.11937","version":2},"attestation_state":"computed","paper":{"title":"The Neighbor-Locating-Chromatic Number of Pseudotrees","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, Merc\\`e Mora","submitted_at":"2019-03-28T13:09:14Z","abstract_excerpt":"A $k$-coloring of a graph $G$ is a partition of the set of vertices of $G$ into $k$ independent sets, which are called colors. A $k$-coloring is neighbor-locating if any two vertices belonging to the same color can be distinguished from each other by the colors of their respective neighbors. The neighbor-locating chromatic number $\\chi _{_{NL}}(G)$ is the minimum cardinality of a neighbor-locating coloring of $G$. In this paper, we determine the neighbor-locating chromatic number of paths, cycles, fans, and wheels. Moreover, a procedure to construct a neighbor-locating coloring of minimum card"},"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":"1903.11937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T13:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"2314508e9de229c368b49b1f959a66b3980bc8d9c782025131674c07b01597d7","abstract_canon_sha256":"6da0deed08b2eab8e0ac2e84c12c95fb8a90c9b060496f993046fd79915a1ee8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:17:03.084540Z","signature_b64":"X/7PNRzxmsntPFC9V2oaaEGs1Snc9IkQH9tch0wf0AY2mylgu8wonrSn0/eVn4CV/8+uAZIX4ThoUUBowqBaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b050fa0e75ab753bb4e1bd61faffd476ab43dccb44efb190bff47ebb055ecc51","last_reissued_at":"2026-07-05T08:17:03.084073Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:17:03.084073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Neighbor-Locating-Chromatic Number of Pseudotrees","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, Merc\\`e Mora","submitted_at":"2019-03-28T13:09:14Z","abstract_excerpt":"A $k$-coloring of a graph $G$ is a partition of the set of vertices of $G$ into $k$ independent sets, which are called colors. A $k$-coloring is neighbor-locating if any two vertices belonging to the same color can be distinguished from each other by the colors of their respective neighbors. The neighbor-locating chromatic number $\\chi _{_{NL}}(G)$ is the minimum cardinality of a neighbor-locating coloring of $G$. In this paper, we determine the neighbor-locating chromatic number of paths, cycles, fans, and wheels. Moreover, a procedure to construct a neighbor-locating coloring of minimum card"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11937","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.11937/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1903.11937","created_at":"2026-07-05T08:17:03.084131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11937v2","created_at":"2026-07-05T08:17:03.084131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11937","created_at":"2026-07-05T08:17:03.084131+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBIPUDTVVN2T","created_at":"2026-07-05T08:17:03.084131+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBIPUDTVVN2TXNHB","created_at":"2026-07-05T08:17:03.084131+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBIPUDTV","created_at":"2026-07-05T08:17:03.084131+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/WBIPUDTVVN2TXNHBXVQ7V76UO2","json":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2.json","graph_json":"https://pith.science/api/pith-number/WBIPUDTVVN2TXNHBXVQ7V76UO2/graph.json","events_json":"https://pith.science/api/pith-number/WBIPUDTVVN2TXNHBXVQ7V76UO2/events.json","paper":"https://pith.science/paper/WBIPUDTV"},"agent_actions":{"view_html":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2","download_json":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2.json","view_paper":"https://pith.science/paper/WBIPUDTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11937&json=true","fetch_graph":"https://pith.science/api/pith-number/WBIPUDTVVN2TXNHBXVQ7V76UO2/graph.json","fetch_events":"https://pith.science/api/pith-number/WBIPUDTVVN2TXNHBXVQ7V76UO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/action/storage_attestation","attest_author":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/action/author_attestation","sign_citation":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/action/citation_signature","submit_replication":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/action/replication_record"}},"created_at":"2026-07-05T08:17:03.084131+00:00","updated_at":"2026-07-05T08:17:03.084131+00:00"}