{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4KV43SXMF5ZVIPN3VY4ZBKD3WO","short_pith_number":"pith:4KV43SXM","schema_version":"1.0","canonical_sha256":"e2abcdcaec2f73543dbbae3990a87bb3a46f35ed795631a8bd480baf82b6f458","source":{"kind":"arxiv","id":"2206.15424","version":3},"attestation_state":"computed","paper":{"title":"Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Esther Galby, Fionn Mc Inerney, Liana Khazaliya, Prafullkumar Tale, Roohani Sharma","submitted_at":"2022-06-30T17:17:13Z","abstract_excerpt":"For a graph $G$, a subset $S \\subseteq V(G)$ is called a \\emph{resolving set} if for any two vertices $u,v \\in V(G)$, there exists a vertex $w \\in S$ such that $d(w,u) \\neq d(w,v)$. The {\\sc Metric Dimension} problem takes as input a graph $G$ and a positive integer $k$, and asks whether there exists a resolving set of size at most $k$. This problem was introduced in the 1970s and is known to be \\NP-hard~[GT~61 in Garey and Johnson's book]. In the realm of parameterized complexity, Hartung and Nichterlein~[CCC~2013] proved that the problem is \\W[2]-hard when parameterized by the natural parame"},"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":"2206.15424","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2022-06-30T17:17:13Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"870653c4b482d3ec8238a3ec4e26bb8f31c9f686294ee082f67a101dee88413c","abstract_canon_sha256":"e0464470af199b9c10e488e80e5a6c364f694aade3cc89cb78b63b4c2d2a80a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:16.938853Z","signature_b64":"PXsWNY+Z6bQC5XX969BcpTUcQVXag66LujjG/pGX41CxNVNljfMQho9fdNdspWuLuWnaowyNIDqplRHB9uKNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2abcdcaec2f73543dbbae3990a87bb3a46f35ed795631a8bd480baf82b6f458","last_reissued_at":"2026-07-05T06:18:16.938383Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:16.938383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Esther Galby, Fionn Mc Inerney, Liana Khazaliya, Prafullkumar Tale, Roohani Sharma","submitted_at":"2022-06-30T17:17:13Z","abstract_excerpt":"For a graph $G$, a subset $S \\subseteq V(G)$ is called a \\emph{resolving set} if for any two vertices $u,v \\in V(G)$, there exists a vertex $w \\in S$ such that $d(w,u) \\neq d(w,v)$. The {\\sc Metric Dimension} problem takes as input a graph $G$ and a positive integer $k$, and asks whether there exists a resolving set of size at most $k$. This problem was introduced in the 1970s and is known to be \\NP-hard~[GT~61 in Garey and Johnson's book]. In the realm of parameterized complexity, Hartung and Nichterlein~[CCC~2013] proved that the problem is \\W[2]-hard when parameterized by the natural parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.15424","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.15424/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2206.15424","created_at":"2026-07-05T06:18:16.938445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.15424v3","created_at":"2026-07-05T06:18:16.938445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.15424","created_at":"2026-07-05T06:18:16.938445+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KV43SXMF5ZV","created_at":"2026-07-05T06:18:16.938445+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KV43SXMF5ZVIPN3","created_at":"2026-07-05T06:18:16.938445+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KV43SXM","created_at":"2026-07-05T06:18:16.938445+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/4KV43SXMF5ZVIPN3VY4ZBKD3WO","json":"https://pith.science/pith/4KV43SXMF5ZVIPN3VY4ZBKD3WO.json","graph_json":"https://pith.science/api/pith-number/4KV43SXMF5ZVIPN3VY4ZBKD3WO/graph.json","events_json":"https://pith.science/api/pith-number/4KV43SXMF5ZVIPN3VY4ZBKD3WO/events.json","paper":"https://pith.science/paper/4KV43SXM"},"agent_actions":{"view_html":"https://pith.science/pith/4KV43SXMF5ZVIPN3VY4ZBKD3WO","download_json":"https://pith.science/pith/4KV43SXMF5ZVIPN3VY4ZBKD3WO.json","view_paper":"https://pith.science/paper/4KV43SXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.15424&json=true","fetch_graph":"https://pith.science/api/pith-number/4KV43SXMF5ZVIPN3VY4ZBKD3WO/graph.json","fetch_events":"https://pith.science/api/pith-number/4KV43SXMF5ZVIPN3VY4ZBKD3WO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KV43SXMF5ZVIPN3VY4ZBKD3WO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KV43SXMF5ZVIPN3VY4ZBKD3WO/action/storage_attestation","attest_author":"https://pith.science/pith/4KV43SXMF5ZVIPN3VY4ZBKD3WO/action/author_attestation","sign_citation":"https://pith.science/pith/4KV43SXMF5ZVIPN3VY4ZBKD3WO/action/citation_signature","submit_replication":"https://pith.science/pith/4KV43SXMF5ZVIPN3VY4ZBKD3WO/action/replication_record"}},"created_at":"2026-07-05T06:18:16.938445+00:00","updated_at":"2026-07-05T06:18:16.938445+00:00"}