{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CWKZY6LHQJYHBAH7GCSOTRDEOU","short_pith_number":"pith:CWKZY6LH","canonical_record":{"source":{"id":"1611.04292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T09:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"749844d612f34c82d39d480ba703ccfaffdbac0a5c0a9114bb4410c11fff5525","abstract_canon_sha256":"04dfb2681a01e1909b80c547d7256499fc2eec67d338a62e859013dc28c70233"},"schema_version":"1.0"},"canonical_sha256":"15959c796782707080ff30a4e9c464751d33f00429bb84c46766a122696578f3","source":{"kind":"arxiv","id":"1611.04292","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04292","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04292v2","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04292","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"pith_short_12","alias_value":"CWKZY6LHQJYH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CWKZY6LHQJYHBAH7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CWKZY6LH","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CWKZY6LHQJYHBAH7GCSOTRDEOU","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T09:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"749844d612f34c82d39d480ba703ccfaffdbac0a5c0a9114bb4410c11fff5525","abstract_canon_sha256":"04dfb2681a01e1909b80c547d7256499fc2eec67d338a62e859013dc28c70233"},"schema_version":"1.0"},"canonical_sha256":"15959c796782707080ff30a4e9c464751d33f00429bb84c46766a122696578f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:45.084208Z","signature_b64":"6+qeM+7XlCBuh7kLHLI7sjvH8baBFPmqCfZwF5JpKrMCtZVuW+KZKWXaEVsQ86rfWY62YmXYW9ZqEgPvENNKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15959c796782707080ff30a4e9c464751d33f00429bb84c46766a122696578f3","last_reissued_at":"2026-05-18T00:56:45.083512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:45.083512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04292","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-18T00:56:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xGCZi0mWs3anuqZxbMaVBYm9ikwsUgJ28TLqOhD+RnQCI2BNcA2sb87Fknu7y8oDBlSxyZnvZ5vTlVQegEuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:38:33.747825Z"},"content_sha256":"a8f0fe4e9cb9511a8c2956349050dca2fd5a98c09e92b85ef4b006b93a157cd2","schema_version":"1.0","event_id":"sha256:a8f0fe4e9cb9511a8c2956349050dca2fd5a98c09e92b85ef4b006b93a157cd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CWKZY6LHQJYHBAH7GCSOTRDEOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixed metric dimension of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksander Kelenc, Andrej Taranenko, Dorota Kuziak, Ismael G. Yero","submitted_at":"2016-11-14T09:13:09Z","abstract_excerpt":"Let $G=(V,E)$ be a connected graph. A vertex $w\\in V$ distinguishes two elements (vertices or edges) $x,y\\in E\\cup V$ if $d_G(w,x)\\ne d_G(w,y)$. A set $S$ of vertices in a connected graph $G$ is a mixed metric generator for $G$ if every two elements (vertices or edges) of $G$ are distinguished by some vertex of $S$. The smallest cardinality of a mixed metric generator for $G$ is called the mixed metric dimension and is denoted by $\\mathrm{mdim}(G)$. In this paper we consider the structure of mixed metric generators and characterize graphs for which the mixed metric dimension equals the trivial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04292","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-18T00:56:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z55CjJij/s9SM7XnXIjz/lPSuC6UBnnwcldxi5pgRjocQPx83C/Ykm7kzDhDVIqgLKMQ3zJH8V2RhRPY8WXHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:38:33.748172Z"},"content_sha256":"cc68ef475453bd766892d0b333692bfac3f6b39cd10215634d2ba34b65ca2025","schema_version":"1.0","event_id":"sha256:cc68ef475453bd766892d0b333692bfac3f6b39cd10215634d2ba34b65ca2025"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWKZY6LHQJYHBAH7GCSOTRDEOU/bundle.json","state_url":"https://pith.science/pith/CWKZY6LHQJYHBAH7GCSOTRDEOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWKZY6LHQJYHBAH7GCSOTRDEOU/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-03T06:38:33Z","links":{"resolver":"https://pith.science/pith/CWKZY6LHQJYHBAH7GCSOTRDEOU","bundle":"https://pith.science/pith/CWKZY6LHQJYHBAH7GCSOTRDEOU/bundle.json","state":"https://pith.science/pith/CWKZY6LHQJYHBAH7GCSOTRDEOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWKZY6LHQJYHBAH7GCSOTRDEOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CWKZY6LHQJYHBAH7GCSOTRDEOU","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":"04dfb2681a01e1909b80c547d7256499fc2eec67d338a62e859013dc28c70233","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T09:13:09Z","title_canon_sha256":"749844d612f34c82d39d480ba703ccfaffdbac0a5c0a9114bb4410c11fff5525"},"schema_version":"1.0","source":{"id":"1611.04292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04292","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04292v2","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04292","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"pith_short_12","alias_value":"CWKZY6LHQJYH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CWKZY6LHQJYHBAH7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CWKZY6LH","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:cc68ef475453bd766892d0b333692bfac3f6b39cd10215634d2ba34b65ca2025","target":"graph","created_at":"2026-05-18T00:56:45Z","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=(V,E)$ be a connected graph. A vertex $w\\in V$ distinguishes two elements (vertices or edges) $x,y\\in E\\cup V$ if $d_G(w,x)\\ne d_G(w,y)$. A set $S$ of vertices in a connected graph $G$ is a mixed metric generator for $G$ if every two elements (vertices or edges) of $G$ are distinguished by some vertex of $S$. The smallest cardinality of a mixed metric generator for $G$ is called the mixed metric dimension and is denoted by $\\mathrm{mdim}(G)$. In this paper we consider the structure of mixed metric generators and characterize graphs for which the mixed metric dimension equals the trivial","authors_text":"Aleksander Kelenc, Andrej Taranenko, Dorota Kuziak, Ismael G. Yero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T09:13:09Z","title":"Mixed metric dimension of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04292","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:a8f0fe4e9cb9511a8c2956349050dca2fd5a98c09e92b85ef4b006b93a157cd2","target":"record","created_at":"2026-05-18T00:56:45Z","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":"04dfb2681a01e1909b80c547d7256499fc2eec67d338a62e859013dc28c70233","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T09:13:09Z","title_canon_sha256":"749844d612f34c82d39d480ba703ccfaffdbac0a5c0a9114bb4410c11fff5525"},"schema_version":"1.0","source":{"id":"1611.04292","kind":"arxiv","version":2}},"canonical_sha256":"15959c796782707080ff30a4e9c464751d33f00429bb84c46766a122696578f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15959c796782707080ff30a4e9c464751d33f00429bb84c46766a122696578f3","first_computed_at":"2026-05-18T00:56:45.083512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:45.083512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6+qeM+7XlCBuh7kLHLI7sjvH8baBFPmqCfZwF5JpKrMCtZVuW+KZKWXaEVsQ86rfWY62YmXYW9ZqEgPvENNKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:45.084208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8f0fe4e9cb9511a8c2956349050dca2fd5a98c09e92b85ef4b006b93a157cd2","sha256:cc68ef475453bd766892d0b333692bfac3f6b39cd10215634d2ba34b65ca2025"],"state_sha256":"303a78061f8ecc7de974e896762bd2f96e77396a69d251d61da3f54536622844"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9+jDGKypVD8NvlQuyrK/fAAGklIVq/GoHx42MyrKqPZFFpXcJl0JEDFbPvniEvVwY20dEmVSyNFpxcmQvLoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:38:33.750128Z","bundle_sha256":"09781322e978859fc073dc2557257ceb9afd5af9cb92472d68008be200691737"}}