{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JBFMVHXBJB2U3PSDJR5YSMMVXK","short_pith_number":"pith:JBFMVHXB","canonical_record":{"source":{"id":"1308.5437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-25T19:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"10710351045b705f2379efe17b8749edf3d42e4ed37a9c441ad24f349626277a","abstract_canon_sha256":"ff27cf87ec3366dfb2aedf221eda2ea1d8e5b977087673fe5dceb15b69a64372"},"schema_version":"1.0"},"canonical_sha256":"484aca9ee148754dbe434c7b893195bab9c4ea2267e61aa53821085143c21c46","source":{"kind":"arxiv","id":"1308.5437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5437","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5437v1","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5437","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"JBFMVHXBJB2U","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JBFMVHXBJB2U3PSD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JBFMVHXB","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JBFMVHXBJB2U3PSDJR5YSMMVXK","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-25T19:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"10710351045b705f2379efe17b8749edf3d42e4ed37a9c441ad24f349626277a","abstract_canon_sha256":"ff27cf87ec3366dfb2aedf221eda2ea1d8e5b977087673fe5dceb15b69a64372"},"schema_version":"1.0"},"canonical_sha256":"484aca9ee148754dbe434c7b893195bab9c4ea2267e61aa53821085143c21c46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:04.671018Z","signature_b64":"hsew0wResZZHjdmq6sskdltVDKVdeatAhXMEKSlRDqZdYQel1SgxKu8Hy3mB3Mgs73hGrVeyvL/gHbUoNx4TDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"484aca9ee148754dbe434c7b893195bab9c4ea2267e61aa53821085143c21c46","last_reissued_at":"2026-05-18T03:15:04.670049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:04.670049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5437","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-18T03:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUWg83Vy8Euhp9xXB7N+X5l4P0XdaKibEwmvBb6hJRsZas+WRp8KmfR+IQLvaqPN2jxYBaYyzHaNf5st47zBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:59:41.537530Z"},"content_sha256":"0c8f180d0f3ddb66351a55757d2fcf8d73c3a86aa62ed6866a1568094a623a9b","schema_version":"1.0","event_id":"sha256:0c8f180d0f3ddb66351a55757d2fcf8d73c3a86aa62ed6866a1568094a623a9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JBFMVHXBJB2U3PSDJR5YSMMVXK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bound for the Locating Chromatic Numbers of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Behtoei, Mahdi Anbarloei","submitted_at":"2013-08-25T19:22:18Z","abstract_excerpt":"Let $f$ be a proper $k$-coloring of a connected graph $G$ and $\\Pi=(V_1,V_2,\\ldots,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),\\ldots,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)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5437","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-18T03:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2LoUbVANWX3cgOG5DclyA4fJQpmQ3XbR3Gd2pViZNLQVErzUqg+y3B0FggsszSz97BUX7F1O56YHwOtWn2yAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:59:41.538097Z"},"content_sha256":"ea3dd490e515b85715fce501392824abe8cda9ba823c2e8a84de029b1c7c0548","schema_version":"1.0","event_id":"sha256:ea3dd490e515b85715fce501392824abe8cda9ba823c2e8a84de029b1c7c0548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBFMVHXBJB2U3PSDJR5YSMMVXK/bundle.json","state_url":"https://pith.science/pith/JBFMVHXBJB2U3PSDJR5YSMMVXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBFMVHXBJB2U3PSDJR5YSMMVXK/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:59:41Z","links":{"resolver":"https://pith.science/pith/JBFMVHXBJB2U3PSDJR5YSMMVXK","bundle":"https://pith.science/pith/JBFMVHXBJB2U3PSDJR5YSMMVXK/bundle.json","state":"https://pith.science/pith/JBFMVHXBJB2U3PSDJR5YSMMVXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBFMVHXBJB2U3PSDJR5YSMMVXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JBFMVHXBJB2U3PSDJR5YSMMVXK","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":"ff27cf87ec3366dfb2aedf221eda2ea1d8e5b977087673fe5dceb15b69a64372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-25T19:22:18Z","title_canon_sha256":"10710351045b705f2379efe17b8749edf3d42e4ed37a9c441ad24f349626277a"},"schema_version":"1.0","source":{"id":"1308.5437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5437","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5437v1","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5437","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"JBFMVHXBJB2U","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JBFMVHXBJB2U3PSD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JBFMVHXB","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:ea3dd490e515b85715fce501392824abe8cda9ba823c2e8a84de029b1c7c0548","target":"graph","created_at":"2026-05-18T03:15:04Z","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,\\ldots,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),\\ldots,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)$.","authors_text":"Ali Behtoei, Mahdi Anbarloei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-25T19:22:18Z","title":"A Bound for the Locating Chromatic Numbers of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5437","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:0c8f180d0f3ddb66351a55757d2fcf8d73c3a86aa62ed6866a1568094a623a9b","target":"record","created_at":"2026-05-18T03:15:04Z","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":"ff27cf87ec3366dfb2aedf221eda2ea1d8e5b977087673fe5dceb15b69a64372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-25T19:22:18Z","title_canon_sha256":"10710351045b705f2379efe17b8749edf3d42e4ed37a9c441ad24f349626277a"},"schema_version":"1.0","source":{"id":"1308.5437","kind":"arxiv","version":1}},"canonical_sha256":"484aca9ee148754dbe434c7b893195bab9c4ea2267e61aa53821085143c21c46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"484aca9ee148754dbe434c7b893195bab9c4ea2267e61aa53821085143c21c46","first_computed_at":"2026-05-18T03:15:04.670049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:04.670049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hsew0wResZZHjdmq6sskdltVDKVdeatAhXMEKSlRDqZdYQel1SgxKu8Hy3mB3Mgs73hGrVeyvL/gHbUoNx4TDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:04.671018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c8f180d0f3ddb66351a55757d2fcf8d73c3a86aa62ed6866a1568094a623a9b","sha256:ea3dd490e515b85715fce501392824abe8cda9ba823c2e8a84de029b1c7c0548"],"state_sha256":"12aa5d2cbb03b5eaec69ab9b2a99ca87cecc57140bb470dac9d900e6e143eea9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMLYLQXLX/xd9bTpRMPBPxXSwFY5lnGkHnNPcU7hZD3UJBPPE4TW/b7hMlJEr3XMNroSMJ9YS6yyiLKPQiwwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:59:41.540725Z","bundle_sha256":"78eccfb1edd80660183784749a3cb56fac2f3951e72a35da99003ef1e5f93742"}}