{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KK5EQ4FBYHDFT3CBEUDZLCBAMK","short_pith_number":"pith:KK5EQ4FB","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"},"canonical_sha256":"52ba4870a1c1c659ec412507958820629476568bd00c6dde92cf595cacdabd7f","source":{"kind":"arxiv","id":"1409.4510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4510","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4510v1","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4510","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"KK5EQ4FBYHDF","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KK5EQ4FBYHDFT3CB","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KK5EQ4FB","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KK5EQ4FBYHDFT3CBEUDZLCBAMK","target":"record","payload":{"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"},"canonical_sha256":"52ba4870a1c1c659ec412507958820629476568bd00c6dde92cf595cacdabd7f","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"},"source_kind":"arxiv","source_id":"1409.4510","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBPNuKe9p39cl5RoRG3mvmZEkFErscAF3bh3cjhDlcO99OXBY4Q5LGGoiVxwWcIAct0KYKaJgu7xSx7/c1nmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:18:59.839521Z"},"content_sha256":"3d2dc28d0c1c12154fdb72f69b11b3ea1ac467b8c0b5634fd441978bdd804008","schema_version":"1.0","event_id":"sha256:3d2dc28d0c1c12154fdb72f69b11b3ea1ac467b8c0b5634fd441978bdd804008"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KK5EQ4FBYHDFT3CBEUDZLCBAMK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6skB0LSirVwQBTm65OiDYT/KzenqERtHBBeRzcZVZXaSWG7uJcFj18La3o63sDpSKSgXbwBlin2e1i0gmNpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:18:59.840187Z"},"content_sha256":"44b798fc7ab3f9aa93adbe92882c23bd0ef7219034f244523d7149ca88132e7e","schema_version":"1.0","event_id":"sha256:44b798fc7ab3f9aa93adbe92882c23bd0ef7219034f244523d7149ca88132e7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/bundle.json","state_url":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T17:18:59Z","links":{"resolver":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK","bundle":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/bundle.json","state":"https://pith.science/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KK5EQ4FBYHDFT3CBEUDZLCBAMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KK5EQ4FBYHDFT3CBEUDZLCBAMK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2cbbc82f01463b314ef8c96b233d02925cbe0d6be5be52678918ab7edb0bd08d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T05:25:14Z","title_canon_sha256":"0040e22bf90c66877668c34c9b1ed194e0763b4f8abd435797e327377f518059"},"schema_version":"1.0","source":{"id":"1409.4510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4510","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4510v1","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4510","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"KK5EQ4FBYHDF","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KK5EQ4FBYHDFT3CB","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KK5EQ4FB","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:44b798fc7ab3f9aa93adbe92882c23bd0ef7219034f244523d7149ca88132e7e","target":"graph","created_at":"2026-05-18T01:12:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Cyriac Grigorious, Mirka Miller, Patrick Andersen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T05:25:14Z","title":"Minimum Weight Resolving Sets of Grid Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4510","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3d2dc28d0c1c12154fdb72f69b11b3ea1ac467b8c0b5634fd441978bdd804008","target":"record","created_at":"2026-05-18T01:12:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2cbbc82f01463b314ef8c96b233d02925cbe0d6be5be52678918ab7edb0bd08d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T05:25:14Z","title_canon_sha256":"0040e22bf90c66877668c34c9b1ed194e0763b4f8abd435797e327377f518059"},"schema_version":"1.0","source":{"id":"1409.4510","kind":"arxiv","version":1}},"canonical_sha256":"52ba4870a1c1c659ec412507958820629476568bd00c6dde92cf595cacdabd7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52ba4870a1c1c659ec412507958820629476568bd00c6dde92cf595cacdabd7f","first_computed_at":"2026-05-18T01:12:01.932501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:01.932501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vcVDn7jtsxtA2f1kjrzpjrn0etj1pM/K2T2mrKAPgveTSVjmRVO3Q2yCEn9MU5EYJo1n4bubB5yJhsDZuYmJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:01.932882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d2dc28d0c1c12154fdb72f69b11b3ea1ac467b8c0b5634fd441978bdd804008","sha256:44b798fc7ab3f9aa93adbe92882c23bd0ef7219034f244523d7149ca88132e7e"],"state_sha256":"7369a4d7fe34407e559fed61d20be3576f595e1e2f249ac662ec90a3367aa21d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"La5uWAnPpqCP0izbdgXYyLdzWEr33wc/AHB2483MZ/rAwR/fXmRfft/jMl+00VyqbktjMqvoZ99JPzAayNlUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:18:59.844427Z","bundle_sha256":"e24360a54f41b0131359d110c954b6ea6854aca94d52da54b9d4ea05274fdde3"}}