{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M6IJDWLLNDPH3QILQUOG6C2S43","short_pith_number":"pith:M6IJDWLL","canonical_record":{"source":{"id":"1704.02303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"150bde48d0dc822c83bb763dc9e20b3b4df020dfb0ea8d2cc84fb3f99fdf4c9b","abstract_canon_sha256":"04f064261df7ca37972aedbf69b2ddaa19ce705c28ed007fa0d94c4e55c41a96"},"schema_version":"1.0"},"canonical_sha256":"679091d96b68de7dc10b851c6f0b52e6e54713b5ecfaf22400fbe526440315f5","source":{"kind":"arxiv","id":"1704.02303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02303","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02303v1","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02303","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"M6IJDWLLNDPH","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M6IJDWLLNDPH3QIL","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M6IJDWLL","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M6IJDWLLNDPH3QILQUOG6C2S43","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"150bde48d0dc822c83bb763dc9e20b3b4df020dfb0ea8d2cc84fb3f99fdf4c9b","abstract_canon_sha256":"04f064261df7ca37972aedbf69b2ddaa19ce705c28ed007fa0d94c4e55c41a96"},"schema_version":"1.0"},"canonical_sha256":"679091d96b68de7dc10b851c6f0b52e6e54713b5ecfaf22400fbe526440315f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:50.112936Z","signature_b64":"a7TNDwBnZOfmm34o49Kdyc4dbu//YyK2T+o4lEiY5rtOZcumTUyFoDC0rav5KqFqY1sLE5l4yN3mnhO3VcuPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"679091d96b68de7dc10b851c6f0b52e6e54713b5ecfaf22400fbe526440315f5","last_reissued_at":"2026-05-18T00:46:50.112213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:50.112213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02303","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-18T00:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qaw6WtHBVWCfo8Ujq0COkPEnQfkQoUfgYTLCb9fQdEWF9qWbp6toToVZuTsb6+NBbZEi9bmv4a5a2M034nvaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:51:01.840218Z"},"content_sha256":"2cc806f8e1e7eae773cab643a8ec69dd17da5b018518c6871a6544fa8ee2fab3","schema_version":"1.0","event_id":"sha256:2cc806f8e1e7eae773cab643a8ec69dd17da5b018518c6871a6544fa8ee2fab3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M6IJDWLLNDPH3QILQUOG6C2S43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Stable Matching and Clustering in a Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Eppstein (1), Irvine), Michael T. Goodrich (1), Nil Mamano (1) ((1) University of California","submitted_at":"2017-04-07T17:37:44Z","abstract_excerpt":"We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stably matched to cluster centers, as prioritized by their distances, so that each cluster center is apportioned a set of points of equal area. We show that, for a discretization of the problem to an $n\\times n$ grid of pixels with $k$ centers, the problem can be solved in time $O(n^2 \\log^5 n)$, and we experiment with two slower but more practical algorithms and a hybrid method that switches from one of these algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02303","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-18T00:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwOkqvs0jVYEe+UwCGuckLwoxVASdy7n/oBrqqRxlDH3V0htEx5DE/LMfSHrlaaSRdsbY5SS2HxJyCrAuDxjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:51:01.840583Z"},"content_sha256":"66945e41bac7e84e3241091d6e0ba9035130a7733169cd58c445c83039d1fa59","schema_version":"1.0","event_id":"sha256:66945e41bac7e84e3241091d6e0ba9035130a7733169cd58c445c83039d1fa59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6IJDWLLNDPH3QILQUOG6C2S43/bundle.json","state_url":"https://pith.science/pith/M6IJDWLLNDPH3QILQUOG6C2S43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6IJDWLLNDPH3QILQUOG6C2S43/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-06-04T03:51:01Z","links":{"resolver":"https://pith.science/pith/M6IJDWLLNDPH3QILQUOG6C2S43","bundle":"https://pith.science/pith/M6IJDWLLNDPH3QILQUOG6C2S43/bundle.json","state":"https://pith.science/pith/M6IJDWLLNDPH3QILQUOG6C2S43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6IJDWLLNDPH3QILQUOG6C2S43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M6IJDWLLNDPH3QILQUOG6C2S43","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":"04f064261df7ca37972aedbf69b2ddaa19ce705c28ed007fa0d94c4e55c41a96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:37:44Z","title_canon_sha256":"150bde48d0dc822c83bb763dc9e20b3b4df020dfb0ea8d2cc84fb3f99fdf4c9b"},"schema_version":"1.0","source":{"id":"1704.02303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02303","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02303v1","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02303","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"M6IJDWLLNDPH","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M6IJDWLLNDPH3QIL","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M6IJDWLL","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:66945e41bac7e84e3241091d6e0ba9035130a7733169cd58c445c83039d1fa59","target":"graph","created_at":"2026-05-18T00:46:50Z","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":"We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stably matched to cluster centers, as prioritized by their distances, so that each cluster center is apportioned a set of points of equal area. We show that, for a discretization of the problem to an $n\\times n$ grid of pixels with $k$ centers, the problem can be solved in time $O(n^2 \\log^5 n)$, and we experiment with two slower but more practical algorithms and a hybrid method that switches from one of these algorithms","authors_text":"David Eppstein (1), Irvine), Michael T. Goodrich (1), Nil Mamano (1) ((1) University of California","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:37:44Z","title":"Algorithms for Stable Matching and Clustering in a Grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02303","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:2cc806f8e1e7eae773cab643a8ec69dd17da5b018518c6871a6544fa8ee2fab3","target":"record","created_at":"2026-05-18T00:46:50Z","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":"04f064261df7ca37972aedbf69b2ddaa19ce705c28ed007fa0d94c4e55c41a96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:37:44Z","title_canon_sha256":"150bde48d0dc822c83bb763dc9e20b3b4df020dfb0ea8d2cc84fb3f99fdf4c9b"},"schema_version":"1.0","source":{"id":"1704.02303","kind":"arxiv","version":1}},"canonical_sha256":"679091d96b68de7dc10b851c6f0b52e6e54713b5ecfaf22400fbe526440315f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"679091d96b68de7dc10b851c6f0b52e6e54713b5ecfaf22400fbe526440315f5","first_computed_at":"2026-05-18T00:46:50.112213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:50.112213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a7TNDwBnZOfmm34o49Kdyc4dbu//YyK2T+o4lEiY5rtOZcumTUyFoDC0rav5KqFqY1sLE5l4yN3mnhO3VcuPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:50.112936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cc806f8e1e7eae773cab643a8ec69dd17da5b018518c6871a6544fa8ee2fab3","sha256:66945e41bac7e84e3241091d6e0ba9035130a7733169cd58c445c83039d1fa59"],"state_sha256":"2f6591fc46b9841821d5e4b883e1fafc993076fdf44871cb509a6c5eacd5e1d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B58XvX1eDacROrifo03k94S7WO298yql6q+N8Su1qzkZthIj2g9R8z1/axoUZnIh6mUf3xAHZ8SGGGKTxWnpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:51:01.842544Z","bundle_sha256":"2340ace9cc05441ce396d2c6c0eb1b68cb8c6be177db3e9f9d99b32dfeb4674e"}}