{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IYE3DNYNPH2CND42V6TZPXHBOG","short_pith_number":"pith:IYE3DNYN","schema_version":"1.0","canonical_sha256":"4609b1b70d79f4268f9aafa797dce171860a48a0b05861d542ef792e8e79ab9e","source":{"kind":"arxiv","id":"1408.2154","version":2},"attestation_state":"computed","paper":{"title":"k-Metric Antidimension: a Privacy Measure for Social Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Rolando Trujillo-Rasua","submitted_at":"2014-08-09T21:08:48Z","abstract_excerpt":"Let $G = (V, E)$ be a simple connected graph and $S = \\{w_1, \\cdots, w_t\\} \\subseteq V$ an ordered subset of vertices. The metric representation of a vertex $u\\in V$ with respect to $S$ is the $t$-vector $r(u|S) = (d_G(u, w_1), \\cdots, d_G(u, w_t))$, where $d_G(u, v)$ represents the length of a shortest $u-v$ path in $G$. The set $S$ is called a resolving set for $G$ if $r(u|S) = r(v|S)$ implies $u = v$ for every $u, v \\in V$. The smallest cardinality of a resolving set is the metric dimension of $G$. In this article we propose, to the best of our knowledge, a new problem in Graph Theory that "},"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":"1408.2154","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-09T21:08:48Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c5aec868f260896328919ea80fcf9fd6c6bccf08b0730cf9d291748248c437af","abstract_canon_sha256":"3705c6189e641e265622d91cb49bd4410d4902ed84c31cdb2fda042a8e4082ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:40.042929Z","signature_b64":"uDzyc6oF8/OCsqBE4wE9rQulmRvD4Ij1T7bFY9ZdElvUR2Tvm6HGxZ8kUw/dR2wIiE1ppV4BXPcVfTkwcHY+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4609b1b70d79f4268f9aafa797dce171860a48a0b05861d542ef792e8e79ab9e","last_reissued_at":"2026-05-18T02:20:40.042329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:40.042329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-Metric Antidimension: a Privacy Measure for Social Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Rolando Trujillo-Rasua","submitted_at":"2014-08-09T21:08:48Z","abstract_excerpt":"Let $G = (V, E)$ be a simple connected graph and $S = \\{w_1, \\cdots, w_t\\} \\subseteq V$ an ordered subset of vertices. The metric representation of a vertex $u\\in V$ with respect to $S$ is the $t$-vector $r(u|S) = (d_G(u, w_1), \\cdots, d_G(u, w_t))$, where $d_G(u, v)$ represents the length of a shortest $u-v$ path in $G$. The set $S$ is called a resolving set for $G$ if $r(u|S) = r(v|S)$ implies $u = v$ for every $u, v \\in V$. The smallest cardinality of a resolving set is the metric dimension of $G$. In this article we propose, to the best of our knowledge, a new problem in Graph Theory that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2154","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":"1408.2154","created_at":"2026-05-18T02:20:40.042409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2154v2","created_at":"2026-05-18T02:20:40.042409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2154","created_at":"2026-05-18T02:20:40.042409+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYE3DNYNPH2C","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYE3DNYNPH2CND42","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYE3DNYN","created_at":"2026-05-18T12:28:33.132498+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/IYE3DNYNPH2CND42V6TZPXHBOG","json":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG.json","graph_json":"https://pith.science/api/pith-number/IYE3DNYNPH2CND42V6TZPXHBOG/graph.json","events_json":"https://pith.science/api/pith-number/IYE3DNYNPH2CND42V6TZPXHBOG/events.json","paper":"https://pith.science/paper/IYE3DNYN"},"agent_actions":{"view_html":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG","download_json":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG.json","view_paper":"https://pith.science/paper/IYE3DNYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2154&json=true","fetch_graph":"https://pith.science/api/pith-number/IYE3DNYNPH2CND42V6TZPXHBOG/graph.json","fetch_events":"https://pith.science/api/pith-number/IYE3DNYNPH2CND42V6TZPXHBOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG/action/storage_attestation","attest_author":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG/action/author_attestation","sign_citation":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG/action/citation_signature","submit_replication":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG/action/replication_record"}},"created_at":"2026-05-18T02:20:40.042409+00:00","updated_at":"2026-05-18T02:20:40.042409+00:00"}