{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:V7F5J6534JOYWMSQXMJYT4QIAK","short_pith_number":"pith:V7F5J653","schema_version":"1.0","canonical_sha256":"afcbd4fbbbe25d8b3250bb1389f20802bc0ca15936be6394917db8d1c98c0e63","source":{"kind":"arxiv","id":"1907.03197","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.03197","created_at":"2026-05-17T23:41:18.656698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03197v1","created_at":"2026-05-17T23:41:18.656698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03197","created_at":"2026-05-17T23:41:18.656698+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7F5J6534JOY","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7F5J6534JOYWMSQ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7F5J653","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK","json":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK.json","graph_json":"https://pith.science/api/pith-number/V7F5J6534JOYWMSQXMJYT4QIAK/graph.json","events_json":"https://pith.science/api/pith-number/V7F5J6534JOYWMSQXMJYT4QIAK/events.json","paper":"https://pith.science/paper/V7F5J653"},"agent_actions":{"view_html":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK","download_json":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK.json","view_paper":"https://pith.science/paper/V7F5J653","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03197&json=true","fetch_graph":"https://pith.science/api/pith-number/V7F5J6534JOYWMSQXMJYT4QIAK/graph.json","fetch_events":"https://pith.science/api/pith-number/V7F5J6534JOYWMSQXMJYT4QIAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK/action/storage_attestation","attest_author":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK/action/author_attestation","sign_citation":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK/action/citation_signature","submit_replication":"https://pith.science/pith/V7F5J6534JOYWMSQXMJYT4QIAK/action/replication_record"}},"created_at":"2026-05-17T23:41:18.656698+00:00","updated_at":"2026-05-17T23:41:18.656698+00:00"}