{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TVAP6DI3HEWQNSQDG53GAVBNNT","short_pith_number":"pith:TVAP6DI3","schema_version":"1.0","canonical_sha256":"9d40ff0d1b392d06ca03377660542d6cce266df28fbad1b6f5c0d5ce3597a112","source":{"kind":"arxiv","id":"1104.3097","version":2},"attestation_state":"computed","paper":{"title":"On the locating chromatic number of Kneser 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-04-15T16:02:28Z","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"},"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":"1104.3097","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-15T16:02:28Z","cross_cats_sorted":[],"title_canon_sha256":"7a263dd5d9d90928e8ccc32440a6116cd715f66b38aa6c90bfabf98b90a90b0b","abstract_canon_sha256":"fbd20aa86cbeb5644fe60f655640f9db6e06122c58ea550c9ad079bbdcbd0abc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:04.008630Z","signature_b64":"mBs2th/O8acEm1zplZqWEqIDqWCcQz9S/+2HXKzPhtjRjsMouVaAhVkYzklMtC9Ext73l3YvPQBIJiq7voExAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d40ff0d1b392d06ca03377660542d6cce266df28fbad1b6f5c0d5ce3597a112","last_reissued_at":"2026-05-18T04:18:04.007991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:04.007991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the locating chromatic number of Kneser 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-04-15T16:02:28Z","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":"1104.3097","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":"1104.3097","created_at":"2026-05-18T04:18:04.008086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3097v2","created_at":"2026-05-18T04:18:04.008086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3097","created_at":"2026-05-18T04:18:04.008086+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVAP6DI3HEWQ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVAP6DI3HEWQNSQD","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVAP6DI3","created_at":"2026-05-18T12:26:42.757692+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/TVAP6DI3HEWQNSQDG53GAVBNNT","json":"https://pith.science/pith/TVAP6DI3HEWQNSQDG53GAVBNNT.json","graph_json":"https://pith.science/api/pith-number/TVAP6DI3HEWQNSQDG53GAVBNNT/graph.json","events_json":"https://pith.science/api/pith-number/TVAP6DI3HEWQNSQDG53GAVBNNT/events.json","paper":"https://pith.science/paper/TVAP6DI3"},"agent_actions":{"view_html":"https://pith.science/pith/TVAP6DI3HEWQNSQDG53GAVBNNT","download_json":"https://pith.science/pith/TVAP6DI3HEWQNSQDG53GAVBNNT.json","view_paper":"https://pith.science/paper/TVAP6DI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3097&json=true","fetch_graph":"https://pith.science/api/pith-number/TVAP6DI3HEWQNSQDG53GAVBNNT/graph.json","fetch_events":"https://pith.science/api/pith-number/TVAP6DI3HEWQNSQDG53GAVBNNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVAP6DI3HEWQNSQDG53GAVBNNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVAP6DI3HEWQNSQDG53GAVBNNT/action/storage_attestation","attest_author":"https://pith.science/pith/TVAP6DI3HEWQNSQDG53GAVBNNT/action/author_attestation","sign_citation":"https://pith.science/pith/TVAP6DI3HEWQNSQDG53GAVBNNT/action/citation_signature","submit_replication":"https://pith.science/pith/TVAP6DI3HEWQNSQDG53GAVBNNT/action/replication_record"}},"created_at":"2026-05-18T04:18:04.008086+00:00","updated_at":"2026-05-18T04:18:04.008086+00:00"}