{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KK5EQ4FBYHDFT3CBEUDZLCBAMK","short_pith_number":"pith:KK5EQ4FB","schema_version":"1.0","canonical_sha256":"52ba4870a1c1c659ec412507958820629476568bd00c6dde92cf595cacdabd7f","source":{"kind":"arxiv","id":"1409.4510","version":1},"attestation_state":"computed","paper":{"title":"Minimum Weight Resolving Sets of Grid Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cyriac Grigorious, Mirka Miller, Patrick Andersen","submitted_at":"2014-09-16T05:25:14Z","abstract_excerpt":"For a simple graph $G=(V,E)$ and for a pair of vertices $u,v \\in V$, we say that a vertex $w \\in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different length than the shortest path from $w$ to $v$. A set of vertices ${R \\subseteq V}$ is a resolving set if for every pair of vertices $u$ and $v$ in $G$, there exists a vertex $w \\in R$ that resolves $u$ and $v$. The minimum weight resolving set problem is to find a resolving set $M$ for a weighted graph $G$ such that$\\sum_{v \\in M} w(v)$ is minimum, where $w(v)$ is the weight of vertex $v$. In this paper, we explore the p"},"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":"1409.4510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T05:25:14Z","cross_cats_sorted":[],"title_canon_sha256":"0040e22bf90c66877668c34c9b1ed194e0763b4f8abd435797e327377f518059","abstract_canon_sha256":"2cbbc82f01463b314ef8c96b233d02925cbe0d6be5be52678918ab7edb0bd08d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:01.932882Z","signature_b64":"vcVDn7jtsxtA2f1kjrzpjrn0etj1pM/K2T2mrKAPgveTSVjmRVO3Q2yCEn9MU5EYJo1n4bubB5yJhsDZuYmJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52ba4870a1c1c659ec412507958820629476568bd00c6dde92cf595cacdabd7f","last_reissued_at":"2026-05-18T01:12:01.932501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:01.932501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Weight Resolving Sets of Grid Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cyriac Grigorious, Mirka Miller, Patrick Andersen","submitted_at":"2014-09-16T05:25:14Z","abstract_excerpt":"For a simple graph $G=(V,E)$ and for a pair of vertices $u,v \\in V$, we say that a vertex $w \\in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different length than the shortest path from $w$ to $v$. A set of vertices ${R \\subseteq V}$ is a resolving set if for every pair of vertices $u$ and $v$ in $G$, there exists a vertex $w \\in R$ that resolves $u$ and $v$. The minimum weight resolving set problem is to find a resolving set $M$ for a weighted graph $G$ such that$\\sum_{v \\in M} w(v)$ is minimum, where $w(v)$ is the weight of vertex $v$. In this paper, we explore the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4510","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":"1409.4510","created_at":"2026-05-18T01:12:01.932556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4510v1","created_at":"2026-05-18T01:12:01.932556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4510","created_at":"2026-05-18T01:12:01.932556+00:00"},{"alias_kind":"pith_short_12","alias_value":"KK5EQ4FBYHDF","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KK5EQ4FBYHDFT3CB","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KK5EQ4FB","created_at":"2026-05-18T12:28:35.611951+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/KK5EQ4FBYHDFT3CBEUDZLCBAMK","json":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK.json","graph_json":"https://pith.science/api/pith-number/KK5EQ4FBYHDFT3CBEUDZLCBAMK/graph.json","events_json":"https://pith.science/api/pith-number/KK5EQ4FBYHDFT3CBEUDZLCBAMK/events.json","paper":"https://pith.science/paper/KK5EQ4FB"},"agent_actions":{"view_html":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK","download_json":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK.json","view_paper":"https://pith.science/paper/KK5EQ4FB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4510&json=true","fetch_graph":"https://pith.science/api/pith-number/KK5EQ4FBYHDFT3CBEUDZLCBAMK/graph.json","fetch_events":"https://pith.science/api/pith-number/KK5EQ4FBYHDFT3CBEUDZLCBAMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/action/storage_attestation","attest_author":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/action/author_attestation","sign_citation":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/action/citation_signature","submit_replication":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/action/replication_record"}},"created_at":"2026-05-18T01:12:01.932556+00:00","updated_at":"2026-05-18T01:12:01.932556+00:00"}