{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YL4CO4BBQZBC4SXB76DA5EGIMM","short_pith_number":"pith:YL4CO4BB","canonical_record":{"source":{"id":"1006.3601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-06-18T03:51:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"469aaba53fd78c376ded8ac083dbc008f7a14c3c4dc0675bde07c7616ee348ef","abstract_canon_sha256":"9187d2dd366c114c7c1c7e39efc7097c08827ff3a564aeb292ddf661c277da2b"},"schema_version":"1.0"},"canonical_sha256":"c2f827702186422e4ae1ff860e90c8631be89bb12dca889250b69dcd0f5a7b23","source":{"kind":"arxiv","id":"1006.3601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3601","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3601v1","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3601","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"YL4CO4BBQZBC","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"YL4CO4BBQZBC4SXB","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"YL4CO4BB","created_at":"2026-07-04T17:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YL4CO4BBQZBC4SXB76DA5EGIMM","target":"record","payload":{"canonical_record":{"source":{"id":"1006.3601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-06-18T03:51:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"469aaba53fd78c376ded8ac083dbc008f7a14c3c4dc0675bde07c7616ee348ef","abstract_canon_sha256":"9187d2dd366c114c7c1c7e39efc7097c08827ff3a564aeb292ddf661c277da2b"},"schema_version":"1.0"},"canonical_sha256":"c2f827702186422e4ae1ff860e90c8631be89bb12dca889250b69dcd0f5a7b23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:30:36.983192Z","signature_b64":"Z5kTvzv64rZCmUeV68QmCE2vHipD4cCZaLTQes8cip6c5ZW8M8FiIIwZ513B1mzcmXhAvx/30mqkVsfNwIucBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2f827702186422e4ae1ff860e90c8631be89bb12dca889250b69dcd0f5a7b23","last_reissued_at":"2026-07-04T17:30:36.982835Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:30:36.982835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.3601","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-04T17:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CAfuEG/4YfYAjacHq5DhEVpE8mFoHqFOdLgNQgskCibwEHmQtmxnOZxi2bJ4E4NUx+U5hNYsmpR03WWcwh6GCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:33:30.124891Z"},"content_sha256":"0c1f2b783951aeffa5d0e6f6c72366b3bd46e5cbb651c84ffb890cced4b0776a","schema_version":"1.0","event_id":"sha256:0c1f2b783951aeffa5d0e6f6c72366b3bd46e5cbb651c84ffb890cced4b0776a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YL4CO4BBQZBC4SXB76DA5EGIMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Relaxations for Subset Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Francis Bach, Selin Damla Ahipasaoglu","submitted_at":"2010-06-18T03:51:53Z","abstract_excerpt":"We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the quality of these relaxations by studying the approximation ratio of sparse eigenvalue relaxations. Our results are used to improve the performance of branch-and-bound algorithms to produce exact solutions to subset selection problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3601","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/1006.3601/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-04T17:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/n3DpCzNFEPOBQAX41uxMYFsAgZVbIRz93sbGUcFM+REQFJ3FOv+Rb080TjWmCE2o8gI88oY5cpfUXakwMXmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:33:30.126340Z"},"content_sha256":"318c08e9b1dc967548fed09885146c924bf19961f650621f70bd2a8853eadcfe","schema_version":"1.0","event_id":"sha256:318c08e9b1dc967548fed09885146c924bf19961f650621f70bd2a8853eadcfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YL4CO4BBQZBC4SXB76DA5EGIMM/bundle.json","state_url":"https://pith.science/pith/YL4CO4BBQZBC4SXB76DA5EGIMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YL4CO4BBQZBC4SXB76DA5EGIMM/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-05T18:33:30Z","links":{"resolver":"https://pith.science/pith/YL4CO4BBQZBC4SXB76DA5EGIMM","bundle":"https://pith.science/pith/YL4CO4BBQZBC4SXB76DA5EGIMM/bundle.json","state":"https://pith.science/pith/YL4CO4BBQZBC4SXB76DA5EGIMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YL4CO4BBQZBC4SXB76DA5EGIMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YL4CO4BBQZBC4SXB76DA5EGIMM","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":"9187d2dd366c114c7c1c7e39efc7097c08827ff3a564aeb292ddf661c277da2b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-06-18T03:51:53Z","title_canon_sha256":"469aaba53fd78c376ded8ac083dbc008f7a14c3c4dc0675bde07c7616ee348ef"},"schema_version":"1.0","source":{"id":"1006.3601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3601","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3601v1","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3601","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"YL4CO4BBQZBC","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"YL4CO4BBQZBC4SXB","created_at":"2026-07-04T17:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"YL4CO4BB","created_at":"2026-07-04T17:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:318c08e9b1dc967548fed09885146c924bf19961f650621f70bd2a8853eadcfe","target":"graph","created_at":"2026-07-04T17:30:36Z","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/1006.3601/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the quality of these relaxations by studying the approximation ratio of sparse eigenvalue relaxations. Our results are used to improve the performance of branch-and-bound algorithms to produce exact solutions to subset selection problems.","authors_text":"Alexandre d'Aspremont, Francis Bach, Selin Damla Ahipasaoglu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-06-18T03:51:53Z","title":"Convex Relaxations for Subset Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3601","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:0c1f2b783951aeffa5d0e6f6c72366b3bd46e5cbb651c84ffb890cced4b0776a","target":"record","created_at":"2026-07-04T17:30:36Z","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":"9187d2dd366c114c7c1c7e39efc7097c08827ff3a564aeb292ddf661c277da2b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-06-18T03:51:53Z","title_canon_sha256":"469aaba53fd78c376ded8ac083dbc008f7a14c3c4dc0675bde07c7616ee348ef"},"schema_version":"1.0","source":{"id":"1006.3601","kind":"arxiv","version":1}},"canonical_sha256":"c2f827702186422e4ae1ff860e90c8631be89bb12dca889250b69dcd0f5a7b23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2f827702186422e4ae1ff860e90c8631be89bb12dca889250b69dcd0f5a7b23","first_computed_at":"2026-07-04T17:30:36.982835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:30:36.982835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z5kTvzv64rZCmUeV68QmCE2vHipD4cCZaLTQes8cip6c5ZW8M8FiIIwZ513B1mzcmXhAvx/30mqkVsfNwIucBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T17:30:36.983192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.3601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c1f2b783951aeffa5d0e6f6c72366b3bd46e5cbb651c84ffb890cced4b0776a","sha256:318c08e9b1dc967548fed09885146c924bf19961f650621f70bd2a8853eadcfe"],"state_sha256":"a990a20a20ec3413849f4ffd493cddaeb0c57d6cfb2d57019d3e6654c6e8f193"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hZMZbIMzMdm4t6H6sR8rZZp/1qGVZImzQAv+zMa8YdjQg4632QIfzB8MLKuwB1LvlhwOjzhTulKsIFc8rranCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:33:30.135692Z","bundle_sha256":"e39c5cda5469ea7810fff8ffb1bd79f3dcb1cc7543846b3c43f75a9b77022df6"}}