{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GD353UAJJH32AOZRJHTJL4KSZ6","short_pith_number":"pith:GD353UAJ","canonical_record":{"source":{"id":"1307.4722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T18:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"4373c8bdfb3e76df1f5ba480fccc3289d103da7515414daca3857f6280b3f5ec","abstract_canon_sha256":"5663f45c7e67f7139730a0e002889f850984db2a948bdfe4b0d3e88e2082ace0"},"schema_version":"1.0"},"canonical_sha256":"30f7ddd00949f7a03b3149e695f152cf976a0a457b3556bb1b257124af933f4a","source":{"kind":"arxiv","id":"1307.4722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4722","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4722v1","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4722","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"pith_short_12","alias_value":"GD353UAJJH32","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GD353UAJJH32AOZR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GD353UAJ","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GD353UAJJH32AOZRJHTJL4KSZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T18:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"4373c8bdfb3e76df1f5ba480fccc3289d103da7515414daca3857f6280b3f5ec","abstract_canon_sha256":"5663f45c7e67f7139730a0e002889f850984db2a948bdfe4b0d3e88e2082ace0"},"schema_version":"1.0"},"canonical_sha256":"30f7ddd00949f7a03b3149e695f152cf976a0a457b3556bb1b257124af933f4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:17.313090Z","signature_b64":"ByoYNAilqyHw1oE+0qs7u7mBI5twNb0x4fEziYho7wV+6nED9URmDKYkPF51NNWnjYRE7JEer+0sp9TuHqbRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30f7ddd00949f7a03b3149e695f152cf976a0a457b3556bb1b257124af933f4a","last_reissued_at":"2026-05-18T03:18:17.312605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:17.312605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4722","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:18:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"656kkxrdbtwtTe0T6dBVrLi81MQyOhN01a0u455U19POarcjphWC3brYw/oxgFsaIZcA42JYlpI7mZu1kApLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:49:03.223686Z"},"content_sha256":"cc0ca6cd6134e13c140d4fad6df957058f7f616e445db38174d38ab128d481e0","schema_version":"1.0","event_id":"sha256:cc0ca6cd6134e13c140d4fad6df957058f7f616e445db38174d38ab128d481e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GD353UAJJH32AOZRJHTJL4KSZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the strong metric dimension of Cartesian and direct products of 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, Ortrud R. Oellermann","submitted_at":"2013-07-17T18:41:18Z","abstract_excerpt":"Let $G$ be a connected graph. A vertex $w$ {\\em 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 {\\em 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 {\\em strong metric dimension} of $G$. It is known that the problem of computing the strong metric dimension of a graph is NP-hard. In this paper we obtain closed formulae for the strong me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4722","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:18:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYZWTr0cM+IUQk797XmlzMnoaqEIYT172hW2FmAE1r0ZuZyt7R6Qa1eVpykI47/QdSJ7zyJGVVfGgNhgQ95YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:49:03.224039Z"},"content_sha256":"b0cc7321835aa487210d1e2b0117376f8ade3d0049c43f604be17085cf263224","schema_version":"1.0","event_id":"sha256:b0cc7321835aa487210d1e2b0117376f8ade3d0049c43f604be17085cf263224"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GD353UAJJH32AOZRJHTJL4KSZ6/bundle.json","state_url":"https://pith.science/pith/GD353UAJJH32AOZRJHTJL4KSZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GD353UAJJH32AOZRJHTJL4KSZ6/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-03T07:49:03Z","links":{"resolver":"https://pith.science/pith/GD353UAJJH32AOZRJHTJL4KSZ6","bundle":"https://pith.science/pith/GD353UAJJH32AOZRJHTJL4KSZ6/bundle.json","state":"https://pith.science/pith/GD353UAJJH32AOZRJHTJL4KSZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GD353UAJJH32AOZRJHTJL4KSZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GD353UAJJH32AOZRJHTJL4KSZ6","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":"5663f45c7e67f7139730a0e002889f850984db2a948bdfe4b0d3e88e2082ace0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T18:41:18Z","title_canon_sha256":"4373c8bdfb3e76df1f5ba480fccc3289d103da7515414daca3857f6280b3f5ec"},"schema_version":"1.0","source":{"id":"1307.4722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4722","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4722v1","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4722","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"pith_short_12","alias_value":"GD353UAJJH32","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GD353UAJJH32AOZR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GD353UAJ","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:b0cc7321835aa487210d1e2b0117376f8ade3d0049c43f604be17085cf263224","target":"graph","created_at":"2026-05-18T03:18:17Z","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$ {\\em 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 {\\em 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 {\\em strong metric dimension} of $G$. It is known that the problem of computing the strong metric dimension of a graph is NP-hard. In this paper we obtain closed formulae for the strong me","authors_text":"Dorota Kuziak, Ismael G. Yero, Juan A. Rodr\\'iguez-Vel\\'azquez, Ortrud R. Oellermann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T18:41:18Z","title":"On the strong metric dimension of Cartesian and direct products of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4722","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:cc0ca6cd6134e13c140d4fad6df957058f7f616e445db38174d38ab128d481e0","target":"record","created_at":"2026-05-18T03:18:17Z","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":"5663f45c7e67f7139730a0e002889f850984db2a948bdfe4b0d3e88e2082ace0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T18:41:18Z","title_canon_sha256":"4373c8bdfb3e76df1f5ba480fccc3289d103da7515414daca3857f6280b3f5ec"},"schema_version":"1.0","source":{"id":"1307.4722","kind":"arxiv","version":1}},"canonical_sha256":"30f7ddd00949f7a03b3149e695f152cf976a0a457b3556bb1b257124af933f4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30f7ddd00949f7a03b3149e695f152cf976a0a457b3556bb1b257124af933f4a","first_computed_at":"2026-05-18T03:18:17.312605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:17.312605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ByoYNAilqyHw1oE+0qs7u7mBI5twNb0x4fEziYho7wV+6nED9URmDKYkPF51NNWnjYRE7JEer+0sp9TuHqbRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:17.313090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc0ca6cd6134e13c140d4fad6df957058f7f616e445db38174d38ab128d481e0","sha256:b0cc7321835aa487210d1e2b0117376f8ade3d0049c43f604be17085cf263224"],"state_sha256":"cceedb64340b87da17b1961c1727cb62100bb63b42c29dc73e3cf3183039a57a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikHWJCceDrvVL9FR6Pb83ayh+VfHedIr+aeAKAk0QN50MAu1meyj/rA6ftNjiWC9TduuyInjDjaZUzrDLtGdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:49:03.226091Z","bundle_sha256":"f179c5f08c63631b014edd6620a770df8e3a328c0ced00fe690dd2f5de02cea5"}}