{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WBIPUDTVVN2TXNHBXVQ7V76UO2","short_pith_number":"pith:WBIPUDTV","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"},"canonical_sha256":"b050fa0e75ab753bb4e1bd61faffd476ab43dccb44efb190bff47ebb055ecc51","source":{"kind":"arxiv","id":"1903.11937","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11937","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11937v2","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11937","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"WBIPUDTVVN2T","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"WBIPUDTVVN2TXNHB","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"WBIPUDTV","created_at":"2026-07-05T08:17:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WBIPUDTVVN2TXNHBXVQ7V76UO2","target":"record","payload":{"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"},"canonical_sha256":"b050fa0e75ab753bb4e1bd61faffd476ab43dccb44efb190bff47ebb055ecc51","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"},"source_kind":"arxiv","source_id":"1903.11937","source_version":2,"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-07-05T08:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHzgZxtEBqP53VbZ3mgWBlQ4oOK9HhG81O+EM4gk/CgPRcNTF1+jnNVJwEp0c6BD4qgJaQQz18irr02h0gG+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:04:48.040556Z"},"content_sha256":"89a042b7e280e3b935ae8da008d724110cd58286faded0fe9e8224b747192e0e","schema_version":"1.0","event_id":"sha256:89a042b7e280e3b935ae8da008d724110cd58286faded0fe9e8224b747192e0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WBIPUDTVVN2TXNHBXVQ7V76UO2","target":"graph","payload":{"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"},"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-07-05T08:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJTJlio1+VNaPoAxnPnYuBKT1yQ4bsirYls4146rtLpXuwyA5jTGlLMyrTYf7qy8iErHTNVYqQo6DYb5h6CBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:04:48.041050Z"},"content_sha256":"6ea20981f2bdf6991d17f25d3256957243e00a8c07a4631dd00c798d0b36d36a","schema_version":"1.0","event_id":"sha256:6ea20981f2bdf6991d17f25d3256957243e00a8c07a4631dd00c798d0b36d36a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/bundle.json","state_url":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/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-08-05T22:04:48Z","links":{"resolver":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2","bundle":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/bundle.json","state":"https://pith.science/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBIPUDTVVN2TXNHBXVQ7V76UO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WBIPUDTVVN2TXNHBXVQ7V76UO2","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":"6da0deed08b2eab8e0ac2e84c12c95fb8a90c9b060496f993046fd79915a1ee8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T13:09:14Z","title_canon_sha256":"2314508e9de229c368b49b1f959a66b3980bc8d9c782025131674c07b01597d7"},"schema_version":"1.0","source":{"id":"1903.11937","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11937","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11937v2","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11937","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"WBIPUDTVVN2T","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"WBIPUDTVVN2TXNHB","created_at":"2026-07-05T08:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"WBIPUDTV","created_at":"2026-07-05T08:17:03Z"}],"graph_snapshots":[{"event_id":"sha256:6ea20981f2bdf6991d17f25d3256957243e00a8c07a4631dd00c798d0b36d36a","target":"graph","created_at":"2026-07-05T08:17:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.11937/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Liliana Alcon, Marisa Gutierrez, Merc\\`e Mora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T13:09:14Z","title":"The Neighbor-Locating-Chromatic Number of Pseudotrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11937","kind":"arxiv","version":2},"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:89a042b7e280e3b935ae8da008d724110cd58286faded0fe9e8224b747192e0e","target":"record","created_at":"2026-07-05T08:17:03Z","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":"6da0deed08b2eab8e0ac2e84c12c95fb8a90c9b060496f993046fd79915a1ee8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T13:09:14Z","title_canon_sha256":"2314508e9de229c368b49b1f959a66b3980bc8d9c782025131674c07b01597d7"},"schema_version":"1.0","source":{"id":"1903.11937","kind":"arxiv","version":2}},"canonical_sha256":"b050fa0e75ab753bb4e1bd61faffd476ab43dccb44efb190bff47ebb055ecc51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b050fa0e75ab753bb4e1bd61faffd476ab43dccb44efb190bff47ebb055ecc51","first_computed_at":"2026-07-05T08:17:03.084073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:17:03.084073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X/7PNRzxmsntPFC9V2oaaEGs1Snc9IkQH9tch0wf0AY2mylgu8wonrSn0/eVn4CV/8+uAZIX4ThoUUBowqBaDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:17:03.084540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11937","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89a042b7e280e3b935ae8da008d724110cd58286faded0fe9e8224b747192e0e","sha256:6ea20981f2bdf6991d17f25d3256957243e00a8c07a4631dd00c798d0b36d36a"],"state_sha256":"192e035e44bbd401d1548a8027d4f1ea8e3e7eb6901d57df18981644281e09f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4A5YBKhuIprZ+LwflSRK7N5wqN/bqWPWT/Ks9KOpXBoZDF7CvTx8A7q+2UUqO7WIT/tqIXHbMM+bckhPuB8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T22:04:48.045256Z","bundle_sha256":"7cf5d0c561ef87ca36b7f7d643e42326e257fe4032bf24ef24fe11f915524c31"}}