{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CZW5REENBZBWLYYPDQSPEEQRBI","short_pith_number":"pith:CZW5REEN","schema_version":"1.0","canonical_sha256":"166dd8908d0e4365e30f1c24f212110a25cf8c15e7c69634ad39d969c5e70f92","source":{"kind":"arxiv","id":"1509.01796","version":1},"attestation_state":"computed","paper":{"title":"On the strong metric dimension of Cartesian sum 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. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2015-09-06T11:25:38Z","abstract_excerpt":"A vertex $w$ of a connected graph $G$ strongly resolves two vertices $u,v\\in V(G)$, if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $S$. The smallest cardinality of a strong metric generator for $G$ is called the strong metric dimension of $G$. In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the strong metric dimension, cliq"},"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":"1509.01796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-06T11:25:38Z","cross_cats_sorted":[],"title_canon_sha256":"53c9ae6aa39dcb5f9a809b7edc20231c1481ef8ac79e03a3f0efde2f4fbb3381","abstract_canon_sha256":"27347798eda79190b0c9c2fc624e82e66a4ef49da954f44ce868f7327ad7fa83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:50.541001Z","signature_b64":"V5vAgytf9kIx8UEqlS+oZikBNRbDUXmK4dTG5dL2viJ1QAACdee2b1KkIA0risjXa+uw0FRI5wzM9ee4cIzHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"166dd8908d0e4365e30f1c24f212110a25cf8c15e7c69634ad39d969c5e70f92","last_reissued_at":"2026-05-18T01:33:50.540396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:50.540396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the strong metric dimension of Cartesian sum 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. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2015-09-06T11:25:38Z","abstract_excerpt":"A vertex $w$ of a connected graph $G$ strongly resolves two vertices $u,v\\in V(G)$, if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $S$. The smallest cardinality of a strong metric generator for $G$ is called the strong metric dimension of $G$. In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the strong metric dimension, cliq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01796","kind":"arxiv","version":1},"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":"1509.01796","created_at":"2026-05-18T01:33:50.540498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01796v1","created_at":"2026-05-18T01:33:50.540498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01796","created_at":"2026-05-18T01:33:50.540498+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZW5REENBZBW","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZW5REENBZBWLYYP","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZW5REEN","created_at":"2026-05-18T12:29:17.054201+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/CZW5REENBZBWLYYPDQSPEEQRBI","json":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI.json","graph_json":"https://pith.science/api/pith-number/CZW5REENBZBWLYYPDQSPEEQRBI/graph.json","events_json":"https://pith.science/api/pith-number/CZW5REENBZBWLYYPDQSPEEQRBI/events.json","paper":"https://pith.science/paper/CZW5REEN"},"agent_actions":{"view_html":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI","download_json":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI.json","view_paper":"https://pith.science/paper/CZW5REEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01796&json=true","fetch_graph":"https://pith.science/api/pith-number/CZW5REENBZBWLYYPDQSPEEQRBI/graph.json","fetch_events":"https://pith.science/api/pith-number/CZW5REENBZBWLYYPDQSPEEQRBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI/action/storage_attestation","attest_author":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI/action/author_attestation","sign_citation":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI/action/citation_signature","submit_replication":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI/action/replication_record"}},"created_at":"2026-05-18T01:33:50.540498+00:00","updated_at":"2026-05-18T01:33:50.540498+00:00"}