{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6PYEVBYZE5BA2JOHI52JUN5G45","short_pith_number":"pith:6PYEVBYZ","schema_version":"1.0","canonical_sha256":"f3f04a871927420d25c747749a37a6e75b374524ae0a8525f2d14886d5c6a8b2","source":{"kind":"arxiv","id":"1501.00565","version":1},"attestation_state":"computed","paper":{"title":"The Simultaneous Metric Dimension of Graph Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. A. Rodriguez-Velazquez, O. R. Oellermann, Y. Ramirez-Cruz","submitted_at":"2015-01-03T13:40:43Z","abstract_excerpt":"A vertex $v\\in V$ is said to resolve two vertices $x$ and $y$ if $d_G(v,x)\\ne d_G(v,y)$. A set $S\\subset V$ is said to be a metric generator for $G$ if any pair of vertices of $G$ is resolved by some element of $S$. A minimum metric generator is called a metric basis, and its cardinality, $\\dim(G)$, the \\emph{metric dimension} of $G$. A set $S\\subseteq V$ is said to be a simultaneous metric generator for a graph family ${\\cal G}=\\{G_1,G_2,\\ldots,G_k\\}$, defined on a common (labeled) vertex set, if it is a metric generator for every graph of the family. A minimum cardinality simultaneous metric"},"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":"1501.00565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-03T13:40:43Z","cross_cats_sorted":[],"title_canon_sha256":"4a02d6c1c4827b70c13af272498a2f4228eddec42f1001f083d7b7063ebe397d","abstract_canon_sha256":"749eb5dd33b641a84b36e1315ba0fb4150a655323b9ee291d2173363f5eaa7aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:59.031886Z","signature_b64":"wswGBpcfZYujlRFNd4HKiryTGMCg+7FrlahNBXymvF7c0clzyENgwspCLVFMqCYs9ItKpIH1p4kFRosbC1d6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3f04a871927420d25c747749a37a6e75b374524ae0a8525f2d14886d5c6a8b2","last_reissued_at":"2026-05-18T00:45:59.031424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:59.031424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Simultaneous Metric Dimension of Graph Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. A. Rodriguez-Velazquez, O. R. Oellermann, Y. Ramirez-Cruz","submitted_at":"2015-01-03T13:40:43Z","abstract_excerpt":"A vertex $v\\in V$ is said to resolve two vertices $x$ and $y$ if $d_G(v,x)\\ne d_G(v,y)$. A set $S\\subset V$ is said to be a metric generator for $G$ if any pair of vertices of $G$ is resolved by some element of $S$. A minimum metric generator is called a metric basis, and its cardinality, $\\dim(G)$, the \\emph{metric dimension} of $G$. A set $S\\subseteq V$ is said to be a simultaneous metric generator for a graph family ${\\cal G}=\\{G_1,G_2,\\ldots,G_k\\}$, defined on a common (labeled) vertex set, if it is a metric generator for every graph of the family. A minimum cardinality simultaneous metric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00565","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":"1501.00565","created_at":"2026-05-18T00:45:59.031488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00565v1","created_at":"2026-05-18T00:45:59.031488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00565","created_at":"2026-05-18T00:45:59.031488+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PYEVBYZE5BA","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PYEVBYZE5BA2JOH","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PYEVBYZ","created_at":"2026-05-18T12:29:07.941421+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/6PYEVBYZE5BA2JOHI52JUN5G45","json":"https://pith.science/pith/6PYEVBYZE5BA2JOHI52JUN5G45.json","graph_json":"https://pith.science/api/pith-number/6PYEVBYZE5BA2JOHI52JUN5G45/graph.json","events_json":"https://pith.science/api/pith-number/6PYEVBYZE5BA2JOHI52JUN5G45/events.json","paper":"https://pith.science/paper/6PYEVBYZ"},"agent_actions":{"view_html":"https://pith.science/pith/6PYEVBYZE5BA2JOHI52JUN5G45","download_json":"https://pith.science/pith/6PYEVBYZE5BA2JOHI52JUN5G45.json","view_paper":"https://pith.science/paper/6PYEVBYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00565&json=true","fetch_graph":"https://pith.science/api/pith-number/6PYEVBYZE5BA2JOHI52JUN5G45/graph.json","fetch_events":"https://pith.science/api/pith-number/6PYEVBYZE5BA2JOHI52JUN5G45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PYEVBYZE5BA2JOHI52JUN5G45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PYEVBYZE5BA2JOHI52JUN5G45/action/storage_attestation","attest_author":"https://pith.science/pith/6PYEVBYZE5BA2JOHI52JUN5G45/action/author_attestation","sign_citation":"https://pith.science/pith/6PYEVBYZE5BA2JOHI52JUN5G45/action/citation_signature","submit_replication":"https://pith.science/pith/6PYEVBYZE5BA2JOHI52JUN5G45/action/replication_record"}},"created_at":"2026-05-18T00:45:59.031488+00:00","updated_at":"2026-05-18T00:45:59.031488+00:00"}