{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DL5QXIDO2XWXNKXU6QIYUBGAD3","short_pith_number":"pith:DL5QXIDO","schema_version":"1.0","canonical_sha256":"1afb0ba06ed5ed76aaf4f4118a04c01ee7a90ec44cc243ddefdc8e1bc7ba3800","source":{"kind":"arxiv","id":"1309.0252","version":1},"attestation_state":"computed","paper":{"title":"The resolving number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alberto M\\'arquez, Antonio Gonz\\'alez, Delia Garijo","submitted_at":"2013-09-01T18:41:13Z","abstract_excerpt":"We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by Chartrand, Poisson and Zhang. First, we establish an important difference between the two parameters: while computing the metric dimension of an arbitrary graph is known to be NP-hard, we show that the resolving number can be computed in polynomial time. We then relate the resolving number to classical graph parameters: diameter, girth, clique number, order and maximum degree. With these relations in hand, we characterize the graphs with resolving number 3 extending other studi"},"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":"1309.0252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T18:41:13Z","cross_cats_sorted":[],"title_canon_sha256":"aaa6f42af7a60070b115678c64c190a5b1655769cf997288f5300920796171ad","abstract_canon_sha256":"3e736c90e1836829e77746ce2d80792305aca916bd51175c914cbb91d4dad76d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:28.405149Z","signature_b64":"7TQstFFXsEj4RjtF/XcIjfh1dn9WvyBA+FZ5iMg7opWRBUtZBkiV3WexmLnZ6kCKWTQRz06b2bPvnfCaPnlvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1afb0ba06ed5ed76aaf4f4118a04c01ee7a90ec44cc243ddefdc8e1bc7ba3800","last_reissued_at":"2026-05-18T03:14:28.404521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:28.404521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The resolving number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alberto M\\'arquez, Antonio Gonz\\'alez, Delia Garijo","submitted_at":"2013-09-01T18:41:13Z","abstract_excerpt":"We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by Chartrand, Poisson and Zhang. First, we establish an important difference between the two parameters: while computing the metric dimension of an arbitrary graph is known to be NP-hard, we show that the resolving number can be computed in polynomial time. We then relate the resolving number to classical graph parameters: diameter, girth, clique number, order and maximum degree. With these relations in hand, we characterize the graphs with resolving number 3 extending other studi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0252","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":"1309.0252","created_at":"2026-05-18T03:14:28.404620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0252v1","created_at":"2026-05-18T03:14:28.404620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0252","created_at":"2026-05-18T03:14:28.404620+00:00"},{"alias_kind":"pith_short_12","alias_value":"DL5QXIDO2XWX","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DL5QXIDO2XWXNKXU","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DL5QXIDO","created_at":"2026-05-18T12:27:43.054852+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/DL5QXIDO2XWXNKXU6QIYUBGAD3","json":"https://pith.science/pith/DL5QXIDO2XWXNKXU6QIYUBGAD3.json","graph_json":"https://pith.science/api/pith-number/DL5QXIDO2XWXNKXU6QIYUBGAD3/graph.json","events_json":"https://pith.science/api/pith-number/DL5QXIDO2XWXNKXU6QIYUBGAD3/events.json","paper":"https://pith.science/paper/DL5QXIDO"},"agent_actions":{"view_html":"https://pith.science/pith/DL5QXIDO2XWXNKXU6QIYUBGAD3","download_json":"https://pith.science/pith/DL5QXIDO2XWXNKXU6QIYUBGAD3.json","view_paper":"https://pith.science/paper/DL5QXIDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0252&json=true","fetch_graph":"https://pith.science/api/pith-number/DL5QXIDO2XWXNKXU6QIYUBGAD3/graph.json","fetch_events":"https://pith.science/api/pith-number/DL5QXIDO2XWXNKXU6QIYUBGAD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DL5QXIDO2XWXNKXU6QIYUBGAD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DL5QXIDO2XWXNKXU6QIYUBGAD3/action/storage_attestation","attest_author":"https://pith.science/pith/DL5QXIDO2XWXNKXU6QIYUBGAD3/action/author_attestation","sign_citation":"https://pith.science/pith/DL5QXIDO2XWXNKXU6QIYUBGAD3/action/citation_signature","submit_replication":"https://pith.science/pith/DL5QXIDO2XWXNKXU6QIYUBGAD3/action/replication_record"}},"created_at":"2026-05-18T03:14:28.404620+00:00","updated_at":"2026-05-18T03:14:28.404620+00:00"}