{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FOJHXHTT7TM25L4VDSNWZBYMUC","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":"688ca48be773d51bbd1188e199e92d5513cb6f9210fcedbd17db23e7515eb175","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-07T17:09:57Z","title_canon_sha256":"a9f556303caebce9602b8aeca6edb6c51eb14d0fc86f905a642e7c8594968a6e"},"schema_version":"1.0","source":{"id":"1712.02723","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02723","created_at":"2026-05-17T23:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02723v2","created_at":"2026-05-17T23:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02723","created_at":"2026-05-17T23:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"FOJHXHTT7TM2","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOJHXHTT7TM25L4V","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOJHXHTT","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:5166c8e1114819e1068b7d2a58067b42bd6a34ab3ae9d42185b01ff119e96d0f","target":"graph","created_at":"2026-05-17T23:50:50Z","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":"A set of vertices $S$ resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected graph $G$ on $q \\ge 2$ vertices, and let $M$ be the distance matrix of $G$. We prove that if there exists $w \\in \\mathbb{Z}^q$ such that $\\sum_i w_i = 0$ and the vector $Mw$, after sorting its coordinates, is an arithmetic progression with nonzero common difference, then the metric dimension of the Cartesian product of $n$ copies of $G$ is $(2+o(1))n/\\log_q n$.","authors_text":"Nikita Polyanskii, Zilin Jiang","cross_cats":["cs.DM","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-07T17:09:57Z","title":"On the metric dimension of Cartesian powers of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02723","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:eda98c7ae093326c8610d4ca2b938359ec1c9a54c8a1250732452d777a69f162","target":"record","created_at":"2026-05-17T23:50:50Z","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":"688ca48be773d51bbd1188e199e92d5513cb6f9210fcedbd17db23e7515eb175","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-07T17:09:57Z","title_canon_sha256":"a9f556303caebce9602b8aeca6edb6c51eb14d0fc86f905a642e7c8594968a6e"},"schema_version":"1.0","source":{"id":"1712.02723","kind":"arxiv","version":2}},"canonical_sha256":"2b927b9e73fcd9aeaf951c9b6c870ca0897322a5385b2f9efdbbcb515c93f8c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b927b9e73fcd9aeaf951c9b6c870ca0897322a5385b2f9efdbbcb515c93f8c2","first_computed_at":"2026-05-17T23:50:50.651037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:50.651037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hexX8O6JX56sS9SdMUKfilYuft49iqFbJV82poZpqZT7/O4RTymplTCE6RUmCf5W1hI++o8rLAaFc1nZg3PPAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:50.651693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02723","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eda98c7ae093326c8610d4ca2b938359ec1c9a54c8a1250732452d777a69f162","sha256:5166c8e1114819e1068b7d2a58067b42bd6a34ab3ae9d42185b01ff119e96d0f"],"state_sha256":"0de947ff1afc2920c8427357d36048ac314cd381fcb6d2d33b42d6da37894f0e"}