{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:H7MF3PNKGTJ4AL52BY6PA5LOXW","short_pith_number":"pith:H7MF3PNK","canonical_record":{"source":{"id":"1607.04557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T15:38:02Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"e01e6b45272267ddff8ef44a3be96257819f95db1b08c6e767d6740077bdc0db","abstract_canon_sha256":"0a8fff6519efd6559d5277f35539ef27003eff1e5a04bca7096fd7e65cc75779"},"schema_version":"1.0"},"canonical_sha256":"3fd85dbdaa34d3c02fba0e3cf0756ebda134d57cf96e58d70eb0ddd148055ba3","source":{"kind":"arxiv","id":"1607.04557","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04557","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04557v1","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04557","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"H7MF3PNKGTJ4","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H7MF3PNKGTJ4AL52","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H7MF3PNK","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:H7MF3PNKGTJ4AL52BY6PA5LOXW","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T15:38:02Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"e01e6b45272267ddff8ef44a3be96257819f95db1b08c6e767d6740077bdc0db","abstract_canon_sha256":"0a8fff6519efd6559d5277f35539ef27003eff1e5a04bca7096fd7e65cc75779"},"schema_version":"1.0"},"canonical_sha256":"3fd85dbdaa34d3c02fba0e3cf0756ebda134d57cf96e58d70eb0ddd148055ba3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:00.882964Z","signature_b64":"87qhJdhegX/XMcz+4/AveATmGNheHpU5bTRhCBK9SzIC1LH/cvO9hAv4crZk1RpkGUd3By0I0oc5ZEgLyWWJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fd85dbdaa34d3c02fba0e3cf0756ebda134d57cf96e58d70eb0ddd148055ba3","last_reissued_at":"2026-05-18T01:11:00.882509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:00.882509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04557","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:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdRWISWFucMNzKyvKctG1dTejFoNQd+cupLCFQ2C4+P2oJ1BzKf0fTXYgQBQAWKMj+itIjoAQHQYbvk42kT+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:54:42.927795Z"},"content_sha256":"56a69ec80858a2cb0859f0049042c1e02ec10006d81097fc35a0b136139530cb","schema_version":"1.0","event_id":"sha256:56a69ec80858a2cb0859f0049042c1e02ec10006d81097fc35a0b136139530cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:H7MF3PNKGTJ4AL52BY6PA5LOXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Search for Max-Sum Diversification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen","submitted_at":"2016-07-15T15:38:02Z","abstract_excerpt":"We provide simple and fast polynomial time approximation schemes (PTASs) for several variants of the max-sum diversification problem which, in its most basic form, is as follows: Given n points p_1,...,p_n in R^d and an integer k, select k points such that the average Euclidean distance between these points is maximized. This problem commonly appears in information retrieval and web-search in order to select a diverse set of points from the input. In this context, it has recently received a lot of attention.\n  We present new techniques to analyze natural local search algorithms. This leads to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04557","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:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIcu0KRlzWmWxztajIzzaBSHNxJ6SLPZwdbOnDFnOGvfG3OxotiPZXwnU0fSEYcNj7VrqQiqKvtfXGIG23kZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:54:42.928147Z"},"content_sha256":"2bd39097476fa0b5e9a120ea153be76d7c7f39c8029791bfa4c6a49828a33060","schema_version":"1.0","event_id":"sha256:2bd39097476fa0b5e9a120ea153be76d7c7f39c8029791bfa4c6a49828a33060"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7MF3PNKGTJ4AL52BY6PA5LOXW/bundle.json","state_url":"https://pith.science/pith/H7MF3PNKGTJ4AL52BY6PA5LOXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7MF3PNKGTJ4AL52BY6PA5LOXW/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-30T23:54:42Z","links":{"resolver":"https://pith.science/pith/H7MF3PNKGTJ4AL52BY6PA5LOXW","bundle":"https://pith.science/pith/H7MF3PNKGTJ4AL52BY6PA5LOXW/bundle.json","state":"https://pith.science/pith/H7MF3PNKGTJ4AL52BY6PA5LOXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7MF3PNKGTJ4AL52BY6PA5LOXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:H7MF3PNKGTJ4AL52BY6PA5LOXW","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":"0a8fff6519efd6559d5277f35539ef27003eff1e5a04bca7096fd7e65cc75779","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T15:38:02Z","title_canon_sha256":"e01e6b45272267ddff8ef44a3be96257819f95db1b08c6e767d6740077bdc0db"},"schema_version":"1.0","source":{"id":"1607.04557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04557","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04557v1","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04557","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"H7MF3PNKGTJ4","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H7MF3PNKGTJ4AL52","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H7MF3PNK","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:2bd39097476fa0b5e9a120ea153be76d7c7f39c8029791bfa4c6a49828a33060","target":"graph","created_at":"2026-05-18T01:11:00Z","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 provide simple and fast polynomial time approximation schemes (PTASs) for several variants of the max-sum diversification problem which, in its most basic form, is as follows: Given n points p_1,...,p_n in R^d and an integer k, select k points such that the average Euclidean distance between these points is maximized. This problem commonly appears in information retrieval and web-search in order to select a diverse set of points from the input. In this context, it has recently received a lot of attention.\n  We present new techniques to analyze natural local search algorithms. This leads to ","authors_text":"Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T15:38:02Z","title":"Local Search for Max-Sum Diversification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04557","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:56a69ec80858a2cb0859f0049042c1e02ec10006d81097fc35a0b136139530cb","target":"record","created_at":"2026-05-18T01:11:00Z","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":"0a8fff6519efd6559d5277f35539ef27003eff1e5a04bca7096fd7e65cc75779","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T15:38:02Z","title_canon_sha256":"e01e6b45272267ddff8ef44a3be96257819f95db1b08c6e767d6740077bdc0db"},"schema_version":"1.0","source":{"id":"1607.04557","kind":"arxiv","version":1}},"canonical_sha256":"3fd85dbdaa34d3c02fba0e3cf0756ebda134d57cf96e58d70eb0ddd148055ba3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fd85dbdaa34d3c02fba0e3cf0756ebda134d57cf96e58d70eb0ddd148055ba3","first_computed_at":"2026-05-18T01:11:00.882509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:00.882509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"87qhJdhegX/XMcz+4/AveATmGNheHpU5bTRhCBK9SzIC1LH/cvO9hAv4crZk1RpkGUd3By0I0oc5ZEgLyWWJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:00.882964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56a69ec80858a2cb0859f0049042c1e02ec10006d81097fc35a0b136139530cb","sha256:2bd39097476fa0b5e9a120ea153be76d7c7f39c8029791bfa4c6a49828a33060"],"state_sha256":"9079150c5a1a9e65deb6b1099ed89c7c7e44b098936659ba8b965fe5f92eeeb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nt2Nf+pyImSEgdWUDm/2YtaZQuIB6tkSmR3hjVUqHijD95x9cAn4vwlOuRrTUPP9oydWzyHLy/EJOcnZjRphBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:54:42.930252Z","bundle_sha256":"db60f36a072ea17141a164439748926b28f8e5146aa3f7a09e56d671deaa8c2e"}}