{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:I7B34UAO6SPL3QRI2TXQSY3W5D","short_pith_number":"pith:I7B34UAO","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"},"canonical_sha256":"47c3be500ef49ebdc228d4ef096376e8facf110c7b27735be2349fddee8bca8d","source":{"kind":"arxiv","id":"1112.2357","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2357","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2357v2","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2357","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"I7B34UAO6SPL","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"I7B34UAO6SPL3QRI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"I7B34UAO","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:I7B34UAO6SPL3QRI2TXQSY3W5D","target":"record","payload":{"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"},"canonical_sha256":"47c3be500ef49ebdc228d4ef096376e8facf110c7b27735be2349fddee8bca8d","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"},"source_kind":"arxiv","source_id":"1112.2357","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-05-18T04:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Y8ozDpi3L9qC/s7yQKrPJi0oh6w55iAmsWwmk2DLxAJ2xLLq0/SDb/58DU7h09IZu33jRFGslZgQv7Oz7XDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:29:05.620098Z"},"content_sha256":"959c3e6a1afd621b5a60bcb6d2e592b492363cdc11574714913347d171950d3a","schema_version":"1.0","event_id":"sha256:959c3e6a1afd621b5a60bcb6d2e592b492363cdc11574714913347d171950d3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:I7B34UAO6SPL3QRI2TXQSY3W5D","target":"graph","payload":{"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"},"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-18T04:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCJAS88RdM5LAdgE/CLCiCirh3/qswoe/enpjoJwR1X1ZOBjpfhujFV9fNADOaypNReLunX0fNbCZaKJgrFQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:29:05.620463Z"},"content_sha256":"efa5000e2d25f90e980dbf0c9c8b15b89f7eea70c12ccc8c0e5f286fd462ac92","schema_version":"1.0","event_id":"sha256:efa5000e2d25f90e980dbf0c9c8b15b89f7eea70c12ccc8c0e5f286fd462ac92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/bundle.json","state_url":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/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:29:05Z","links":{"resolver":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D","bundle":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/bundle.json","state":"https://pith.science/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7B34UAO6SPL3QRI2TXQSY3W5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:I7B34UAO6SPL3QRI2TXQSY3W5D","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":"00c7cce8a0699cacea0f1d2ac79e450c28cc45ca75626bb430f529b2bcd496ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-11T14:13:06Z","title_canon_sha256":"12508aa96e540b26b025abd5a3f5817dfac78c3682c1276dfbe0190f8641973a"},"schema_version":"1.0","source":{"id":"1112.2357","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2357","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2357v2","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2357","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"I7B34UAO6SPL","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"I7B34UAO6SPL3QRI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"I7B34UAO","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:efa5000e2d25f90e980dbf0c9c8b15b89f7eea70c12ccc8c0e5f286fd462ac92","target":"graph","created_at":"2026-05-18T04:04:06Z","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 $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","authors_text":"Ali Behtoei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-11T14:13:06Z","title":"The Locating Chromatic Number of the Join of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2357","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:959c3e6a1afd621b5a60bcb6d2e592b492363cdc11574714913347d171950d3a","target":"record","created_at":"2026-05-18T04:04:06Z","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":"00c7cce8a0699cacea0f1d2ac79e450c28cc45ca75626bb430f529b2bcd496ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-11T14:13:06Z","title_canon_sha256":"12508aa96e540b26b025abd5a3f5817dfac78c3682c1276dfbe0190f8641973a"},"schema_version":"1.0","source":{"id":"1112.2357","kind":"arxiv","version":2}},"canonical_sha256":"47c3be500ef49ebdc228d4ef096376e8facf110c7b27735be2349fddee8bca8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47c3be500ef49ebdc228d4ef096376e8facf110c7b27735be2349fddee8bca8d","first_computed_at":"2026-05-18T04:04:06.345604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:06.345604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MpVxUQA6vGWiM3ASdGiQj8Ii6Jwxgr+lD6QNMFo2wM7QKGEKdSkq1fn+kzcjc5NeLdSGH27tyRo/VsV6MuUSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:06.346100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2357","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:959c3e6a1afd621b5a60bcb6d2e592b492363cdc11574714913347d171950d3a","sha256:efa5000e2d25f90e980dbf0c9c8b15b89f7eea70c12ccc8c0e5f286fd462ac92"],"state_sha256":"f37295ee5282a3a0f8b6c18a9cc8f0c63e30c6a72c5d9418d168c98c522f8b41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbd+dDVACil4+VvsCVS5VpAzWMi7BJLjn0HitzzfmqwGlemNQaCcobORUnMiUDC+B04ZxJMIOpaWsakH7OHlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:29:05.622723Z","bundle_sha256":"7f1d77797b87c938532eef55339a1143d06aa109e08d97430ad4e9c39278326f"}}