{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TX4W4PE5HSS5TYVT2BJ3CP23ED","short_pith_number":"pith:TX4W4PE5","canonical_record":{"source":{"id":"1507.04822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T02:58:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6bc89c50537df74bc6dd66c121aacb5b19c28f3c9e2f5621465dbd3d01aa4aff","abstract_canon_sha256":"d5d6d45667a920addf55f2b5a272c2345b91a2136649888bc9603842768923bd"},"schema_version":"1.0"},"canonical_sha256":"9df96e3c9d3ca5d9e2b3d053b13f5b20d379d8239a7818cfa7e63a370fafdea9","source":{"kind":"arxiv","id":"1507.04822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04822","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04822v1","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04822","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"TX4W4PE5HSS5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TX4W4PE5HSS5TYVT","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TX4W4PE5","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TX4W4PE5HSS5TYVT2BJ3CP23ED","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T02:58:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6bc89c50537df74bc6dd66c121aacb5b19c28f3c9e2f5621465dbd3d01aa4aff","abstract_canon_sha256":"d5d6d45667a920addf55f2b5a272c2345b91a2136649888bc9603842768923bd"},"schema_version":"1.0"},"canonical_sha256":"9df96e3c9d3ca5d9e2b3d053b13f5b20d379d8239a7818cfa7e63a370fafdea9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:42.699085Z","signature_b64":"dV8CJyzZcGiERXWhFUcqfYY5ysRfOl2rovrM/yelEoY1yHUy8AuLMzI6mZYocemf7yLDY2C4V8dNDHnnmdg7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9df96e3c9d3ca5d9e2b3d053b13f5b20d379d8239a7818cfa7e63a370fafdea9","last_reissued_at":"2026-05-18T01:36:42.698347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:42.698347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04822","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-05-18T01:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qdM+YrZ1r8jE8yuivu7exiEfSUTwa4NLlhJ2cb/YOc+pm5h+n7h33Ctv236dS3USgOTvUWfxscPlQRVECsYBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:38:22.298392Z"},"content_sha256":"880cffed2cc21e9f893e8fed2fac635718f3e331afeca00989a94d2a98aadc8c","schema_version":"1.0","event_id":"sha256:880cffed2cc21e9f893e8fed2fac635718f3e331afeca00989a94d2a98aadc8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TX4W4PE5HSS5TYVT2BJ3CP23ED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subspace selection for projection maximization with matroid constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Louis Scharf, Yuan Wang, Zhenliang Zhang","submitted_at":"2015-07-17T02:58:48Z","abstract_excerpt":"Suppose that there is a ground set which consists of a large number of vectors in a Hilbert space. Consider the problem of selecting a subset of the ground set such that the projection of a vector of interest onto the subspace spanned by the vectors in the chosen subset reaches the maximum norm. This problem is generally NP-hard, and alternative approximation algorithms such as forward regression and orthogonal matching pursuit have been proposed as heuristic approaches. In this paper, we investigate bounds on the performance of these algorithms by introducing the notions of elemental curvatur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04822","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":""},"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-18T01:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ce2VbCEE39QpqCVkj+9jOmhU32dTO32b7a0kf4XajbWeq0guLZsTjaQsqM0CNCYftMmwexmxMYMl5VLdBbSiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:38:22.299043Z"},"content_sha256":"d5f518b633eee1edbabeee722197b8fbdc9e25861e57cca696572838b5c9c3fd","schema_version":"1.0","event_id":"sha256:d5f518b633eee1edbabeee722197b8fbdc9e25861e57cca696572838b5c9c3fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TX4W4PE5HSS5TYVT2BJ3CP23ED/bundle.json","state_url":"https://pith.science/pith/TX4W4PE5HSS5TYVT2BJ3CP23ED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TX4W4PE5HSS5TYVT2BJ3CP23ED/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-05-26T17:38:22Z","links":{"resolver":"https://pith.science/pith/TX4W4PE5HSS5TYVT2BJ3CP23ED","bundle":"https://pith.science/pith/TX4W4PE5HSS5TYVT2BJ3CP23ED/bundle.json","state":"https://pith.science/pith/TX4W4PE5HSS5TYVT2BJ3CP23ED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TX4W4PE5HSS5TYVT2BJ3CP23ED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TX4W4PE5HSS5TYVT2BJ3CP23ED","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":"d5d6d45667a920addf55f2b5a272c2345b91a2136649888bc9603842768923bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T02:58:48Z","title_canon_sha256":"6bc89c50537df74bc6dd66c121aacb5b19c28f3c9e2f5621465dbd3d01aa4aff"},"schema_version":"1.0","source":{"id":"1507.04822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04822","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04822v1","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04822","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"TX4W4PE5HSS5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TX4W4PE5HSS5TYVT","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TX4W4PE5","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:d5f518b633eee1edbabeee722197b8fbdc9e25861e57cca696572838b5c9c3fd","target":"graph","created_at":"2026-05-18T01:36:42Z","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":"Suppose that there is a ground set which consists of a large number of vectors in a Hilbert space. Consider the problem of selecting a subset of the ground set such that the projection of a vector of interest onto the subspace spanned by the vectors in the chosen subset reaches the maximum norm. This problem is generally NP-hard, and alternative approximation algorithms such as forward regression and orthogonal matching pursuit have been proposed as heuristic approaches. In this paper, we investigate bounds on the performance of these algorithms by introducing the notions of elemental curvatur","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Louis Scharf, Yuan Wang, Zhenliang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T02:58:48Z","title":"Subspace selection for projection maximization with matroid constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04822","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:880cffed2cc21e9f893e8fed2fac635718f3e331afeca00989a94d2a98aadc8c","target":"record","created_at":"2026-05-18T01:36:42Z","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":"d5d6d45667a920addf55f2b5a272c2345b91a2136649888bc9603842768923bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-17T02:58:48Z","title_canon_sha256":"6bc89c50537df74bc6dd66c121aacb5b19c28f3c9e2f5621465dbd3d01aa4aff"},"schema_version":"1.0","source":{"id":"1507.04822","kind":"arxiv","version":1}},"canonical_sha256":"9df96e3c9d3ca5d9e2b3d053b13f5b20d379d8239a7818cfa7e63a370fafdea9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9df96e3c9d3ca5d9e2b3d053b13f5b20d379d8239a7818cfa7e63a370fafdea9","first_computed_at":"2026-05-18T01:36:42.698347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:42.698347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dV8CJyzZcGiERXWhFUcqfYY5ysRfOl2rovrM/yelEoY1yHUy8AuLMzI6mZYocemf7yLDY2C4V8dNDHnnmdg7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:42.699085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:880cffed2cc21e9f893e8fed2fac635718f3e331afeca00989a94d2a98aadc8c","sha256:d5f518b633eee1edbabeee722197b8fbdc9e25861e57cca696572838b5c9c3fd"],"state_sha256":"e565a90064842a7cb6c3f0383f3b0e6f2265bad3aae91b811cb3caa4be6ea391"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AV77uopq1TS6Zpt804BselNAF8jB67wryPrRs3YBMdTiatQYqC7NdRXIXDUWQeTPqg5EK60eg42cvfG93dFxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:38:22.302406Z","bundle_sha256":"16ca51ed4aa88145fad1257bdac02497b12f48f0b786ec51f7cddc33eebca781"}}