{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6DTRAGJP6FD6KO2O57Q2TOFRRL","short_pith_number":"pith:6DTRAGJP","schema_version":"1.0","canonical_sha256":"f0e710192ff147e53b4eefe1a9b8b18ac5126aa4ec2b7381a6402bc283212b36","source":{"kind":"arxiv","id":"1805.04966","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.04966","created_at":"2026-05-18T00:05:38.970793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04966v2","created_at":"2026-05-18T00:05:38.970793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04966","created_at":"2026-05-18T00:05:38.970793+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DTRAGJP6FD6","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DTRAGJP6FD6KO2O","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DTRAGJP","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL","json":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL.json","graph_json":"https://pith.science/api/pith-number/6DTRAGJP6FD6KO2O57Q2TOFRRL/graph.json","events_json":"https://pith.science/api/pith-number/6DTRAGJP6FD6KO2O57Q2TOFRRL/events.json","paper":"https://pith.science/paper/6DTRAGJP"},"agent_actions":{"view_html":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL","download_json":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL.json","view_paper":"https://pith.science/paper/6DTRAGJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04966&json=true","fetch_graph":"https://pith.science/api/pith-number/6DTRAGJP6FD6KO2O57Q2TOFRRL/graph.json","fetch_events":"https://pith.science/api/pith-number/6DTRAGJP6FD6KO2O57Q2TOFRRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/action/storage_attestation","attest_author":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/action/author_attestation","sign_citation":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/action/citation_signature","submit_replication":"https://pith.science/pith/6DTRAGJP6FD6KO2O57Q2TOFRRL/action/replication_record"}},"created_at":"2026-05-18T00:05:38.970793+00:00","updated_at":"2026-05-18T00:05:38.970793+00:00"}