{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:4D2DYYMVL2HRBA7ESG4VF2LWAK","short_pith_number":"pith:4D2DYYMV","canonical_record":{"source":{"id":"2211.10507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-18T20:48:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7c44c47e3b3ebe4970908f23eaaad0e676dfbb60d72fb076535de5362212ae04","abstract_canon_sha256":"a063b19eabd7b1e83b30baa3d955ddc20079dc40986cb57214f03a88c519e013"},"schema_version":"1.0"},"canonical_sha256":"e0f43c61955e8f1083e491b952e976028af19c3175808bcc70e5a79b31b6eb08","source":{"kind":"arxiv","id":"2211.10507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.10507","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"2211.10507v1","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10507","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"4D2DYYMVL2HR","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"pith_short_16","alias_value":"4D2DYYMVL2HRBA7E","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"pith_short_8","alias_value":"4D2DYYMV","created_at":"2026-07-05T05:17:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:4D2DYYMVL2HRBA7ESG4VF2LWAK","target":"record","payload":{"canonical_record":{"source":{"id":"2211.10507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-18T20:48:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7c44c47e3b3ebe4970908f23eaaad0e676dfbb60d72fb076535de5362212ae04","abstract_canon_sha256":"a063b19eabd7b1e83b30baa3d955ddc20079dc40986cb57214f03a88c519e013"},"schema_version":"1.0"},"canonical_sha256":"e0f43c61955e8f1083e491b952e976028af19c3175808bcc70e5a79b31b6eb08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:49.026806Z","signature_b64":"GLa684GSleF76B32SQxQcgdpAZdFnjidhpjyILeJs2SbcKCjjvw79G0yX1tJBliMBkLgFl6hKkA0dQGRYZ2pAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0f43c61955e8f1083e491b952e976028af19c3175808bcc70e5a79b31b6eb08","last_reissued_at":"2026-07-05T05:17:49.026310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:49.026310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.10507","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-05T05:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5aRxkUuZbqPViTf2tklJaX+NOut4SAmnpJDlV8+7RtPNGC3WlrpLi+wdxZpDwV4QPl2FmAbLPE4Ph4P4fDFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:08:57.110702Z"},"content_sha256":"8e23a0ebdf2fa052d819afd3105c76e05ff6fd440abc9dc5cb2886ce00c8c4ba","schema_version":"1.0","event_id":"sha256:8e23a0ebdf2fa052d819afd3105c76e05ff6fd440abc9dc5cb2886ce00c8c4ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:4D2DYYMVL2HRBA7ESG4VF2LWAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Determinant Maximization for All Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh","submitted_at":"2022-11-18T20:48:22Z","abstract_excerpt":"Determinant maximization provides an elegant generalization of problems in many areas, including convex geometry, statistics, machine learning, fair allocation of goods, and network design. In an instance of the determinant maximization problem, we are given a collection of vectors $v_1,\\ldots, v_n \\in \\mathbb{R}^d$, and the goal is to pick a subset $S\\subseteq [n]$ of given vectors to maximize the determinant of the matrix $\\sum_{i \\in S} v_iv_i^\\top$, where the picked set of vectors $S$ must satisfy some combinatorial constraint such as cardinality constraint ($|S| \\leq k$) or matroid constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10507","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/2211.10507/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-05T05:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vPxek+2/iKIoJtwW7u4AFyyjwTiKfYfeCza/F1P3NKSfY0EDaHeyDqtzyPMwpKquCI2kUUBuqhlsCamPkhvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:08:57.111283Z"},"content_sha256":"4a9e6fa85d33d3422b52dec38365dae8a25338fe7d930aec68addfb15e5b913d","schema_version":"1.0","event_id":"sha256:4a9e6fa85d33d3422b52dec38365dae8a25338fe7d930aec68addfb15e5b913d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4D2DYYMVL2HRBA7ESG4VF2LWAK/bundle.json","state_url":"https://pith.science/pith/4D2DYYMVL2HRBA7ESG4VF2LWAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4D2DYYMVL2HRBA7ESG4VF2LWAK/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-12T21:08:57Z","links":{"resolver":"https://pith.science/pith/4D2DYYMVL2HRBA7ESG4VF2LWAK","bundle":"https://pith.science/pith/4D2DYYMVL2HRBA7ESG4VF2LWAK/bundle.json","state":"https://pith.science/pith/4D2DYYMVL2HRBA7ESG4VF2LWAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4D2DYYMVL2HRBA7ESG4VF2LWAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:4D2DYYMVL2HRBA7ESG4VF2LWAK","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":"a063b19eabd7b1e83b30baa3d955ddc20079dc40986cb57214f03a88c519e013","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-18T20:48:22Z","title_canon_sha256":"7c44c47e3b3ebe4970908f23eaaad0e676dfbb60d72fb076535de5362212ae04"},"schema_version":"1.0","source":{"id":"2211.10507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.10507","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"2211.10507v1","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10507","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"4D2DYYMVL2HR","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"pith_short_16","alias_value":"4D2DYYMVL2HRBA7E","created_at":"2026-07-05T05:17:49Z"},{"alias_kind":"pith_short_8","alias_value":"4D2DYYMV","created_at":"2026-07-05T05:17:49Z"}],"graph_snapshots":[{"event_id":"sha256:4a9e6fa85d33d3422b52dec38365dae8a25338fe7d930aec68addfb15e5b913d","target":"graph","created_at":"2026-07-05T05:17:49Z","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/2211.10507/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Determinant maximization provides an elegant generalization of problems in many areas, including convex geometry, statistics, machine learning, fair allocation of goods, and network design. In an instance of the determinant maximization problem, we are given a collection of vectors $v_1,\\ldots, v_n \\in \\mathbb{R}^d$, and the goal is to pick a subset $S\\subseteq [n]$ of given vectors to maximize the determinant of the matrix $\\sum_{i \\in S} v_iv_i^\\top$, where the picked set of vectors $S$ must satisfy some combinatorial constraint such as cardinality constraint ($|S| \\leq k$) or matroid constr","authors_text":"Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-18T20:48:22Z","title":"Efficient Determinant Maximization for All Matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10507","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:8e23a0ebdf2fa052d819afd3105c76e05ff6fd440abc9dc5cb2886ce00c8c4ba","target":"record","created_at":"2026-07-05T05:17:49Z","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":"a063b19eabd7b1e83b30baa3d955ddc20079dc40986cb57214f03a88c519e013","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-18T20:48:22Z","title_canon_sha256":"7c44c47e3b3ebe4970908f23eaaad0e676dfbb60d72fb076535de5362212ae04"},"schema_version":"1.0","source":{"id":"2211.10507","kind":"arxiv","version":1}},"canonical_sha256":"e0f43c61955e8f1083e491b952e976028af19c3175808bcc70e5a79b31b6eb08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0f43c61955e8f1083e491b952e976028af19c3175808bcc70e5a79b31b6eb08","first_computed_at":"2026-07-05T05:17:49.026310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:49.026310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GLa684GSleF76B32SQxQcgdpAZdFnjidhpjyILeJs2SbcKCjjvw79G0yX1tJBliMBkLgFl6hKkA0dQGRYZ2pAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:49.026806Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.10507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e23a0ebdf2fa052d819afd3105c76e05ff6fd440abc9dc5cb2886ce00c8c4ba","sha256:4a9e6fa85d33d3422b52dec38365dae8a25338fe7d930aec68addfb15e5b913d"],"state_sha256":"28da0e1bb00f761459c51a40d196a8e9a83013f701bb6730102aae8d468ba014"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWHU1E6/0QwFYZ5/AMrkmJajcy7SFa+/4+jouQHfjW09JaAlMnDmeIITvrCqOOW/R0xA5MApDM500WH0BLeaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:08:57.115172Z","bundle_sha256":"c9d5117dac73961720f6dac55a8dff6d22c21cc4117866f4f24d3c353d941950"}}