{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SBVHODVRBUT4FTROZW55CHSQLD","short_pith_number":"pith:SBVHODVR","schema_version":"1.0","canonical_sha256":"906a770eb10d27c2ce2ecdbbd11e5058e40dd351065f3812c93b32cbdd695cd8","source":{"kind":"arxiv","id":"1508.03447","version":1},"attestation_state":"computed","paper":{"title":"Resolvability and Strong Resolvability in the Direct Product 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, Iztok Peterin","submitted_at":"2015-08-14T09:25:06Z","abstract_excerpt":"Given a connected graph $G$, a vertex $w\\in V(G)$ distinguishes two different vertices $u,v$ of $G$ if the distances between $w$ and $u$ and between $w$ and $v$ are different. Moreover, $w$ strongly resolves the pair $u,v$ 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) metric generator for $G$ if every pair of vertices of $G$ is (strongly resolved) distinguished by some vertex of $W$. The smallest cardinality of a (strong) metric generator for $G$ is called the (strong) metric dimension of $G$. In this art"},"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":"1508.03447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-14T09:25:06Z","cross_cats_sorted":[],"title_canon_sha256":"fdd8de9451a5588971c6745cc13d5d5169469b172023fe92950d2086ac083b83","abstract_canon_sha256":"c2dd75db81d20b30ca88b63b516859db3e23a056bb9b46d7c11564f38b57305a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:17.773406Z","signature_b64":"Oy+pIFHFG9cA+Wk47VeClPLmicNwv1mEpL0dvbCRIe95HDaoiG0Dqj9hzjiCyEaN1f8UC7/Pswxe5+iwxDfqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"906a770eb10d27c2ce2ecdbbd11e5058e40dd351065f3812c93b32cbdd695cd8","last_reissued_at":"2026-05-18T01:35:17.772725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:17.772725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolvability and Strong Resolvability in the Direct Product 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, Iztok Peterin","submitted_at":"2015-08-14T09:25:06Z","abstract_excerpt":"Given a connected graph $G$, a vertex $w\\in V(G)$ distinguishes two different vertices $u,v$ of $G$ if the distances between $w$ and $u$ and between $w$ and $v$ are different. Moreover, $w$ strongly resolves the pair $u,v$ 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) metric generator for $G$ if every pair of vertices of $G$ is (strongly resolved) distinguished by some vertex of $W$. The smallest cardinality of a (strong) metric generator for $G$ is called the (strong) metric dimension of $G$. In this art"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03447","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":"1508.03447","created_at":"2026-05-18T01:35:17.772823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03447v1","created_at":"2026-05-18T01:35:17.772823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03447","created_at":"2026-05-18T01:35:17.772823+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBVHODVRBUT4","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBVHODVRBUT4FTRO","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBVHODVR","created_at":"2026-05-18T12:29:39.896362+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/SBVHODVRBUT4FTROZW55CHSQLD","json":"https://pith.science/pith/SBVHODVRBUT4FTROZW55CHSQLD.json","graph_json":"https://pith.science/api/pith-number/SBVHODVRBUT4FTROZW55CHSQLD/graph.json","events_json":"https://pith.science/api/pith-number/SBVHODVRBUT4FTROZW55CHSQLD/events.json","paper":"https://pith.science/paper/SBVHODVR"},"agent_actions":{"view_html":"https://pith.science/pith/SBVHODVRBUT4FTROZW55CHSQLD","download_json":"https://pith.science/pith/SBVHODVRBUT4FTROZW55CHSQLD.json","view_paper":"https://pith.science/paper/SBVHODVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03447&json=true","fetch_graph":"https://pith.science/api/pith-number/SBVHODVRBUT4FTROZW55CHSQLD/graph.json","fetch_events":"https://pith.science/api/pith-number/SBVHODVRBUT4FTROZW55CHSQLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBVHODVRBUT4FTROZW55CHSQLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBVHODVRBUT4FTROZW55CHSQLD/action/storage_attestation","attest_author":"https://pith.science/pith/SBVHODVRBUT4FTROZW55CHSQLD/action/author_attestation","sign_citation":"https://pith.science/pith/SBVHODVRBUT4FTROZW55CHSQLD/action/citation_signature","submit_replication":"https://pith.science/pith/SBVHODVRBUT4FTROZW55CHSQLD/action/replication_record"}},"created_at":"2026-05-18T01:35:17.772823+00:00","updated_at":"2026-05-18T01:35:17.772823+00:00"}