{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DSH7ZZ2E2KBHAFPXU3YHC3WE6T","short_pith_number":"pith:DSH7ZZ2E","canonical_record":{"source":{"id":"1707.02757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T09:04:51Z","cross_cats_sorted":["cs.LG","math.OC","math.PR","stat.ML"],"title_canon_sha256":"0bc54941a4e41d4749aac7db68dfa03823b8a3c1dc90028dbde866d12206abc8","abstract_canon_sha256":"5f7edb30f6ac770145132c09ab3003881eb05718c80868c810fbc3720364c373"},"schema_version":"1.0"},"canonical_sha256":"1c8ffce744d2827015f7a6f0716ec4f4e9c256d0ed206a3972406fb12e4c0d84","source":{"kind":"arxiv","id":"1707.02757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02757","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02757v2","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02757","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"DSH7ZZ2E2KBH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DSH7ZZ2E2KBHAFPX","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DSH7ZZ2E","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DSH7ZZ2E2KBHAFPXU3YHC3WE6T","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T09:04:51Z","cross_cats_sorted":["cs.LG","math.OC","math.PR","stat.ML"],"title_canon_sha256":"0bc54941a4e41d4749aac7db68dfa03823b8a3c1dc90028dbde866d12206abc8","abstract_canon_sha256":"5f7edb30f6ac770145132c09ab3003881eb05718c80868c810fbc3720364c373"},"schema_version":"1.0"},"canonical_sha256":"1c8ffce744d2827015f7a6f0716ec4f4e9c256d0ed206a3972406fb12e4c0d84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:13.589616Z","signature_b64":"HHR4FmqKU8BJNiqXZZi/gLkoOARUuI/O9HglNlYaeBw+BNYgRGr3vX4PSu80Ku2dq0FBiPd8xe2G0dznUJkhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c8ffce744d2827015f7a6f0716ec4f4e9c256d0ed206a3972406fb12e4c0d84","last_reissued_at":"2026-05-18T00:10:13.588950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:13.588950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02757","source_version":2,"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-18T00:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11mZmR8rQJDCOEsPrxxBRNDMNH1Wgs9C1/7CiJkL7DE8UHPyeW6F9Qu7FMroUc8nqpjCEdwymeheXfJ7fvjfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:55:25.555135Z"},"content_sha256":"aa957e8bad11c521d03c3e14a7df923d9c30c7fb1d7fe47f3fe9d0b64207ebe0","schema_version":"1.0","event_id":"sha256:aa957e8bad11c521d03c3e14a7df923d9c30c7fb1d7fe47f3fe9d0b64207ebe0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DSH7ZZ2E2KBHAFPXU3YHC3WE6T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","math.PR","stat.ML"],"primary_cat":"cs.DS","authors_text":"Damian Straszak, Javad B. Ebrahimi, Nisheeth K. Vishnoi","submitted_at":"2017-07-10T09:04:51Z","abstract_excerpt":"Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors $v_1,\\ldots,v_m \\in \\mathbb{R}^d$ and a constraint family ${\\cal B}\\subseteq 2^{[m]}$, find a set $S \\in \\cal{B}$ that maximizes the squared volume of the simplex spanned by the vectors in $S$. A motivating example is the data-summarization problem in machine learning where one is given a collection of vectors that represent data such as documents or images. The volume of a set of vectors is used as a measure of their diversity, and partition or matroid constraints over $[m]$ are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02757","kind":"arxiv","version":2},"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-18T00:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEwD28SzfVeh7/w7NR/NAwJnMyOvK8xdWafqTvdupGk7jw/80MfJvsaN2GGuR8b+ZEGmdIxgm8OTFJ9WkZfMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:55:25.555884Z"},"content_sha256":"312b51ab94628b50adefa20f9cc23301fd0e3e7712939da0634ae7b68a7c510c","schema_version":"1.0","event_id":"sha256:312b51ab94628b50adefa20f9cc23301fd0e3e7712939da0634ae7b68a7c510c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSH7ZZ2E2KBHAFPXU3YHC3WE6T/bundle.json","state_url":"https://pith.science/pith/DSH7ZZ2E2KBHAFPXU3YHC3WE6T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSH7ZZ2E2KBHAFPXU3YHC3WE6T/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-06-04T15:55:25Z","links":{"resolver":"https://pith.science/pith/DSH7ZZ2E2KBHAFPXU3YHC3WE6T","bundle":"https://pith.science/pith/DSH7ZZ2E2KBHAFPXU3YHC3WE6T/bundle.json","state":"https://pith.science/pith/DSH7ZZ2E2KBHAFPXU3YHC3WE6T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSH7ZZ2E2KBHAFPXU3YHC3WE6T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DSH7ZZ2E2KBHAFPXU3YHC3WE6T","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":"5f7edb30f6ac770145132c09ab3003881eb05718c80868c810fbc3720364c373","cross_cats_sorted":["cs.LG","math.OC","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T09:04:51Z","title_canon_sha256":"0bc54941a4e41d4749aac7db68dfa03823b8a3c1dc90028dbde866d12206abc8"},"schema_version":"1.0","source":{"id":"1707.02757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02757","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02757v2","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02757","created_at":"2026-05-18T00:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"DSH7ZZ2E2KBH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DSH7ZZ2E2KBHAFPX","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DSH7ZZ2E","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:312b51ab94628b50adefa20f9cc23301fd0e3e7712939da0634ae7b68a7c510c","target":"graph","created_at":"2026-05-18T00:10:13Z","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":"Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors $v_1,\\ldots,v_m \\in \\mathbb{R}^d$ and a constraint family ${\\cal B}\\subseteq 2^{[m]}$, find a set $S \\in \\cal{B}$ that maximizes the squared volume of the simplex spanned by the vectors in $S$. A motivating example is the data-summarization problem in machine learning where one is given a collection of vectors that represent data such as documents or images. The volume of a set of vectors is used as a measure of their diversity, and partition or matroid constraints over $[m]$ are ","authors_text":"Damian Straszak, Javad B. Ebrahimi, Nisheeth K. Vishnoi","cross_cats":["cs.LG","math.OC","math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T09:04:51Z","title":"Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02757","kind":"arxiv","version":2},"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:aa957e8bad11c521d03c3e14a7df923d9c30c7fb1d7fe47f3fe9d0b64207ebe0","target":"record","created_at":"2026-05-18T00:10:13Z","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":"5f7edb30f6ac770145132c09ab3003881eb05718c80868c810fbc3720364c373","cross_cats_sorted":["cs.LG","math.OC","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T09:04:51Z","title_canon_sha256":"0bc54941a4e41d4749aac7db68dfa03823b8a3c1dc90028dbde866d12206abc8"},"schema_version":"1.0","source":{"id":"1707.02757","kind":"arxiv","version":2}},"canonical_sha256":"1c8ffce744d2827015f7a6f0716ec4f4e9c256d0ed206a3972406fb12e4c0d84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c8ffce744d2827015f7a6f0716ec4f4e9c256d0ed206a3972406fb12e4c0d84","first_computed_at":"2026-05-18T00:10:13.588950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:13.588950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HHR4FmqKU8BJNiqXZZi/gLkoOARUuI/O9HglNlYaeBw+BNYgRGr3vX4PSu80Ku2dq0FBiPd8xe2G0dznUJkhAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:13.589616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa957e8bad11c521d03c3e14a7df923d9c30c7fb1d7fe47f3fe9d0b64207ebe0","sha256:312b51ab94628b50adefa20f9cc23301fd0e3e7712939da0634ae7b68a7c510c"],"state_sha256":"2ee0fb834d388eae97875ba296e5839227336e9d63c17938426d4cbbb1a7b87a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s1CBiV3z5LmvXscF4p7v31gOzoIE36qI8r4ewQXLhOtLc7GBwa7jO+fd7wWOV1s9k/edRiSCsW6Glq19gAGNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:55:25.559331Z","bundle_sha256":"25eba86127fabc833037403b7029d146a4c80ca2801e078e565be6a5ad10d35e"}}