{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BOVKX3LZTEICAMQ255MFFDRT5H","short_pith_number":"pith:BOVKX3LZ","canonical_record":{"source":{"id":"2309.15286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-26T21:46:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"85cf4384d9a8be440ed208dee1fbd6f96575bf5ec2ca21f6f4f55eccc8912696","abstract_canon_sha256":"cabf92a085b36cf244594101937d766b2dd7f2206b815723bde3debe410b804d"},"schema_version":"1.0"},"canonical_sha256":"0baaabed79991020321aef58528e33e9c57e681a2d3dc89ba2aaeeea12c414b3","source":{"kind":"arxiv","id":"2309.15286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.15286","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"arxiv_version","alias_value":"2309.15286v1","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15286","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"pith_short_12","alias_value":"BOVKX3LZTEIC","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"pith_short_16","alias_value":"BOVKX3LZTEICAMQ2","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"pith_short_8","alias_value":"BOVKX3LZ","created_at":"2026-07-05T06:54:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BOVKX3LZTEICAMQ255MFFDRT5H","target":"record","payload":{"canonical_record":{"source":{"id":"2309.15286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-26T21:46:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"85cf4384d9a8be440ed208dee1fbd6f96575bf5ec2ca21f6f4f55eccc8912696","abstract_canon_sha256":"cabf92a085b36cf244594101937d766b2dd7f2206b815723bde3debe410b804d"},"schema_version":"1.0"},"canonical_sha256":"0baaabed79991020321aef58528e33e9c57e681a2d3dc89ba2aaeeea12c414b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:43.820009Z","signature_b64":"qEzY7/WNadpn3eAniS7h+wNoYW3oYgM1RBAYGxNP86h7G2rElLgch6LB2VEApGf+j12PFKwsmoUz8ci6uPFrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0baaabed79991020321aef58528e33e9c57e681a2d3dc89ba2aaeeea12c414b3","last_reissued_at":"2026-07-05T06:54:43.819663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:43.819663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.15286","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-07-05T06:54:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JaAmxvrdMfR+W3iPRrnnoqO3UtTx6ejZpy/jQF0GY+8lBW5hcASKLX/haBFiSy1ysoYUH42/tFFGZCTZa4sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:55:42.794206Z"},"content_sha256":"19cfd41ef951954226d8505efc29cf066c4a2883b2d76d9dc4b3fbe273604eae","schema_version":"1.0","event_id":"sha256:19cfd41ef951954226d8505efc29cf066c4a2883b2d76d9dc4b3fbe273604eae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BOVKX3LZTEICAMQ255MFFDRT5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Composable Coresets for Determinant Maximization: Greedy is Almost Optimal","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Sepideh Mahabadi, Siddharth Gollapudi, Varun Sivashankar","submitted_at":"2023-09-26T21:46:44Z","abstract_excerpt":"Given a set of $n$ vectors in $\\mathbb{R}^d$, the goal of the \\emph{determinant maximization} problem is to pick $k$ vectors with the maximum volume. Determinant maximization is the MAP-inference task for determinantal point processes (DPP) and has recently received considerable attention for modeling diversity. As most applications for the problem use large amounts of data, this problem has been studied in the relevant \\textit{composable coreset} setting. In particular, [Indyk-Mahabadi-OveisGharan-Rezaei--SODA'20, ICML'19] showed that one can get composable coresets with optimal approximation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15286","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.15286/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:54:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRoB3hC9eB2SF3imLAVDCiVI//m3ZQro7VIHIEoNU9h8qsbPrC8VZZR28bmL2FUvGamPp+KZldDmMxGSY6PnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:55:42.794592Z"},"content_sha256":"d2fb3e08f1ecdddee97fc015cbb68379083b1f465bf5ac639a0d755c24ccf491","schema_version":"1.0","event_id":"sha256:d2fb3e08f1ecdddee97fc015cbb68379083b1f465bf5ac639a0d755c24ccf491"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOVKX3LZTEICAMQ255MFFDRT5H/bundle.json","state_url":"https://pith.science/pith/BOVKX3LZTEICAMQ255MFFDRT5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOVKX3LZTEICAMQ255MFFDRT5H/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-07-07T11:55:42Z","links":{"resolver":"https://pith.science/pith/BOVKX3LZTEICAMQ255MFFDRT5H","bundle":"https://pith.science/pith/BOVKX3LZTEICAMQ255MFFDRT5H/bundle.json","state":"https://pith.science/pith/BOVKX3LZTEICAMQ255MFFDRT5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOVKX3LZTEICAMQ255MFFDRT5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BOVKX3LZTEICAMQ255MFFDRT5H","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":"cabf92a085b36cf244594101937d766b2dd7f2206b815723bde3debe410b804d","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-26T21:46:44Z","title_canon_sha256":"85cf4384d9a8be440ed208dee1fbd6f96575bf5ec2ca21f6f4f55eccc8912696"},"schema_version":"1.0","source":{"id":"2309.15286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.15286","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"arxiv_version","alias_value":"2309.15286v1","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15286","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"pith_short_12","alias_value":"BOVKX3LZTEIC","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"pith_short_16","alias_value":"BOVKX3LZTEICAMQ2","created_at":"2026-07-05T06:54:43Z"},{"alias_kind":"pith_short_8","alias_value":"BOVKX3LZ","created_at":"2026-07-05T06:54:43Z"}],"graph_snapshots":[{"event_id":"sha256:d2fb3e08f1ecdddee97fc015cbb68379083b1f465bf5ac639a0d755c24ccf491","target":"graph","created_at":"2026-07-05T06:54:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.15286/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a set of $n$ vectors in $\\mathbb{R}^d$, the goal of the \\emph{determinant maximization} problem is to pick $k$ vectors with the maximum volume. Determinant maximization is the MAP-inference task for determinantal point processes (DPP) and has recently received considerable attention for modeling diversity. As most applications for the problem use large amounts of data, this problem has been studied in the relevant \\textit{composable coreset} setting. In particular, [Indyk-Mahabadi-OveisGharan-Rezaei--SODA'20, ICML'19] showed that one can get composable coresets with optimal approximation","authors_text":"Sepideh Mahabadi, Siddharth Gollapudi, Varun Sivashankar","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-26T21:46:44Z","title":"Composable Coresets for Determinant Maximization: Greedy is Almost Optimal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15286","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:19cfd41ef951954226d8505efc29cf066c4a2883b2d76d9dc4b3fbe273604eae","target":"record","created_at":"2026-07-05T06:54:43Z","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":"cabf92a085b36cf244594101937d766b2dd7f2206b815723bde3debe410b804d","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-26T21:46:44Z","title_canon_sha256":"85cf4384d9a8be440ed208dee1fbd6f96575bf5ec2ca21f6f4f55eccc8912696"},"schema_version":"1.0","source":{"id":"2309.15286","kind":"arxiv","version":1}},"canonical_sha256":"0baaabed79991020321aef58528e33e9c57e681a2d3dc89ba2aaeeea12c414b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0baaabed79991020321aef58528e33e9c57e681a2d3dc89ba2aaeeea12c414b3","first_computed_at":"2026-07-05T06:54:43.819663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:54:43.819663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qEzY7/WNadpn3eAniS7h+wNoYW3oYgM1RBAYGxNP86h7G2rElLgch6LB2VEApGf+j12PFKwsmoUz8ci6uPFrAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:54:43.820009Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.15286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19cfd41ef951954226d8505efc29cf066c4a2883b2d76d9dc4b3fbe273604eae","sha256:d2fb3e08f1ecdddee97fc015cbb68379083b1f465bf5ac639a0d755c24ccf491"],"state_sha256":"dc1cd8a18a587ea16db5d499ea75d03237687c5d7afef62fe4ee2c40cd57efff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mF7m1+vYUYVD144KZee6iELjyzC5M9PfnWycyYG9Vgj7G0fVY9C5nGwbkulp9NNOuWkje++QKaXf9O/RrNgdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:55:42.796587Z","bundle_sha256":"81032dcec90c482db373905c462bf1b82e0b0041c41ce16a538c147a981fa27a"}}