{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HJ4IPSJU2MUYCIQFICJMC3MZFK","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":"29a07d038cb82f199415a746e2975d25634938171dd9560a141e4ad1d4474d94","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-18T10:14:14Z","title_canon_sha256":"5d9d57bfd2acb94efb5c32b4200fc589ae8caeed4254afe8ae2d6c9abd332da7"},"schema_version":"1.0","source":{"id":"1106.3632","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3632","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3632v3","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3632","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"HJ4IPSJU2MUY","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HJ4IPSJU2MUYCIQF","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HJ4IPSJU","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:519e8329fcf89ce6c0649df83416c3d76dc71a09c41e8b27b885b4de8893c32a","target":"graph","created_at":"2026-05-18T01:24:38Z","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 given undirected graph $G$, an \\emph{ordered} subset $S = {s_1,s_2,...,s_k} \\subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in $S$. While a superset of any resolving set is always a resolving set, a proper subset of a resolving set is not necessarily a resolving set, and we are interested in determining resolving sets that are minimal or that are minimum (of minimal cardinality). Let $Q^n$ denote the $n$-dimensional hypercube with vertex set ${0,1}^n$. In Erd\\\"os and Renyi (Erdos & Ren","authors_text":"Ashwin Ganesan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-18T10:14:14Z","title":"Minimal resolving sets for the hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3632","kind":"arxiv","version":3},"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:e4bbe0d68ce2e5ab75e7c37de9cac208fd7c40dd7709ce42d33ca6e15e14e815","target":"record","created_at":"2026-05-18T01:24:38Z","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":"29a07d038cb82f199415a746e2975d25634938171dd9560a141e4ad1d4474d94","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-18T10:14:14Z","title_canon_sha256":"5d9d57bfd2acb94efb5c32b4200fc589ae8caeed4254afe8ae2d6c9abd332da7"},"schema_version":"1.0","source":{"id":"1106.3632","kind":"arxiv","version":3}},"canonical_sha256":"3a7887c934d3298122054092c16d992a8489e1e475a2ee2023e50cc525ea84b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a7887c934d3298122054092c16d992a8489e1e475a2ee2023e50cc525ea84b4","first_computed_at":"2026-05-18T01:24:38.909688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:38.909688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sFIXul9T7IzpXPKcjChf2tq8NSHTZU+p7RpKFABTplPw4fe4SWZRrXCwJ79MZg9o12arx6Q60hNAlVUnnT8jBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:38.910234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3632","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4bbe0d68ce2e5ab75e7c37de9cac208fd7c40dd7709ce42d33ca6e15e14e815","sha256:519e8329fcf89ce6c0649df83416c3d76dc71a09c41e8b27b885b4de8893c32a"],"state_sha256":"e3ee674408bf5b5ed77e3a8b14edf8e06779b22635404866938d69e0b9316c20"}