{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:H5B2XPMOF723OVH5IJ5XNSZDYC","short_pith_number":"pith:H5B2XPMO","canonical_record":{"source":{"id":"1309.0643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T11:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"25d4098a91235626d1053d2cfa0acb0b507a6ff0424bcb337d53bd257fb3a080","abstract_canon_sha256":"7672935790a538c3355a95de37b0ef9103f40f6a6afc69f5df1b50f449e38106"},"schema_version":"1.0"},"canonical_sha256":"3f43abbd8e2ff5b754fd427b76cb23c0b0a796b24a12a2fd83e09fe0af6f80b2","source":{"kind":"arxiv","id":"1309.0643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0643","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0643v1","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0643","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"H5B2XPMOF723","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H5B2XPMOF723OVH5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H5B2XPMO","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:H5B2XPMOF723OVH5IJ5XNSZDYC","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T11:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"25d4098a91235626d1053d2cfa0acb0b507a6ff0424bcb337d53bd257fb3a080","abstract_canon_sha256":"7672935790a538c3355a95de37b0ef9103f40f6a6afc69f5df1b50f449e38106"},"schema_version":"1.0"},"canonical_sha256":"3f43abbd8e2ff5b754fd427b76cb23c0b0a796b24a12a2fd83e09fe0af6f80b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:18.473446Z","signature_b64":"0RVTkpmgtX2lttjcyVjW0r9utYnQDedV+EdJW6hyMtICv281MLMi9ts9AvZ0UlTuUVNWnGvLGmSJG/3LGUdWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f43abbd8e2ff5b754fd427b76cb23c0b0a796b24a12a2fd83e09fe0af6f80b2","last_reissued_at":"2026-05-18T03:14:18.472774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:18.472774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0643","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-18T03:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9yiwxV8qNB5tE9YtqUZn50BDMOpb8QymXpWO91BqjE/+PTWMPDEtrS8+uSj9E1BTENTuPrBt9qfLxvhxrOa3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:36:09.681121Z"},"content_sha256":"d4ae0681a76dd815b09201646745c1507a065ecea2440b14d2b859ad548d84a6","schema_version":"1.0","event_id":"sha256:d4ae0681a76dd815b09201646745c1507a065ecea2440b14d2b859ad548d84a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:H5B2XPMOF723OVH5IJ5XNSZDYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong metric dimension of rooted product 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":"2013-09-03T11:04:21Z","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. This suggests finding the strong metric dimension for special classes of graphs or obtaining good"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0643","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-18T03:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfrHSmjXTOC1xF8TNz5V18fluw7ZD57zTw7VJpsli6S2/thot5AejAGUReY9tKWK5nT/tDpBElVxShDm9vnGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:36:09.681479Z"},"content_sha256":"b2c522fd12d7b0095d309833e5d494ea000ef35feb9bed366b1a6701cf064f50","schema_version":"1.0","event_id":"sha256:b2c522fd12d7b0095d309833e5d494ea000ef35feb9bed366b1a6701cf064f50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5B2XPMOF723OVH5IJ5XNSZDYC/bundle.json","state_url":"https://pith.science/pith/H5B2XPMOF723OVH5IJ5XNSZDYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5B2XPMOF723OVH5IJ5XNSZDYC/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-03T02:36:09Z","links":{"resolver":"https://pith.science/pith/H5B2XPMOF723OVH5IJ5XNSZDYC","bundle":"https://pith.science/pith/H5B2XPMOF723OVH5IJ5XNSZDYC/bundle.json","state":"https://pith.science/pith/H5B2XPMOF723OVH5IJ5XNSZDYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5B2XPMOF723OVH5IJ5XNSZDYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H5B2XPMOF723OVH5IJ5XNSZDYC","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":"7672935790a538c3355a95de37b0ef9103f40f6a6afc69f5df1b50f449e38106","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T11:04:21Z","title_canon_sha256":"25d4098a91235626d1053d2cfa0acb0b507a6ff0424bcb337d53bd257fb3a080"},"schema_version":"1.0","source":{"id":"1309.0643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0643","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0643v1","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0643","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"H5B2XPMOF723","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H5B2XPMOF723OVH5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H5B2XPMO","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:b2c522fd12d7b0095d309833e5d494ea000ef35feb9bed366b1a6701cf064f50","target":"graph","created_at":"2026-05-18T03:14:18Z","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. This suggests finding the strong metric dimension for special classes of graphs or obtaining good","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":"2013-09-03T11:04:21Z","title":"Strong metric dimension of rooted product graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0643","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:d4ae0681a76dd815b09201646745c1507a065ecea2440b14d2b859ad548d84a6","target":"record","created_at":"2026-05-18T03:14:18Z","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":"7672935790a538c3355a95de37b0ef9103f40f6a6afc69f5df1b50f449e38106","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T11:04:21Z","title_canon_sha256":"25d4098a91235626d1053d2cfa0acb0b507a6ff0424bcb337d53bd257fb3a080"},"schema_version":"1.0","source":{"id":"1309.0643","kind":"arxiv","version":1}},"canonical_sha256":"3f43abbd8e2ff5b754fd427b76cb23c0b0a796b24a12a2fd83e09fe0af6f80b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f43abbd8e2ff5b754fd427b76cb23c0b0a796b24a12a2fd83e09fe0af6f80b2","first_computed_at":"2026-05-18T03:14:18.472774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:18.472774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0RVTkpmgtX2lttjcyVjW0r9utYnQDedV+EdJW6hyMtICv281MLMi9ts9AvZ0UlTuUVNWnGvLGmSJG/3LGUdWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:18.473446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4ae0681a76dd815b09201646745c1507a065ecea2440b14d2b859ad548d84a6","sha256:b2c522fd12d7b0095d309833e5d494ea000ef35feb9bed366b1a6701cf064f50"],"state_sha256":"327c219e5c685378cb6f3242b5cca63bb27e3312544251961d0e1a545838eaec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFNS8tEvsdTfO6tDGJ8Tt3Rg1IQJv6ZJhJfxiFiz2zjUVGlHOzNUky+Db8V3/oyZ9m/yaVs09CDDKjcdjfcbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:36:09.683331Z","bundle_sha256":"7ce549bd5188e4973c76257cfcb5467344374f008562ff0fd3582b83eaa8a1ad"}}