{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OXCTMZ66OWVEILIQ6TNLYIDZBC","short_pith_number":"pith:OXCTMZ66","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"},"canonical_sha256":"75c53667de75aa442d10f4dabc207908a453ed3e1081211c7fa829b4cd432df9","source":{"kind":"arxiv","id":"1204.0495","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0495","created_at":"2026-05-18T03:06:03Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0495v2","created_at":"2026-05-18T03:06:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0495","created_at":"2026-05-18T03:06:03Z"},{"alias_kind":"pith_short_12","alias_value":"OXCTMZ66OWVE","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OXCTMZ66OWVEILIQ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OXCTMZ66","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OXCTMZ66OWVEILIQ6TNLYIDZBC","target":"record","payload":{"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"},"canonical_sha256":"75c53667de75aa442d10f4dabc207908a453ed3e1081211c7fa829b4cd432df9","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"},"source_kind":"arxiv","source_id":"1204.0495","source_version":2,"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-18T03:06:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVeYV8PpqIJ97XZuy6D0O+kllL6BqWWKJVaJl5NB0ajWY3Hb/8BlZCzND2p1FD9XQCZLxMJhVChwb70C/WWcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:40:02.543950Z"},"content_sha256":"a57a18b74663fd82bde4f43ac2841b08087b985a032409778d3a282303f43bec","schema_version":"1.0","event_id":"sha256:a57a18b74663fd82bde4f43ac2841b08087b985a032409778d3a282303f43bec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OXCTMZ66OWVEILIQ6TNLYIDZBC","target":"graph","payload":{"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"},"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-18T03:06:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oPM4zSinIpm26g2mtJrTToVJ4r6jzeRYFuuiA17MQtowCI4S9dE4Nmy1ywQsyjUd6TiLCGXYbOIvBGnP754qDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:40:02.544294Z"},"content_sha256":"09f4f11f6bda2deb87abb4c4ecda6c500ae79d87c4e0965f95f5e39939d3959f","schema_version":"1.0","event_id":"sha256:09f4f11f6bda2deb87abb4c4ecda6c500ae79d87c4e0965f95f5e39939d3959f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/bundle.json","state_url":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/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-03T05:40:02Z","links":{"resolver":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC","bundle":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/bundle.json","state":"https://pith.science/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXCTMZ66OWVEILIQ6TNLYIDZBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OXCTMZ66OWVEILIQ6TNLYIDZBC","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":"60f37ed1777685763857292007064f1f13318dfb53e6985c1bd2dc6cccd7b223","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T18:49:01Z","title_canon_sha256":"bf724b905a7a60df2cf507f5c262697b196f9821321e2c56014f444f13e6c935"},"schema_version":"1.0","source":{"id":"1204.0495","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0495","created_at":"2026-05-18T03:06:03Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0495v2","created_at":"2026-05-18T03:06:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0495","created_at":"2026-05-18T03:06:03Z"},{"alias_kind":"pith_short_12","alias_value":"OXCTMZ66OWVE","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OXCTMZ66OWVEILIQ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OXCTMZ66","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:09f4f11f6bda2deb87abb4c4ecda6c500ae79d87c4e0965f95f5e39939d3959f","target":"graph","created_at":"2026-05-18T03:06:03Z","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":"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","authors_text":"Dorota Kuziak, Ismael G. Yero, Juan A. Rodriguez-Velazquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T18:49:01Z","title":"On the strong metric dimension of corona product graphs and join graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0495","kind":"arxiv","version":2},"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:a57a18b74663fd82bde4f43ac2841b08087b985a032409778d3a282303f43bec","target":"record","created_at":"2026-05-18T03:06:03Z","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":"60f37ed1777685763857292007064f1f13318dfb53e6985c1bd2dc6cccd7b223","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T18:49:01Z","title_canon_sha256":"bf724b905a7a60df2cf507f5c262697b196f9821321e2c56014f444f13e6c935"},"schema_version":"1.0","source":{"id":"1204.0495","kind":"arxiv","version":2}},"canonical_sha256":"75c53667de75aa442d10f4dabc207908a453ed3e1081211c7fa829b4cd432df9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75c53667de75aa442d10f4dabc207908a453ed3e1081211c7fa829b4cd432df9","first_computed_at":"2026-05-18T03:06:03.744586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:03.744586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zsuClyzdeOiFIX0RRdkmDfjI6mEkmlMkjwfPZxCTEWIiA3FHcpFrwDQNPw15+gfDrmMC25AiScX4KPlw09zBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:03.745307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0495","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a57a18b74663fd82bde4f43ac2841b08087b985a032409778d3a282303f43bec","sha256:09f4f11f6bda2deb87abb4c4ecda6c500ae79d87c4e0965f95f5e39939d3959f"],"state_sha256":"6d299a95ad9e0517cb61a7d07a8e7a82ddb8286540ee99160d0a07fc49eb62b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+X1bkiWPAiQum1u8gjt31uMCxmy8wLLfPfvoFRN2kTr4EbrvP5uHFjqoausFvpzYeRMjl90lHri/su73u4QAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:40:02.546291Z","bundle_sha256":"0489147b5014b82b22557b88d36badfdfecbc6ca6c1f94c51db3be5a7611cc68"}}