{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V7F5J6534JOYWMSQXMJYT4QIAK","short_pith_number":"pith:V7F5J653","canonical_record":{"source":{"id":"1907.03197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T22:22:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fbf37b021cef9a871a3ebfd7ad2c749343a9d7e8b3ead346b8495a430d1e36ad","abstract_canon_sha256":"6db5a9cce37a2db4d1dd18cb91ab8241a252921f1a0c2b86f030aefbb30984fc"},"schema_version":"1.0"},"canonical_sha256":"afcbd4fbbbe25d8b3250bb1389f20802bc0ca15936be6394917db8d1c98c0e63","source":{"kind":"arxiv","id":"1907.03197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03197","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03197v1","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03197","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"V7F5J6534JOY","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V7F5J6534JOYWMSQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V7F5J653","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V7F5J6534JOYWMSQXMJYT4QIAK","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T22:22:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fbf37b021cef9a871a3ebfd7ad2c749343a9d7e8b3ead346b8495a430d1e36ad","abstract_canon_sha256":"6db5a9cce37a2db4d1dd18cb91ab8241a252921f1a0c2b86f030aefbb30984fc"},"schema_version":"1.0"},"canonical_sha256":"afcbd4fbbbe25d8b3250bb1389f20802bc0ca15936be6394917db8d1c98c0e63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.657153Z","signature_b64":"q+9Vu3W5qcKcAJl+CAZ7gAZnoSG9+UlUa6HCcQKaL+tqBPbVLSQh3X1TSZumU60w1q6ODd8tjkg/J7Ml0YzOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afcbd4fbbbe25d8b3250bb1389f20802bc0ca15936be6394917db8d1c98c0e63","last_reissued_at":"2026-05-17T23:41:18.656597Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.656597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03197","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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VRW0EFRmVS7YpPjClWFjgWkAi+4NeunqJCk+S2RHoZfTULUp1JQdLAgN4cDjMa/GQgvGRGe7sIsOwPabL+ecDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:06:47.342529Z"},"content_sha256":"1d7020afcf3473e95930d3ab1fcc8e210d692c28b473121828748e4d022c603b","schema_version":"1.0","event_id":"sha256:1d7020afcf3473e95930d3ab1fcc8e210d692c28b473121828748e4d022c603b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V7F5J6534JOYWMSQXMJYT4QIAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Alireza Rezaei, Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan","submitted_at":"2019-07-06T22:22:34Z","abstract_excerpt":"``Composable core-sets'' are an efficient framework for solving optimization problems in massive data models. In this work, we consider efficient construction of composable core-sets for the determinant maximization problem. This can also be cast as the MAP inference task for determinantal point processes, that have recently gained a lot of interest for modeling diversity and fairness. The problem was recently studied in [IMOR'18], where they designed composable core-sets with the optimal approximation bound of $\\tilde O(k)^k$. On the other hand, the more practical Greedy algorithm has been pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03197","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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AffHDh4ZRNnXFL4G+rZqEg2X6LwvEbsR5bWd/B87DiH0l5FSDQ9p9F8NaNdRbrvnUdzlb11bqau2cqyUYD6WAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:06:47.343183Z"},"content_sha256":"7f518ead1a61bc9d8ae6523a83e044172bdeaf06616d30c25b81e2fcda237023","schema_version":"1.0","event_id":"sha256:7f518ead1a61bc9d8ae6523a83e044172bdeaf06616d30c25b81e2fcda237023"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK/bundle.json","state_url":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7F5J6534JOYWMSQXMJYT4QIAK/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-26T05:06:47Z","links":{"resolver":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK","bundle":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK/bundle.json","state":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7F5J6534JOYWMSQXMJYT4QIAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V7F5J6534JOYWMSQXMJYT4QIAK","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":"6db5a9cce37a2db4d1dd18cb91ab8241a252921f1a0c2b86f030aefbb30984fc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T22:22:34Z","title_canon_sha256":"fbf37b021cef9a871a3ebfd7ad2c749343a9d7e8b3ead346b8495a430d1e36ad"},"schema_version":"1.0","source":{"id":"1907.03197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03197","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03197v1","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03197","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"V7F5J6534JOY","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V7F5J6534JOYWMSQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V7F5J653","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:7f518ead1a61bc9d8ae6523a83e044172bdeaf06616d30c25b81e2fcda237023","target":"graph","created_at":"2026-05-17T23:41:18Z","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":"``Composable core-sets'' are an efficient framework for solving optimization problems in massive data models. In this work, we consider efficient construction of composable core-sets for the determinant maximization problem. This can also be cast as the MAP inference task for determinantal point processes, that have recently gained a lot of interest for modeling diversity and fairness. The problem was recently studied in [IMOR'18], where they designed composable core-sets with the optimal approximation bound of $\\tilde O(k)^k$. On the other hand, the more practical Greedy algorithm has been pr","authors_text":"Alireza Rezaei, Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T22:22:34Z","title":"Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03197","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:1d7020afcf3473e95930d3ab1fcc8e210d692c28b473121828748e4d022c603b","target":"record","created_at":"2026-05-17T23:41:18Z","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":"6db5a9cce37a2db4d1dd18cb91ab8241a252921f1a0c2b86f030aefbb30984fc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T22:22:34Z","title_canon_sha256":"fbf37b021cef9a871a3ebfd7ad2c749343a9d7e8b3ead346b8495a430d1e36ad"},"schema_version":"1.0","source":{"id":"1907.03197","kind":"arxiv","version":1}},"canonical_sha256":"afcbd4fbbbe25d8b3250bb1389f20802bc0ca15936be6394917db8d1c98c0e63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afcbd4fbbbe25d8b3250bb1389f20802bc0ca15936be6394917db8d1c98c0e63","first_computed_at":"2026-05-17T23:41:18.656597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:18.656597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q+9Vu3W5qcKcAJl+CAZ7gAZnoSG9+UlUa6HCcQKaL+tqBPbVLSQh3X1TSZumU60w1q6ODd8tjkg/J7Ml0YzOBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:18.657153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d7020afcf3473e95930d3ab1fcc8e210d692c28b473121828748e4d022c603b","sha256:7f518ead1a61bc9d8ae6523a83e044172bdeaf06616d30c25b81e2fcda237023"],"state_sha256":"436b2848ba75b8ed9d98ab40b0d6d0a9c2953abcbfe2a1988aae0b153b6ddea8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PybN2gC33rDGJhJ6LYr+/HMGAP+4hBW56X/v4f1nfXPJsH2Hgc9oghIHTVYrczzEvtU/WoacpsC1TP8DlCgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:06:47.346531Z","bundle_sha256":"5d7334189a947a18b1bc7bb27d56f37e94259ec70ee584f88571604b18822259"}}