{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DMSAT42DJCO2LRTMNIKRZF6W5H","short_pith_number":"pith:DMSAT42D","schema_version":"1.0","canonical_sha256":"1b2409f343489da5c66c6a151c97d6e9e46683775cfa78a06acf6802fd0fd461","source":{"kind":"arxiv","id":"1410.7287","version":2},"attestation_state":"computed","paper":{"title":"The $k$-metric dimension of the lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Estrada-Moreno, I. G. Yero, J. A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2014-10-27T16:05:26Z","abstract_excerpt":"Given a simple and connected graph $G=(V,E)$, and a positive integer $k$, a set $S\\subseteq V$ is said to be a $k$-metric generator for $G$, if for any pair of different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,w_2,\\ldots,w_k\\in S$ such that $d_G(u,w_i)\\ne d_G(v,w_i)$, for every $i\\in \\{1,\\ldots,k\\}$, where $d_G(x,y)$ denotes the distance between $x$ and $y$. The minimum cardinality of a $k$-metric generator is the $k$-metric dimension of $G$. A set $S\\subseteq V$ is a $k$-adjacency generator for $G$ if any two different vertices $x,y\\in V(G)$ satisfy $|((N_G(x)\\triangledown"},"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":"1410.7287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T16:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"eaa945e4697085aeb674208518c9e782720e40a7fe84324d699195c59e77cc7e","abstract_canon_sha256":"20b2941bb82acff97a2a54c9adae8eb64a537e759bb8cb6e0663cb3d594a20bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:21.550832Z","signature_b64":"wta6l13LHwLC+Pt0D9vyHFQ3TE6RJgfqv2KyanFwXr1qx3BCymnmCV3twPbKbI3gO/8D+Oh/iiWRFVanyiTSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b2409f343489da5c66c6a151c97d6e9e46683775cfa78a06acf6802fd0fd461","last_reissued_at":"2026-05-18T01:29:21.550253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:21.550253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $k$-metric dimension of the lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Estrada-Moreno, I. G. Yero, J. A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2014-10-27T16:05:26Z","abstract_excerpt":"Given a simple and connected graph $G=(V,E)$, and a positive integer $k$, a set $S\\subseteq V$ is said to be a $k$-metric generator for $G$, if for any pair of different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,w_2,\\ldots,w_k\\in S$ such that $d_G(u,w_i)\\ne d_G(v,w_i)$, for every $i\\in \\{1,\\ldots,k\\}$, where $d_G(x,y)$ denotes the distance between $x$ and $y$. The minimum cardinality of a $k$-metric generator is the $k$-metric dimension of $G$. A set $S\\subseteq V$ is a $k$-adjacency generator for $G$ if any two different vertices $x,y\\in V(G)$ satisfy $|((N_G(x)\\triangledown"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7287","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":"1410.7287","created_at":"2026-05-18T01:29:21.550356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7287v2","created_at":"2026-05-18T01:29:21.550356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7287","created_at":"2026-05-18T01:29:21.550356+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMSAT42DJCO2","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMSAT42DJCO2LRTM","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMSAT42D","created_at":"2026-05-18T12:28:25.294606+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/DMSAT42DJCO2LRTMNIKRZF6W5H","json":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H.json","graph_json":"https://pith.science/api/pith-number/DMSAT42DJCO2LRTMNIKRZF6W5H/graph.json","events_json":"https://pith.science/api/pith-number/DMSAT42DJCO2LRTMNIKRZF6W5H/events.json","paper":"https://pith.science/paper/DMSAT42D"},"agent_actions":{"view_html":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H","download_json":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H.json","view_paper":"https://pith.science/paper/DMSAT42D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7287&json=true","fetch_graph":"https://pith.science/api/pith-number/DMSAT42DJCO2LRTMNIKRZF6W5H/graph.json","fetch_events":"https://pith.science/api/pith-number/DMSAT42DJCO2LRTMNIKRZF6W5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/action/storage_attestation","attest_author":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/action/author_attestation","sign_citation":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/action/citation_signature","submit_replication":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/action/replication_record"}},"created_at":"2026-05-18T01:29:21.550356+00:00","updated_at":"2026-05-18T01:29:21.550356+00:00"}