{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6DTRAGJP6FD6KO2O57Q2TOFRRL","short_pith_number":"pith:6DTRAGJP","canonical_record":{"source":{"id":"1805.04966","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-13T22:33:23Z","cross_cats_sorted":[],"title_canon_sha256":"fd5a614eb8f5f6a04e7b3f12a7d84270a912ca2be8a954dc825e51a09e67ae4c","abstract_canon_sha256":"8a5408bdc818fd8d1db3f6890d92135444f0d13d20901a6f8b48eb3bd92e849e"},"schema_version":"1.0"},"canonical_sha256":"f0e710192ff147e53b4eefe1a9b8b18ac5126aa4ec2b7381a6402bc283212b36","source":{"kind":"arxiv","id":"1805.04966","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04966","created_at":"2026-05-18T00:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04966v2","created_at":"2026-05-18T00:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04966","created_at":"2026-05-18T00:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"6DTRAGJP6FD6","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6DTRAGJP6FD6KO2O","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6DTRAGJP","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6DTRAGJP6FD6KO2O57Q2TOFRRL","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04966","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-13T22:33:23Z","cross_cats_sorted":[],"title_canon_sha256":"fd5a614eb8f5f6a04e7b3f12a7d84270a912ca2be8a954dc825e51a09e67ae4c","abstract_canon_sha256":"8a5408bdc818fd8d1db3f6890d92135444f0d13d20901a6f8b48eb3bd92e849e"},"schema_version":"1.0"},"canonical_sha256":"f0e710192ff147e53b4eefe1a9b8b18ac5126aa4ec2b7381a6402bc283212b36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:38.971565Z","signature_b64":"QQ8idB/guu2NY++rEcmwxXoWeCoys0sU+VkZ4jeO/9mgzktUBPaw3VLRMEhOm6hvzrr0ItLciguJn0mwaqw1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0e710192ff147e53b4eefe1a9b8b18ac5126aa4ec2b7381a6402bc283212b36","last_reissued_at":"2026-05-18T00:05:38.970712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:38.970712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04966","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:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCxfN6+dDmfzVF3ClkxSdNIRAZmxgmErOMEa2h0AdP+c2ShFM+XBkjzJtFXjZy9EW2femaPNkqDpgZzQvxB3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:16:30.697735Z"},"content_sha256":"5f291bc9ace56a598e7c6ab9ea06dadec127f573b8c5808d410dd2fd72d68119","schema_version":"1.0","event_id":"sha256:5f291bc9ace56a598e7c6ab9ea06dadec127f573b8c5808d410dd2fd72d68119"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6DTRAGJP6FD6KO2O57Q2TOFRRL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the $k$-partition dimension of graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alejandro Estrada-Moreno","submitted_at":"2018-05-13T22:33:23Z","abstract_excerpt":"As a generalization of the concept of the partition dimension of a graph, this article introduces the notion of the $k$-partition dimension. Given a nontrivial connected graph $G=(V,E)$, a partition $\\Pi$ of $V$ is said to be a $k$-partition generator for $G$ if any pair of different vertices $u,v\\in V$ is distinguished by at least $k$ vertex sets of $\\Pi$, \\emph{i.e}., there exist at least $k$ vertex sets $S_1,\\ldots,S_k\\in\\Pi$ such that $d(u,S_i)\\ne d(v,S_i)$ for every $i\\in\\{1,\\ldots,k\\}$. A $k$-partition generator for $G$ with minimum cardinality among all their $k$-partition generators is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04966","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:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yO8UMtnRWaIMLXK34cofBImGV5yiagiY3+Oxmm4txzOGpijz/Goc8CCO+nJVU/nIz//ZPDe/DXaTbgtyk6MaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:16:30.698086Z"},"content_sha256":"3fdbb5cf55c63cd4dd3ed041831870c77496b6f47bf1c665975450d48b830bee","schema_version":"1.0","event_id":"sha256:3fdbb5cf55c63cd4dd3ed041831870c77496b6f47bf1c665975450d48b830bee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/bundle.json","state_url":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/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-23T02:16:30Z","links":{"resolver":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL","bundle":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/bundle.json","state":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6DTRAGJP6FD6KO2O57Q2TOFRRL","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":"8a5408bdc818fd8d1db3f6890d92135444f0d13d20901a6f8b48eb3bd92e849e","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-13T22:33:23Z","title_canon_sha256":"fd5a614eb8f5f6a04e7b3f12a7d84270a912ca2be8a954dc825e51a09e67ae4c"},"schema_version":"1.0","source":{"id":"1805.04966","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04966","created_at":"2026-05-18T00:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04966v2","created_at":"2026-05-18T00:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04966","created_at":"2026-05-18T00:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"6DTRAGJP6FD6","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6DTRAGJP6FD6KO2O","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6DTRAGJP","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:3fdbb5cf55c63cd4dd3ed041831870c77496b6f47bf1c665975450d48b830bee","target":"graph","created_at":"2026-05-18T00:05:38Z","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":"As a generalization of the concept of the partition dimension of a graph, this article introduces the notion of the $k$-partition dimension. Given a nontrivial connected graph $G=(V,E)$, a partition $\\Pi$ of $V$ is said to be a $k$-partition generator for $G$ if any pair of different vertices $u,v\\in V$ is distinguished by at least $k$ vertex sets of $\\Pi$, \\emph{i.e}., there exist at least $k$ vertex sets $S_1,\\ldots,S_k\\in\\Pi$ such that $d(u,S_i)\\ne d(v,S_i)$ for every $i\\in\\{1,\\ldots,k\\}$. A $k$-partition generator for $G$ with minimum cardinality among all their $k$-partition generators is","authors_text":"Alejandro Estrada-Moreno","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-13T22:33:23Z","title":"On the $k$-partition dimension of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04966","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:5f291bc9ace56a598e7c6ab9ea06dadec127f573b8c5808d410dd2fd72d68119","target":"record","created_at":"2026-05-18T00:05:38Z","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":"8a5408bdc818fd8d1db3f6890d92135444f0d13d20901a6f8b48eb3bd92e849e","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-13T22:33:23Z","title_canon_sha256":"fd5a614eb8f5f6a04e7b3f12a7d84270a912ca2be8a954dc825e51a09e67ae4c"},"schema_version":"1.0","source":{"id":"1805.04966","kind":"arxiv","version":2}},"canonical_sha256":"f0e710192ff147e53b4eefe1a9b8b18ac5126aa4ec2b7381a6402bc283212b36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0e710192ff147e53b4eefe1a9b8b18ac5126aa4ec2b7381a6402bc283212b36","first_computed_at":"2026-05-18T00:05:38.970712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:38.970712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QQ8idB/guu2NY++rEcmwxXoWeCoys0sU+VkZ4jeO/9mgzktUBPaw3VLRMEhOm6hvzrr0ItLciguJn0mwaqw1Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:38.971565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04966","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f291bc9ace56a598e7c6ab9ea06dadec127f573b8c5808d410dd2fd72d68119","sha256:3fdbb5cf55c63cd4dd3ed041831870c77496b6f47bf1c665975450d48b830bee"],"state_sha256":"943ca4504d6a27f4d0247985c10b518b718eaafc3a93d7ae5a9324ac23fee798"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bqh7jdrVauJzZdtsZA5fRL5W7k8OtrU6zgyeX0w/h6C/L4SpXUAQ3AAJXGyLrwwTWx4C9IFP5ti3DmLOWsO7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:16:30.701202Z","bundle_sha256":"67cfda06037c12e50f84f9c73789e49223188d9b84cacc8df7d108b15c1073a3"}}