{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:373GD4LGEPYSKOTJAMX5MNULYJ","short_pith_number":"pith:373GD4LG","canonical_record":{"source":{"id":"2207.04318","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-09T18:30:17Z","cross_cats_sorted":[],"title_canon_sha256":"aec7cc0d39e1ff486f223c957efc61b3d63029b32d8001944fff041c33c11a3c","abstract_canon_sha256":"ed6704b777bee463c12d485392dcfc05979350e7f5f1372aa8e5b24a42b52085"},"schema_version":"1.0"},"canonical_sha256":"dff661f16623f1253a69032fd6368bc26c1da82f75be0444a9b0786adce4325a","source":{"kind":"arxiv","id":"2207.04318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.04318","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"2207.04318v1","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.04318","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"373GD4LGEPYS","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"pith_short_16","alias_value":"373GD4LGEPYSKOTJ","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"pith_short_8","alias_value":"373GD4LG","created_at":"2026-07-05T04:38:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:373GD4LGEPYSKOTJAMX5MNULYJ","target":"record","payload":{"canonical_record":{"source":{"id":"2207.04318","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-09T18:30:17Z","cross_cats_sorted":[],"title_canon_sha256":"aec7cc0d39e1ff486f223c957efc61b3d63029b32d8001944fff041c33c11a3c","abstract_canon_sha256":"ed6704b777bee463c12d485392dcfc05979350e7f5f1372aa8e5b24a42b52085"},"schema_version":"1.0"},"canonical_sha256":"dff661f16623f1253a69032fd6368bc26c1da82f75be0444a9b0786adce4325a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:57.833977Z","signature_b64":"CFH8cIdrLekPoK2qugHRp08zSpXUXQQtJo+ACpUAdIKq95W6oXE3uvuJOIyfV3gKwEIyqvOYZ5LtyfBoSuThAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dff661f16623f1253a69032fd6368bc26c1da82f75be0444a9b0786adce4325a","last_reissued_at":"2026-07-05T04:38:57.833487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:57.833487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.04318","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-05T04:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvlbQ9Gye7RvMs29PwVl4bxPg7Xx6lGujunPWQHfGSqdbmt8QHc+8U3cj8Lm3fWHYuaX43UOeYWlkeanLScfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:28:36.399564Z"},"content_sha256":"38a840b31c955e4a741d1687d533d744116a84d75063ccbd2908c00a052c1fad","schema_version":"1.0","event_id":"sha256:38a840b31c955e4a741d1687d533d744116a84d75063ccbd2908c00a052c1fad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:373GD4LGEPYSKOTJAMX5MNULYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Determinant Maximization via Matroid Intersection Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali","submitted_at":"2022-07-09T18:30:17Z","abstract_excerpt":"Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \\cite{pukelsheim2006optimal}, convex geometry \\cite{Khachiyan1996}, fair allocations\\linebreak \\cite{anari2016nash}, combinatorics \\cite{AnariGV18}, spectral graph theory \\cite{nikolov2019proportional}, network design, and random processes \\cite{kulesza2012determinantal}. In an instance of a determinant maximization problem, we are given a collection of vectors $U=\\{v_1,\\ldots, v_n\\} \\subset \\RR^d$, and a goal is to pick a subset $S\\subseteq U$ of given vectors to maximize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.04318","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/2207.04318/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-05T04:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nVzaZ/NFGK3TjkNP1+lQEhLmRLlq9wz2/TlzzY1AbndDFMYgIjEaNGnTa9H3py9gK8aj9kVrHoJ9XN1lsLXHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:28:36.400073Z"},"content_sha256":"37df129f7662c44e6cf884e95175b0cc81f41a39135c190d7cf6f3d59966c8be","schema_version":"1.0","event_id":"sha256:37df129f7662c44e6cf884e95175b0cc81f41a39135c190d7cf6f3d59966c8be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/373GD4LGEPYSKOTJAMX5MNULYJ/bundle.json","state_url":"https://pith.science/pith/373GD4LGEPYSKOTJAMX5MNULYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/373GD4LGEPYSKOTJAMX5MNULYJ/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-08-15T08:28:36Z","links":{"resolver":"https://pith.science/pith/373GD4LGEPYSKOTJAMX5MNULYJ","bundle":"https://pith.science/pith/373GD4LGEPYSKOTJAMX5MNULYJ/bundle.json","state":"https://pith.science/pith/373GD4LGEPYSKOTJAMX5MNULYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/373GD4LGEPYSKOTJAMX5MNULYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:373GD4LGEPYSKOTJAMX5MNULYJ","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":"ed6704b777bee463c12d485392dcfc05979350e7f5f1372aa8e5b24a42b52085","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-09T18:30:17Z","title_canon_sha256":"aec7cc0d39e1ff486f223c957efc61b3d63029b32d8001944fff041c33c11a3c"},"schema_version":"1.0","source":{"id":"2207.04318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.04318","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"2207.04318v1","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.04318","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"373GD4LGEPYS","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"pith_short_16","alias_value":"373GD4LGEPYSKOTJ","created_at":"2026-07-05T04:38:57Z"},{"alias_kind":"pith_short_8","alias_value":"373GD4LG","created_at":"2026-07-05T04:38:57Z"}],"graph_snapshots":[{"event_id":"sha256:37df129f7662c44e6cf884e95175b0cc81f41a39135c190d7cf6f3d59966c8be","target":"graph","created_at":"2026-07-05T04:38:57Z","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/2207.04318/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \\cite{pukelsheim2006optimal}, convex geometry \\cite{Khachiyan1996}, fair allocations\\linebreak \\cite{anari2016nash}, combinatorics \\cite{AnariGV18}, spectral graph theory \\cite{nikolov2019proportional}, network design, and random processes \\cite{kulesza2012determinantal}. In an instance of a determinant maximization problem, we are given a collection of vectors $U=\\{v_1,\\ldots, v_n\\} \\subset \\RR^d$, and a goal is to pick a subset $S\\subseteq U$ of given vectors to maximize","authors_text":"Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-09T18:30:17Z","title":"Determinant Maximization via Matroid Intersection Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.04318","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:38a840b31c955e4a741d1687d533d744116a84d75063ccbd2908c00a052c1fad","target":"record","created_at":"2026-07-05T04:38:57Z","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":"ed6704b777bee463c12d485392dcfc05979350e7f5f1372aa8e5b24a42b52085","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-09T18:30:17Z","title_canon_sha256":"aec7cc0d39e1ff486f223c957efc61b3d63029b32d8001944fff041c33c11a3c"},"schema_version":"1.0","source":{"id":"2207.04318","kind":"arxiv","version":1}},"canonical_sha256":"dff661f16623f1253a69032fd6368bc26c1da82f75be0444a9b0786adce4325a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dff661f16623f1253a69032fd6368bc26c1da82f75be0444a9b0786adce4325a","first_computed_at":"2026-07-05T04:38:57.833487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:57.833487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CFH8cIdrLekPoK2qugHRp08zSpXUXQQtJo+ACpUAdIKq95W6oXE3uvuJOIyfV3gKwEIyqvOYZ5LtyfBoSuThAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:57.833977Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.04318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38a840b31c955e4a741d1687d533d744116a84d75063ccbd2908c00a052c1fad","sha256:37df129f7662c44e6cf884e95175b0cc81f41a39135c190d7cf6f3d59966c8be"],"state_sha256":"b24416fcb87e935603ca8a95740107b5798d856613baef06bc89388df4d12479"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grpWifXKBUiaiRLf2ezrwWhEwOBRjkCbb3CdNvlFFVPDnbXK+Npmpki2sTf+bOICu+wvxxp8zYlJJV7WOLGNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T08:28:36.403321Z","bundle_sha256":"8a8516ab0e7502e9818bd32c68bc2cd158641bbcf871852750679aeeadc67308"}}