{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2NNJHVRLMP3PEVIVUSBFUEMOWZ","short_pith_number":"pith:2NNJHVRL","canonical_record":{"source":{"id":"1810.08047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-18T13:42:04Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"777007cc55850f2f88c2b6eb2f8ed37b5dd286e408205e71fc57461f9829e380","abstract_canon_sha256":"64db0fe1a869f6c9432bd038af53baea3f59bf1789197f13c8250b4f65e8cdd6"},"schema_version":"1.0"},"canonical_sha256":"d35a93d62b63f6f25515a4825a118eb645318cba00cb25965c7b93c39ec98af6","source":{"kind":"arxiv","id":"1810.08047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08047","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08047v1","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08047","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"2NNJHVRLMP3P","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2NNJHVRLMP3PEVIV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2NNJHVRL","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2NNJHVRLMP3PEVIVUSBFUEMOWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.08047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-18T13:42:04Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"777007cc55850f2f88c2b6eb2f8ed37b5dd286e408205e71fc57461f9829e380","abstract_canon_sha256":"64db0fe1a869f6c9432bd038af53baea3f59bf1789197f13c8250b4f65e8cdd6"},"schema_version":"1.0"},"canonical_sha256":"d35a93d62b63f6f25515a4825a118eb645318cba00cb25965c7b93c39ec98af6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:50.704098Z","signature_b64":"7/k9OiZtKXYJyCR/ReqaanzpiZUDQSK0AXpLl0RPuqUnuraSzsU+Gh9DGNTMmOLqp4Qtn8+V05wWwloaZ7MRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d35a93d62b63f6f25515a4825a118eb645318cba00cb25965c7b93c39ec98af6","last_reissued_at":"2026-05-18T00:02:50.703678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:50.703678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.08047","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:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"flKKMFCmo0TyBWtxEhDY1ZVKa/Ovh2ADU+HjfsZJ2AzJm1w1AQ4GLDj7VO1vSg7Ri5lP7lopNnQFZjfvxjFDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:59:29.415605Z"},"content_sha256":"29d54b5dbc0b844ad17cfb175832aa214f271ba4103307d53326799eb75b79a3","schema_version":"1.0","event_id":"sha256:29d54b5dbc0b844ad17cfb175832aa214f271ba4103307d53326799eb75b79a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2NNJHVRLMP3PEVIVUSBFUEMOWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Average Regret Ratio Minimizing Set in Database","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.DB","authors_text":"Raymong Chi-Wing Wong, Sepanta Zeighami","submitted_at":"2018-10-18T13:42:04Z","abstract_excerpt":"Selecting a certain number of data points (or records) from a database which \"best\" satisfy users' expectations is a very prevalent problem with many applications. One application is a hotel booking website showing a certain number of hotels on a single page. However, this problem is very challenging since the selected points should \"collectively\" satisfy the expectation of all users. Showing a certain number of data points to a single user could decrease the satisfaction of a user because the user may not be able to see his/her favorite point which could be found in the original database. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08047","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:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UVO+ujVvK8eIXvQ9pRVswdKMVqCkKr+HRECxrYTy+EXQ+3jQr3lbB9sSBynmXsioH+XbHiKLpir2XTGsedJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:59:29.416236Z"},"content_sha256":"8310b556a323bfdd3fe6d2c0bbfeb3d7763d0887c026f721e51845a0d4da0072","schema_version":"1.0","event_id":"sha256:8310b556a323bfdd3fe6d2c0bbfeb3d7763d0887c026f721e51845a0d4da0072"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NNJHVRLMP3PEVIVUSBFUEMOWZ/bundle.json","state_url":"https://pith.science/pith/2NNJHVRLMP3PEVIVUSBFUEMOWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NNJHVRLMP3PEVIVUSBFUEMOWZ/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-03T12:59:29Z","links":{"resolver":"https://pith.science/pith/2NNJHVRLMP3PEVIVUSBFUEMOWZ","bundle":"https://pith.science/pith/2NNJHVRLMP3PEVIVUSBFUEMOWZ/bundle.json","state":"https://pith.science/pith/2NNJHVRLMP3PEVIVUSBFUEMOWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NNJHVRLMP3PEVIVUSBFUEMOWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2NNJHVRLMP3PEVIVUSBFUEMOWZ","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":"64db0fe1a869f6c9432bd038af53baea3f59bf1789197f13c8250b4f65e8cdd6","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-18T13:42:04Z","title_canon_sha256":"777007cc55850f2f88c2b6eb2f8ed37b5dd286e408205e71fc57461f9829e380"},"schema_version":"1.0","source":{"id":"1810.08047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08047","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08047v1","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08047","created_at":"2026-05-18T00:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"2NNJHVRLMP3P","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2NNJHVRLMP3PEVIV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2NNJHVRL","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:8310b556a323bfdd3fe6d2c0bbfeb3d7763d0887c026f721e51845a0d4da0072","target":"graph","created_at":"2026-05-18T00:02: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":"Selecting a certain number of data points (or records) from a database which \"best\" satisfy users' expectations is a very prevalent problem with many applications. One application is a hotel booking website showing a certain number of hotels on a single page. However, this problem is very challenging since the selected points should \"collectively\" satisfy the expectation of all users. Showing a certain number of data points to a single user could decrease the satisfaction of a user because the user may not be able to see his/her favorite point which could be found in the original database. In ","authors_text":"Raymong Chi-Wing Wong, Sepanta Zeighami","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-18T13:42:04Z","title":"Finding Average Regret Ratio Minimizing Set in Database"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08047","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:29d54b5dbc0b844ad17cfb175832aa214f271ba4103307d53326799eb75b79a3","target":"record","created_at":"2026-05-18T00:02: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":"64db0fe1a869f6c9432bd038af53baea3f59bf1789197f13c8250b4f65e8cdd6","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-18T13:42:04Z","title_canon_sha256":"777007cc55850f2f88c2b6eb2f8ed37b5dd286e408205e71fc57461f9829e380"},"schema_version":"1.0","source":{"id":"1810.08047","kind":"arxiv","version":1}},"canonical_sha256":"d35a93d62b63f6f25515a4825a118eb645318cba00cb25965c7b93c39ec98af6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d35a93d62b63f6f25515a4825a118eb645318cba00cb25965c7b93c39ec98af6","first_computed_at":"2026-05-18T00:02:50.703678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:50.703678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7/k9OiZtKXYJyCR/ReqaanzpiZUDQSK0AXpLl0RPuqUnuraSzsU+Gh9DGNTMmOLqp4Qtn8+V05wWwloaZ7MRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:50.704098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29d54b5dbc0b844ad17cfb175832aa214f271ba4103307d53326799eb75b79a3","sha256:8310b556a323bfdd3fe6d2c0bbfeb3d7763d0887c026f721e51845a0d4da0072"],"state_sha256":"01f96cd3ef041dd6968d7d811cb46ed41ad01a7e801855901cd23bea38e3ae16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuVoyks5K1saS0dz3vu3ozCkvQ2KvvQIBMMnReqcG6sIJndb7UZpFnhhsMuyGBMZ91J7u4Xv09wqv5pb7aSNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:59:29.419711Z","bundle_sha256":"3ae3949bcbc7628a75f50f46b2cfa5fcd07c5a869a752fee0ed86052d6aa4fe3"}}