{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UV2TVVRFTTGPIJ2HYZ2OT2Z575","short_pith_number":"pith:UV2TVVRF","canonical_record":{"source":{"id":"1106.3453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-17T11:39:19Z","cross_cats_sorted":[],"title_canon_sha256":"e9060e8bd5dd4d2ec2cb80e977267f6d714e080d826a08bcdff530f464b20ba4","abstract_canon_sha256":"0032b4b7c405ea44abca7eca11dd0ffb1520215bd1d85eba042be39216601713"},"schema_version":"1.0"},"canonical_sha256":"a5753ad6259cccf42747c674e9eb3dff43a7cab3b59a1edf991e6b9e9054b82f","source":{"kind":"arxiv","id":"1106.3453","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3453","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3453v3","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3453","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"UV2TVVRFTTGP","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UV2TVVRFTTGPIJ2H","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UV2TVVRF","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UV2TVVRFTTGPIJ2HYZ2OT2Z575","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-17T11:39:19Z","cross_cats_sorted":[],"title_canon_sha256":"e9060e8bd5dd4d2ec2cb80e977267f6d714e080d826a08bcdff530f464b20ba4","abstract_canon_sha256":"0032b4b7c405ea44abca7eca11dd0ffb1520215bd1d85eba042be39216601713"},"schema_version":"1.0"},"canonical_sha256":"a5753ad6259cccf42747c674e9eb3dff43a7cab3b59a1edf991e6b9e9054b82f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:56.354021Z","signature_b64":"uG/yOMDywJ0Utdm8F91hGg4Xj49ULN5A60CU/c2XRIvWdA1XEC0m/Z4CSTfIstTVG1bmtH3NuFvYP5PUSJJBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5753ad6259cccf42747c674e9eb3dff43a7cab3b59a1edf991e6b9e9054b82f","last_reissued_at":"2026-05-18T03:38:56.353519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:56.353519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3453","source_version":3,"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-18T03:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d55teWDq95XXYFwmVvMafyfLWN7uXXh/LU98S26rUvHt9TtCDjLg6aSoqOLRrjA8x261qixl5o3TMT2Q9fkbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:19:54.201859Z"},"content_sha256":"aa0ded0e558281806e8408cad91bcea85b82bc515974c0b629bbbb9ba184ad48","schema_version":"1.0","event_id":"sha256:aa0ded0e558281806e8408cad91bcea85b82bc515974c0b629bbbb9ba184ad48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UV2TVVRFTTGPIJ2HYZ2OT2Z575","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Locating Chromatic Number of the Cartesian Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Behtoei, Behnaz Omoomi","submitted_at":"2011-06-17T11:39:19Z","abstract_excerpt":"Let $c$ be a proper $k$-coloring of a connected graph $G$ and $\\Pi=(C_1,C_2,...,C_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $\\Pi$ is defined to be the ordered $k$-tuple $c_{{}_\\Pi}(v):=(d(v,C_1),d(v,C_2),...,d(v,C_k)),$ where $d(v,C_i)=\\min\\{d(v,x) | x\\in C_i\\}, 1\\leq i\\leq k$. If distinct vertices have distinct color codes, then $c$ is called a locating coloring. The minimum number of colors needed in a locating coloring of $G$ is the locating chromatic number of $G$, denoted by $\\Cchi_{{}_L}(G)$. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3453","kind":"arxiv","version":3},"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-18T03:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgPMEdhCH313N33nXX3PPZb6B59PWkUxxR/7ctzbYj2gQznKUMsf2l6R/sOLd/WlC5wrCQ2+KN3x9Mb9aCadCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:19:54.202201Z"},"content_sha256":"d0acd92730d970b471a0e27156e33461fdf363b551c99e15e1b5317f50ef1f85","schema_version":"1.0","event_id":"sha256:d0acd92730d970b471a0e27156e33461fdf363b551c99e15e1b5317f50ef1f85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UV2TVVRFTTGPIJ2HYZ2OT2Z575/bundle.json","state_url":"https://pith.science/pith/UV2TVVRFTTGPIJ2HYZ2OT2Z575/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UV2TVVRFTTGPIJ2HYZ2OT2Z575/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-06-22T13:19:54Z","links":{"resolver":"https://pith.science/pith/UV2TVVRFTTGPIJ2HYZ2OT2Z575","bundle":"https://pith.science/pith/UV2TVVRFTTGPIJ2HYZ2OT2Z575/bundle.json","state":"https://pith.science/pith/UV2TVVRFTTGPIJ2HYZ2OT2Z575/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UV2TVVRFTTGPIJ2HYZ2OT2Z575/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UV2TVVRFTTGPIJ2HYZ2OT2Z575","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":"0032b4b7c405ea44abca7eca11dd0ffb1520215bd1d85eba042be39216601713","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-17T11:39:19Z","title_canon_sha256":"e9060e8bd5dd4d2ec2cb80e977267f6d714e080d826a08bcdff530f464b20ba4"},"schema_version":"1.0","source":{"id":"1106.3453","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3453","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3453v3","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3453","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"UV2TVVRFTTGP","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UV2TVVRFTTGPIJ2H","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UV2TVVRF","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:d0acd92730d970b471a0e27156e33461fdf363b551c99e15e1b5317f50ef1f85","target":"graph","created_at":"2026-05-18T03:38:56Z","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":"Let $c$ be a proper $k$-coloring of a connected graph $G$ and $\\Pi=(C_1,C_2,...,C_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $\\Pi$ is defined to be the ordered $k$-tuple $c_{{}_\\Pi}(v):=(d(v,C_1),d(v,C_2),...,d(v,C_k)),$ where $d(v,C_i)=\\min\\{d(v,x) | x\\in C_i\\}, 1\\leq i\\leq k$. If distinct vertices have distinct color codes, then $c$ is called a locating coloring. The minimum number of colors needed in a locating coloring of $G$ is the locating chromatic number of $G$, denoted by $\\Cchi_{{}_L}(G)$. In ","authors_text":"Ali Behtoei, Behnaz Omoomi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-17T11:39:19Z","title":"On the Locating Chromatic Number of the Cartesian Product of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3453","kind":"arxiv","version":3},"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:aa0ded0e558281806e8408cad91bcea85b82bc515974c0b629bbbb9ba184ad48","target":"record","created_at":"2026-05-18T03:38:56Z","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":"0032b4b7c405ea44abca7eca11dd0ffb1520215bd1d85eba042be39216601713","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-17T11:39:19Z","title_canon_sha256":"e9060e8bd5dd4d2ec2cb80e977267f6d714e080d826a08bcdff530f464b20ba4"},"schema_version":"1.0","source":{"id":"1106.3453","kind":"arxiv","version":3}},"canonical_sha256":"a5753ad6259cccf42747c674e9eb3dff43a7cab3b59a1edf991e6b9e9054b82f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5753ad6259cccf42747c674e9eb3dff43a7cab3b59a1edf991e6b9e9054b82f","first_computed_at":"2026-05-18T03:38:56.353519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:56.353519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uG/yOMDywJ0Utdm8F91hGg4Xj49ULN5A60CU/c2XRIvWdA1XEC0m/Z4CSTfIstTVG1bmtH3NuFvYP5PUSJJBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:56.354021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3453","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa0ded0e558281806e8408cad91bcea85b82bc515974c0b629bbbb9ba184ad48","sha256:d0acd92730d970b471a0e27156e33461fdf363b551c99e15e1b5317f50ef1f85"],"state_sha256":"a041f0c5bd670598df5c2d967f7987b9c58c4a019193eaac826714c30293a3fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aN4/xALcjuC3cZp2GzG1vMx2CxzHjdzCHJACxAXQqopunBmifT7Xz/9755cn2jeb4smRfsBx93UeNC2KjnjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:19:54.204107Z","bundle_sha256":"120e97daae6c36b34f94203277809427241483e8512e0b35799b46a2f4844e9f"}}