{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:I7B34UAO6SPL3QRI2TXQSY3W5D","short_pith_number":"pith:I7B34UAO","schema_version":"1.0","canonical_sha256":"47c3be500ef49ebdc228d4ef096376e8facf110c7b27735be2349fddee8bca8d","source":{"kind":"arxiv","id":"1112.2357","version":2},"attestation_state":"computed","paper":{"title":"The Locating Chromatic Number of the Join of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Behtoei","submitted_at":"2011-12-11T14:13:06Z","abstract_excerpt":"Let $f$ be a proper $k$-coloring of a connected graph $G$ and $\\Pi=(V_1,V_2,...,V_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,V_1),d(v,V_2),...,d(v,V_k)),$ where $d(v,V_i)=\\min\\{d(v,x)|x\\in V_i\\}, 1\\leq i\\leq k$. If distinct vertices have distinct color codes, then $f$ 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 th"},"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":"1112.2357","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-11T14:13:06Z","cross_cats_sorted":[],"title_canon_sha256":"12508aa96e540b26b025abd5a3f5817dfac78c3682c1276dfbe0190f8641973a","abstract_canon_sha256":"00c7cce8a0699cacea0f1d2ac79e450c28cc45ca75626bb430f529b2bcd496ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:06.346100Z","signature_b64":"MpVxUQA6vGWiM3ASdGiQj8Ii6Jwxgr+lD6QNMFo2wM7QKGEKdSkq1fn+kzcjc5NeLdSGH27tyRo/VsV6MuUSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47c3be500ef49ebdc228d4ef096376e8facf110c7b27735be2349fddee8bca8d","last_reissued_at":"2026-05-18T04:04:06.345604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:06.345604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Locating Chromatic Number of the Join of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Behtoei","submitted_at":"2011-12-11T14:13:06Z","abstract_excerpt":"Let $f$ be a proper $k$-coloring of a connected graph $G$ and $\\Pi=(V_1,V_2,...,V_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,V_1),d(v,V_2),...,d(v,V_k)),$ where $d(v,V_i)=\\min\\{d(v,x)|x\\in V_i\\}, 1\\leq i\\leq k$. If distinct vertices have distinct color codes, then $f$ 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 th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2357","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":""},"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":"1112.2357","created_at":"2026-05-18T04:04:06.345668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2357v2","created_at":"2026-05-18T04:04:06.345668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2357","created_at":"2026-05-18T04:04:06.345668+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7B34UAO6SPL","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7B34UAO6SPL3QRI","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7B34UAO","created_at":"2026-05-18T12:26:30.835961+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/I7B34UAO6SPL3QRI2TXQSY3W5D","json":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D.json","graph_json":"https://pith.science/api/pith-number/I7B34UAO6SPL3QRI2TXQSY3W5D/graph.json","events_json":"https://pith.science/api/pith-number/I7B34UAO6SPL3QRI2TXQSY3W5D/events.json","paper":"https://pith.science/paper/I7B34UAO"},"agent_actions":{"view_html":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D","download_json":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D.json","view_paper":"https://pith.science/paper/I7B34UAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2357&json=true","fetch_graph":"https://pith.science/api/pith-number/I7B34UAO6SPL3QRI2TXQSY3W5D/graph.json","fetch_events":"https://pith.science/api/pith-number/I7B34UAO6SPL3QRI2TXQSY3W5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/action/storage_attestation","attest_author":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/action/author_attestation","sign_citation":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/action/citation_signature","submit_replication":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/action/replication_record"}},"created_at":"2026-05-18T04:04:06.345668+00:00","updated_at":"2026-05-18T04:04:06.345668+00:00"}