{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NSEBM6AB7W2WYCVWVXCOZ3BRTK","short_pith_number":"pith:NSEBM6AB","canonical_record":{"source":{"id":"1504.04820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-19T11:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"c46243f7c1b39217d74ff656153abafc2b7c40ca1ae9de9ce948bccb9cc545dc","abstract_canon_sha256":"7d1d02ba799bd6aaeb47115ef2c06c52b354f2c4a181434a56cf00dc4b3c0f96"},"schema_version":"1.0"},"canonical_sha256":"6c88167801fdb56c0ab6adc4ecec319a8f4f593c8b2fb2c0501d24f5c5a27125","source":{"kind":"arxiv","id":"1504.04820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04820","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04820v1","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04820","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"NSEBM6AB7W2W","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NSEBM6AB7W2WYCVW","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NSEBM6AB","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NSEBM6AB7W2WYCVWVXCOZ3BRTK","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-19T11:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"c46243f7c1b39217d74ff656153abafc2b7c40ca1ae9de9ce948bccb9cc545dc","abstract_canon_sha256":"7d1d02ba799bd6aaeb47115ef2c06c52b354f2c4a181434a56cf00dc4b3c0f96"},"schema_version":"1.0"},"canonical_sha256":"6c88167801fdb56c0ab6adc4ecec319a8f4f593c8b2fb2c0501d24f5c5a27125","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:58.970206Z","signature_b64":"FvczenVK732WkPwaThZVTZmOEjA65Ei6kpOqJtCG5nBkv+Xc7uwDTs0JjOFRm0JJ45zc1cCsq4dBfWuP0ExdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c88167801fdb56c0ab6adc4ecec319a8f4f593c8b2fb2c0501d24f5c5a27125","last_reissued_at":"2026-05-18T00:45:58.969760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:58.969760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04820","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-18T00:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aiI9aTx/BIsceMYiQKQ8LhnB9pF2iza9PuaJcsh8fG5k5mnyPo/CKZNS+70xoO3f04Qvwcl4U+YOxV2Hv+EJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:43:23.830768Z"},"content_sha256":"24938c716aec84cd5b1ae3a60475d1f8ee0e0b2dfdc6e84cd8d57e2e5622c6bc","schema_version":"1.0","event_id":"sha256:24938c716aec84cd5b1ae3a60475d1f8ee0e0b2dfdc6e84cd8d57e2e5622c6bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NSEBM6AB7W2WYCVWVXCOZ3BRTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Simultaneous Strong Metric Dimension of Graph Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Estrada-Moreno, C. Garc\\'ia-G\\'omez, J. A. Rodr\\'iguez-Vel\\'azquez, Y. Ram\\'irez-Cruz","submitted_at":"2015-04-19T11:01:37Z","abstract_excerpt":"Let ${\\cal G}$ be a family of graphs defined on a common (labeled) vertex set $V$. A set $S\\subset V$ is said to be a simultaneous strong metric generator for ${\\cal G}$ if it is a strong metric generator for every graph of the family. The minimum cardinality among all simultaneous strong metric generators for ${\\cal G}$, denoted by $Sd_s({\\cal G})$, is called the simultaneous strong metric dimension of ${\\cal G}$. We obtain general results on $Sd_s({\\cal G})$ for arbitrary families of graphs, with special emphasis on the case of families composed by a graph and its complement. In particular, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04820","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-18T00:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f0sNWzkNbYryNlbCMA8uY0ZrXh9tyZR3FDjvLJBpqPmB+Uike+8rxhAFgE0Tn1z3ZQgh8/2ZBFRvzc1L2rLeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:43:23.831111Z"},"content_sha256":"75e58a7e16a8b6663e8028136a4db767f3a54c602a29dc7678c5bbab1450b0c6","schema_version":"1.0","event_id":"sha256:75e58a7e16a8b6663e8028136a4db767f3a54c602a29dc7678c5bbab1450b0c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/bundle.json","state_url":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/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-08T13:43:23Z","links":{"resolver":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK","bundle":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/bundle.json","state":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NSEBM6AB7W2WYCVWVXCOZ3BRTK","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":"7d1d02ba799bd6aaeb47115ef2c06c52b354f2c4a181434a56cf00dc4b3c0f96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-19T11:01:37Z","title_canon_sha256":"c46243f7c1b39217d74ff656153abafc2b7c40ca1ae9de9ce948bccb9cc545dc"},"schema_version":"1.0","source":{"id":"1504.04820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04820","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04820v1","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04820","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"NSEBM6AB7W2W","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NSEBM6AB7W2WYCVW","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NSEBM6AB","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:75e58a7e16a8b6663e8028136a4db767f3a54c602a29dc7678c5bbab1450b0c6","target":"graph","created_at":"2026-05-18T00:45:58Z","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 ${\\cal G}$ be a family of graphs defined on a common (labeled) vertex set $V$. A set $S\\subset V$ is said to be a simultaneous strong metric generator for ${\\cal G}$ if it is a strong metric generator for every graph of the family. The minimum cardinality among all simultaneous strong metric generators for ${\\cal G}$, denoted by $Sd_s({\\cal G})$, is called the simultaneous strong metric dimension of ${\\cal G}$. We obtain general results on $Sd_s({\\cal G})$ for arbitrary families of graphs, with special emphasis on the case of families composed by a graph and its complement. In particular, ","authors_text":"A. Estrada-Moreno, C. Garc\\'ia-G\\'omez, J. A. Rodr\\'iguez-Vel\\'azquez, Y. Ram\\'irez-Cruz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-19T11:01:37Z","title":"The Simultaneous Strong Metric Dimension of Graph Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04820","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:24938c716aec84cd5b1ae3a60475d1f8ee0e0b2dfdc6e84cd8d57e2e5622c6bc","target":"record","created_at":"2026-05-18T00:45:58Z","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":"7d1d02ba799bd6aaeb47115ef2c06c52b354f2c4a181434a56cf00dc4b3c0f96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-19T11:01:37Z","title_canon_sha256":"c46243f7c1b39217d74ff656153abafc2b7c40ca1ae9de9ce948bccb9cc545dc"},"schema_version":"1.0","source":{"id":"1504.04820","kind":"arxiv","version":1}},"canonical_sha256":"6c88167801fdb56c0ab6adc4ecec319a8f4f593c8b2fb2c0501d24f5c5a27125","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c88167801fdb56c0ab6adc4ecec319a8f4f593c8b2fb2c0501d24f5c5a27125","first_computed_at":"2026-05-18T00:45:58.969760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:58.969760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FvczenVK732WkPwaThZVTZmOEjA65Ei6kpOqJtCG5nBkv+Xc7uwDTs0JjOFRm0JJ45zc1cCsq4dBfWuP0ExdAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:58.970206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24938c716aec84cd5b1ae3a60475d1f8ee0e0b2dfdc6e84cd8d57e2e5622c6bc","sha256:75e58a7e16a8b6663e8028136a4db767f3a54c602a29dc7678c5bbab1450b0c6"],"state_sha256":"bb06c64e129633c7c0a648170909cc49d25cd0cdad738f0e2981530bfd622869"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8lNf0ObOSNMobIK13WgiB+cVHmrWRZCAxJ92hPa7X/0qz0qPUiwFpcwotdnaoJicpRsTHV+FPlIKFzn6gs/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:43:23.832997Z","bundle_sha256":"a1a86a6162f57595fb2ef79c22a5efaf33fa6dc6c13d00cb8469f42d15b85db7"}}