{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KEQTPRMR7BJXXREHUVZUXAXISP","short_pith_number":"pith:KEQTPRMR","canonical_record":{"source":{"id":"1309.0641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T10:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"553f21b42f48dea17b18709166d037fad7fe053fc8586f4357c7d618ade68359","abstract_canon_sha256":"b3ad23a6b5f3bc9b1f2c1260338513018c710bc6b79723781e0db217d03d2722"},"schema_version":"1.0"},"canonical_sha256":"512137c591f8537bc487a5734b82e893ef3771a83523e852825c9a49be09db9d","source":{"kind":"arxiv","id":"1309.0641","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0641","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0641v2","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0641","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"KEQTPRMR7BJX","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KEQTPRMR7BJXXREH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KEQTPRMR","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KEQTPRMR7BJXXREHUVZUXAXISP","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T10:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"553f21b42f48dea17b18709166d037fad7fe053fc8586f4357c7d618ade68359","abstract_canon_sha256":"b3ad23a6b5f3bc9b1f2c1260338513018c710bc6b79723781e0db217d03d2722"},"schema_version":"1.0"},"canonical_sha256":"512137c591f8537bc487a5734b82e893ef3771a83523e852825c9a49be09db9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:32.859375Z","signature_b64":"jlqTDDAECdl9ZcpmranEYSwl3yCl+yG9hZXbO0PySZqg3NtdyJ468VH2thN7ydkrfdtfHtnzqE0wwlRuJO6hCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512137c591f8537bc487a5734b82e893ef3771a83523e852825c9a49be09db9d","last_reissued_at":"2026-05-18T02:27:32.858576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:32.858576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0641","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-18T02:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDDWf2o4TPbFCG0OUlwGGGLpE5BMv4pMRt5V3Y8EmxiSYDIe97vYSO6LFS4sEi3acctbnE8ELP6goYfztSDcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:25:48.704770Z"},"content_sha256":"abfb90edbaea8d3eb75b122ae275cb691e360017e5ab448e44f96b2ff86292d8","schema_version":"1.0","event_id":"sha256:abfb90edbaea8d3eb75b122ae275cb691e360017e5ab448e44f96b2ff86292d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KEQTPRMR7BJXXREHUVZUXAXISP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the metric dimension of a graph from primary subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Kuziak, I. G. Yero, J. A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2013-09-03T10:56:35Z","abstract_excerpt":"Let $G$ be a connected graph. Given an ordered set $W = \\{w_1, w_2,\\dots w_k\\}\\subseteq V(G)$ and a vertex $u\\in V(G)$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $(d(u,w_1), d(u,w_2),\\dots,$ $d(u,w_k))$, where $d(u,w_i)$ denotes the distance between $u$ and $w_i$. The set $W$ is a metric generator for $G$ if every two different vertices of $G$ have distinct representations. A minimum cardinality metric generator is called a \\emph{metric basis} of $G$ and its cardinality is called the \\emph{metric dimension} of G. It is well known that the problem of finding the met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0641","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-18T02:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vp6ZAq2MNYKs7Quu8Xv8WrX4aHWC4fCoCcPwij8kuUnpieAY9mOEXg938hBA6DmepD7yEs3NEZ9rTutk2pVXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:25:48.705134Z"},"content_sha256":"427bbadf0bfe84859087f52ecb8f8892f7ce15eebd00064b8767c551180220c4","schema_version":"1.0","event_id":"sha256:427bbadf0bfe84859087f52ecb8f8892f7ce15eebd00064b8767c551180220c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP/bundle.json","state_url":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEQTPRMR7BJXXREHUVZUXAXISP/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-02T17:25:48Z","links":{"resolver":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP","bundle":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP/bundle.json","state":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEQTPRMR7BJXXREHUVZUXAXISP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KEQTPRMR7BJXXREHUVZUXAXISP","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":"b3ad23a6b5f3bc9b1f2c1260338513018c710bc6b79723781e0db217d03d2722","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T10:56:35Z","title_canon_sha256":"553f21b42f48dea17b18709166d037fad7fe053fc8586f4357c7d618ade68359"},"schema_version":"1.0","source":{"id":"1309.0641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0641","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0641v2","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0641","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"KEQTPRMR7BJX","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KEQTPRMR7BJXXREH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KEQTPRMR","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:427bbadf0bfe84859087f52ecb8f8892f7ce15eebd00064b8767c551180220c4","target":"graph","created_at":"2026-05-18T02:27:32Z","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 $G$ be a connected graph. Given an ordered set $W = \\{w_1, w_2,\\dots w_k\\}\\subseteq V(G)$ and a vertex $u\\in V(G)$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $(d(u,w_1), d(u,w_2),\\dots,$ $d(u,w_k))$, where $d(u,w_i)$ denotes the distance between $u$ and $w_i$. The set $W$ is a metric generator for $G$ if every two different vertices of $G$ have distinct representations. A minimum cardinality metric generator is called a \\emph{metric basis} of $G$ and its cardinality is called the \\emph{metric dimension} of G. It is well known that the problem of finding the met","authors_text":"D. Kuziak, I. G. Yero, J. A. Rodr\\'iguez-Vel\\'azquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T10:56:35Z","title":"Computing the metric dimension of a graph from primary subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0641","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:abfb90edbaea8d3eb75b122ae275cb691e360017e5ab448e44f96b2ff86292d8","target":"record","created_at":"2026-05-18T02:27:32Z","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":"b3ad23a6b5f3bc9b1f2c1260338513018c710bc6b79723781e0db217d03d2722","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T10:56:35Z","title_canon_sha256":"553f21b42f48dea17b18709166d037fad7fe053fc8586f4357c7d618ade68359"},"schema_version":"1.0","source":{"id":"1309.0641","kind":"arxiv","version":2}},"canonical_sha256":"512137c591f8537bc487a5734b82e893ef3771a83523e852825c9a49be09db9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"512137c591f8537bc487a5734b82e893ef3771a83523e852825c9a49be09db9d","first_computed_at":"2026-05-18T02:27:32.858576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:32.858576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jlqTDDAECdl9ZcpmranEYSwl3yCl+yG9hZXbO0PySZqg3NtdyJ468VH2thN7ydkrfdtfHtnzqE0wwlRuJO6hCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:32.859375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abfb90edbaea8d3eb75b122ae275cb691e360017e5ab448e44f96b2ff86292d8","sha256:427bbadf0bfe84859087f52ecb8f8892f7ce15eebd00064b8767c551180220c4"],"state_sha256":"4963642791f61ac850be896b33c3c0d75c5fd48c70e3db4a2908c9f7a707aeaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsySNsiUzQNWbC14Wr7gmaztApL0jU/TJYQVkyHuUVkcz14+IY+039HF43gAET00lZEXW6kuNSvgw3n2XxtuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:25:48.707116Z","bundle_sha256":"308ef02f9d0b18a6e5f1dee05a2c851ab212df25243efbea23f40a1e9b2b75df"}}