{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OXCTMZ66OWVEILIQ6TNLYIDZBC","short_pith_number":"pith:OXCTMZ66","schema_version":"1.0","canonical_sha256":"75c53667de75aa442d10f4dabc207908a453ed3e1081211c7fa829b4cd432df9","source":{"kind":"arxiv","id":"1204.0495","version":2},"attestation_state":"computed","paper":{"title":"On the strong metric dimension of corona product graphs and join graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dorota Kuziak, Ismael G. Yero, Juan A. Rodriguez-Velazquez","submitted_at":"2012-04-02T18:49:01Z","abstract_excerpt":"Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving set for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $W$. The smallest cardinality of a strong resolving set for $G$ is called the strong metric dimension of $G$. It is known that the problem of computing this invariant is NP-hard. It is therefore desirable to reduce the problem of computing the strong metric dimension of produ"},"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":"1204.0495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T18:49:01Z","cross_cats_sorted":[],"title_canon_sha256":"bf724b905a7a60df2cf507f5c262697b196f9821321e2c56014f444f13e6c935","abstract_canon_sha256":"60f37ed1777685763857292007064f1f13318dfb53e6985c1bd2dc6cccd7b223"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:03.745307Z","signature_b64":"zsuClyzdeOiFIX0RRdkmDfjI6mEkmlMkjwfPZxCTEWIiA3FHcpFrwDQNPw15+gfDrmMC25AiScX4KPlw09zBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75c53667de75aa442d10f4dabc207908a453ed3e1081211c7fa829b4cd432df9","last_reissued_at":"2026-05-18T03:06:03.744586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:03.744586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the strong metric dimension of corona product graphs and join graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dorota Kuziak, Ismael G. Yero, Juan A. Rodriguez-Velazquez","submitted_at":"2012-04-02T18:49:01Z","abstract_excerpt":"Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving set for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $W$. The smallest cardinality of a strong resolving set for $G$ is called the strong metric dimension of $G$. It is known that the problem of computing this invariant is NP-hard. It is therefore desirable to reduce the problem of computing the strong metric dimension of produ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0495","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":"1204.0495","created_at":"2026-05-18T03:06:03.744716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0495v2","created_at":"2026-05-18T03:06:03.744716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0495","created_at":"2026-05-18T03:06:03.744716+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXCTMZ66OWVE","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXCTMZ66OWVEILIQ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXCTMZ66","created_at":"2026-05-18T12:27:16.716162+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/OXCTMZ66OWVEILIQ6TNLYIDZBC","json":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC.json","graph_json":"https://pith.science/api/pith-number/OXCTMZ66OWVEILIQ6TNLYIDZBC/graph.json","events_json":"https://pith.science/api/pith-number/OXCTMZ66OWVEILIQ6TNLYIDZBC/events.json","paper":"https://pith.science/paper/OXCTMZ66"},"agent_actions":{"view_html":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC","download_json":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC.json","view_paper":"https://pith.science/paper/OXCTMZ66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0495&json=true","fetch_graph":"https://pith.science/api/pith-number/OXCTMZ66OWVEILIQ6TNLYIDZBC/graph.json","fetch_events":"https://pith.science/api/pith-number/OXCTMZ66OWVEILIQ6TNLYIDZBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/action/storage_attestation","attest_author":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/action/author_attestation","sign_citation":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/action/citation_signature","submit_replication":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/action/replication_record"}},"created_at":"2026-05-18T03:06:03.744716+00:00","updated_at":"2026-05-18T03:06:03.744716+00:00"}