{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NSEBM6AB7W2WYCVWVXCOZ3BRTK","short_pith_number":"pith:NSEBM6AB","schema_version":"1.0","canonical_sha256":"6c88167801fdb56c0ab6adc4ecec319a8f4f593c8b2fb2c0501d24f5c5a27125","source":{"kind":"arxiv","id":"1504.04820","version":1},"attestation_state":"computed","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, "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.04820","created_at":"2026-05-18T00:45:58.969827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04820v1","created_at":"2026-05-18T00:45:58.969827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04820","created_at":"2026-05-18T00:45:58.969827+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSEBM6AB7W2W","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSEBM6AB7W2WYCVW","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSEBM6AB","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK","json":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK.json","graph_json":"https://pith.science/api/pith-number/NSEBM6AB7W2WYCVWVXCOZ3BRTK/graph.json","events_json":"https://pith.science/api/pith-number/NSEBM6AB7W2WYCVWVXCOZ3BRTK/events.json","paper":"https://pith.science/paper/NSEBM6AB"},"agent_actions":{"view_html":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK","download_json":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK.json","view_paper":"https://pith.science/paper/NSEBM6AB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04820&json=true","fetch_graph":"https://pith.science/api/pith-number/NSEBM6AB7W2WYCVWVXCOZ3BRTK/graph.json","fetch_events":"https://pith.science/api/pith-number/NSEBM6AB7W2WYCVWVXCOZ3BRTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/action/storage_attestation","attest_author":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/action/author_attestation","sign_citation":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/action/citation_signature","submit_replication":"https://pith.science/pith/NSEBM6AB7W2WYCVWVXCOZ3BRTK/action/replication_record"}},"created_at":"2026-05-18T00:45:58.969827+00:00","updated_at":"2026-05-18T00:45:58.969827+00:00"}