{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7SSFUMDMATA3C3RVDIFK4EIESH","short_pith_number":"pith:7SSFUMDM","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"},"canonical_sha256":"fca45a306c04c1b16e351a0aae110491e0753e2e84bc2f3ced2244e94998432c","source":{"kind":"arxiv","id":"1806.11465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11465","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11465v1","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11465","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"7SSFUMDMATA3","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7SSFUMDMATA3C3RV","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7SSFUMDM","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7SSFUMDMATA3C3RVDIFK4EIESH","target":"record","payload":{"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"},"canonical_sha256":"fca45a306c04c1b16e351a0aae110491e0753e2e84bc2f3ced2244e94998432c","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"},"source_kind":"arxiv","source_id":"1806.11465","source_version":1,"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-05-18T00:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZTD/4XPNmPJTfcQEEhKoYqMxfhkZBHIyve0gxM84u55xRvt1aFe63kDUa559nvIIHYY2I+5x3VQ5IIxunrCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:17:58.090931Z"},"content_sha256":"1e4102511f408cf6c6cea7ccc5899a9440918de8de70d9634c232496b1caadf6","schema_version":"1.0","event_id":"sha256:1e4102511f408cf6c6cea7ccc5899a9440918de8de70d9634c232496b1caadf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7SSFUMDMATA3C3RVDIFK4EIESH","target":"graph","payload":{"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"},"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-05-18T00:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DUDWzzslXLDXGz1jsRUEhk3s4I1VL2KDPMe+dC5s2rA9gxBITX8gu75wYxVtvWT798DbtyQQR67vLNpDfCu2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:17:58.091456Z"},"content_sha256":"73700858849e6657b42512e40726583f83337567180801e95b0edc672aa48ab6","schema_version":"1.0","event_id":"sha256:73700858849e6657b42512e40726583f83337567180801e95b0edc672aa48ab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH/bundle.json","state_url":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SSFUMDMATA3C3RVDIFK4EIESH/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-05-22T17:17:58Z","links":{"resolver":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH","bundle":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH/bundle.json","state":"https://pith.science/pith/7SSFUMDMATA3C3RVDIFK4EIESH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SSFUMDMATA3C3RVDIFK4EIESH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7SSFUMDMATA3C3RVDIFK4EIESH","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":"068adb540fa9846e1733027c7f234100cbe34f673881711ad9c8687399e0d48e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-29T15:14:50Z","title_canon_sha256":"4cfbdc8a33173d75e954e82cd3f4d970c65a8963599b233d1bdb29d19e064f91"},"schema_version":"1.0","source":{"id":"1806.11465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11465","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11465v1","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11465","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"7SSFUMDMATA3","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7SSFUMDMATA3C3RV","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7SSFUMDM","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:73700858849e6657b42512e40726583f83337567180801e95b0edc672aa48ab6","target":"graph","created_at":"2026-05-18T00:12:01Z","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"},"paper":{"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","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Liliana Alcon, Marisa Gutierrez, Merce Mora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-29T15:14:50Z","title":"Neighbor-Locating Colorings in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11465","kind":"arxiv","version":1},"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:1e4102511f408cf6c6cea7ccc5899a9440918de8de70d9634c232496b1caadf6","target":"record","created_at":"2026-05-18T00:12:01Z","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":"068adb540fa9846e1733027c7f234100cbe34f673881711ad9c8687399e0d48e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-29T15:14:50Z","title_canon_sha256":"4cfbdc8a33173d75e954e82cd3f4d970c65a8963599b233d1bdb29d19e064f91"},"schema_version":"1.0","source":{"id":"1806.11465","kind":"arxiv","version":1}},"canonical_sha256":"fca45a306c04c1b16e351a0aae110491e0753e2e84bc2f3ced2244e94998432c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fca45a306c04c1b16e351a0aae110491e0753e2e84bc2f3ced2244e94998432c","first_computed_at":"2026-05-18T00:12:01.801070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:01.801070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dg7vyCA6WnLTFoMMKkKcaxLz4PP3twkfxBR5Mn6+YJI8R8FjVULIXI6UTBfZy0iK/7neDA3u4jOb6E9l1p4zCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:01.801722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.11465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e4102511f408cf6c6cea7ccc5899a9440918de8de70d9634c232496b1caadf6","sha256:73700858849e6657b42512e40726583f83337567180801e95b0edc672aa48ab6"],"state_sha256":"f49cdc46c1afafd6501d7a9ee0819752930851b709fb755d3b6592eabf5d39a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlqVEa2PLGk8WhB9cUP74p0JbVaVYiIs6Ch7P5WA88g8oGdGYLzk/Ssb4F0bkn59QdrAO9LaG+ufy6op48fMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:17:58.094788Z","bundle_sha256":"d5d72ef496b0e4c166efe510a418d099baba0cafa11b4473970b4d75c5df9314"}}