{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CZW5REENBZBWLYYPDQSPEEQRBI","short_pith_number":"pith:CZW5REEN","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"},"canonical_sha256":"166dd8908d0e4365e30f1c24f212110a25cf8c15e7c69634ad39d969c5e70f92","source":{"kind":"arxiv","id":"1509.01796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01796","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01796v1","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01796","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"pith_short_12","alias_value":"CZW5REENBZBW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CZW5REENBZBWLYYP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CZW5REEN","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CZW5REENBZBWLYYPDQSPEEQRBI","target":"record","payload":{"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"},"canonical_sha256":"166dd8908d0e4365e30f1c24f212110a25cf8c15e7c69634ad39d969c5e70f92","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"},"source_kind":"arxiv","source_id":"1509.01796","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxakOMJgtGB2VAG8IBQxohyc+oRhvjkHoCySWh4eVSbIGa45l2RPhS9V7Bkysczo4NTjVWuYrdEMfPSzfH1nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:43:40.557929Z"},"content_sha256":"a800150da25720392adf6404fa7911d46a2877b58952fec1da17d94ef952df7b","schema_version":"1.0","event_id":"sha256:a800150da25720392adf6404fa7911d46a2877b58952fec1da17d94ef952df7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CZW5REENBZBWLYYPDQSPEEQRBI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ntMk1MdNAkgh1Az6t+aOW+5+2ojZvl1ewvsezR7k6RqOO9dH+6VIkJa+NMJ8NHDUelEMCf3tc/jpVSCw74hbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:43:40.558272Z"},"content_sha256":"a274c171286f0acdf8216add8b217e1eb26c4df93916153e37a119523def0025","schema_version":"1.0","event_id":"sha256:a274c171286f0acdf8216add8b217e1eb26c4df93916153e37a119523def0025"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI/bundle.json","state_url":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZW5REENBZBWLYYPDQSPEEQRBI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T04:43:40Z","links":{"resolver":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI","bundle":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI/bundle.json","state":"https://pith.science/pith/CZW5REENBZBWLYYPDQSPEEQRBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZW5REENBZBWLYYPDQSPEEQRBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CZW5REENBZBWLYYPDQSPEEQRBI","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":"27347798eda79190b0c9c2fc624e82e66a4ef49da954f44ce868f7327ad7fa83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-06T11:25:38Z","title_canon_sha256":"53c9ae6aa39dcb5f9a809b7edc20231c1481ef8ac79e03a3f0efde2f4fbb3381"},"schema_version":"1.0","source":{"id":"1509.01796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01796","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01796v1","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01796","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"pith_short_12","alias_value":"CZW5REENBZBW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CZW5REENBZBWLYYP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CZW5REEN","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:a274c171286f0acdf8216add8b217e1eb26c4df93916153e37a119523def0025","target":"graph","created_at":"2026-05-18T01:33: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 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","authors_text":"Dorota Kuziak, Ismael G. Yero, Juan A. Rodr\\'iguez-Vel\\'azquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-06T11:25:38Z","title":"On the strong metric dimension of Cartesian sum graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01796","kind":"arxiv","version":1},"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:a800150da25720392adf6404fa7911d46a2877b58952fec1da17d94ef952df7b","target":"record","created_at":"2026-05-18T01:33: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":"27347798eda79190b0c9c2fc624e82e66a4ef49da954f44ce868f7327ad7fa83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-06T11:25:38Z","title_canon_sha256":"53c9ae6aa39dcb5f9a809b7edc20231c1481ef8ac79e03a3f0efde2f4fbb3381"},"schema_version":"1.0","source":{"id":"1509.01796","kind":"arxiv","version":1}},"canonical_sha256":"166dd8908d0e4365e30f1c24f212110a25cf8c15e7c69634ad39d969c5e70f92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"166dd8908d0e4365e30f1c24f212110a25cf8c15e7c69634ad39d969c5e70f92","first_computed_at":"2026-05-18T01:33:50.540396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:50.540396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5vAgytf9kIx8UEqlS+oZikBNRbDUXmK4dTG5dL2viJ1QAACdee2b1KkIA0risjXa+uw0FRI5wzM9ee4cIzHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:50.541001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a800150da25720392adf6404fa7911d46a2877b58952fec1da17d94ef952df7b","sha256:a274c171286f0acdf8216add8b217e1eb26c4df93916153e37a119523def0025"],"state_sha256":"6ff67b11ba6f1c193defbefd4bafa97e50414de2ac52ab236023c1edd172711b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2r6uEV8Qs3WlMUZo6TzrDHL5jSB5cxO/77pdK/L1PoXO7uVEuAf5mQH2+yMDOVwqc4Tvw6TpzvSQduPqjxDnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:43:40.560224Z","bundle_sha256":"e7a1b87969dbb92577f2dd568e69f72f48b8f7ef66c5f2f6b84ad55e6f4501d7"}}