{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U2M5SCA6YRXTAXARI65FRDZXQE","short_pith_number":"pith:U2M5SCA6","schema_version":"1.0","canonical_sha256":"a699d9081ec46f305c1147ba588f378112bbc2bfb5f4af1535821b2ed334acea","source":{"kind":"arxiv","id":"1805.07455","version":1},"attestation_state":"computed","paper":{"title":"Subspace Selection via DR-Submodular Maximization on Lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"So Nakashima, Takanori Maehara","submitted_at":"2018-05-18T21:57:17Z","abstract_excerpt":"The subspace selection problem seeks a subspace that maximizes an objective function under some constraint. This problem includes several important machine learning problems such as the principal component analysis and sparse dictionary selection problem. Often, these problems can be solved by greedy algorithms. Here, we are interested in why these problems can be solved by greedy algorithms, and what classes of objective functions and constraints admit this property. To answer this question, we formulate the problems as optimization problems on lattices. Then, we introduce a new class of func"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.07455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-18T21:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"9b0d189025220585bfb5ec01270d8d807bcc401d20084dbb51f381a4e73b6b21","abstract_canon_sha256":"b311bba28e489c683ecbbb8ab15f74281f7895bc72f2c8c8ff2d0e113ea6da7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:33.542453Z","signature_b64":"aEhImPTzbq5Jqvaywssg89dmnMxB6UKsCtK8vL85F86x1auP+1Mt9pM0cL/L4Ue8kCeOpwMf4pYSmysGKddkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a699d9081ec46f305c1147ba588f378112bbc2bfb5f4af1535821b2ed334acea","last_reissued_at":"2026-05-18T00:15:33.541866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:33.541866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace Selection via DR-Submodular Maximization on Lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"So Nakashima, Takanori Maehara","submitted_at":"2018-05-18T21:57:17Z","abstract_excerpt":"The subspace selection problem seeks a subspace that maximizes an objective function under some constraint. This problem includes several important machine learning problems such as the principal component analysis and sparse dictionary selection problem. Often, these problems can be solved by greedy algorithms. Here, we are interested in why these problems can be solved by greedy algorithms, and what classes of objective functions and constraints admit this property. To answer this question, we formulate the problems as optimization problems on lattices. Then, we introduce a new class of func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07455","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.07455","created_at":"2026-05-18T00:15:33.541946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07455v1","created_at":"2026-05-18T00:15:33.541946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07455","created_at":"2026-05-18T00:15:33.541946+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2M5SCA6YRXT","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2M5SCA6YRXTAXAR","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2M5SCA6","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U2M5SCA6YRXTAXARI65FRDZXQE","json":"https://pith.science/pith/U2M5SCA6YRXTAXARI65FRDZXQE.json","graph_json":"https://pith.science/api/pith-number/U2M5SCA6YRXTAXARI65FRDZXQE/graph.json","events_json":"https://pith.science/api/pith-number/U2M5SCA6YRXTAXARI65FRDZXQE/events.json","paper":"https://pith.science/paper/U2M5SCA6"},"agent_actions":{"view_html":"https://pith.science/pith/U2M5SCA6YRXTAXARI65FRDZXQE","download_json":"https://pith.science/pith/U2M5SCA6YRXTAXARI65FRDZXQE.json","view_paper":"https://pith.science/paper/U2M5SCA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07455&json=true","fetch_graph":"https://pith.science/api/pith-number/U2M5SCA6YRXTAXARI65FRDZXQE/graph.json","fetch_events":"https://pith.science/api/pith-number/U2M5SCA6YRXTAXARI65FRDZXQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2M5SCA6YRXTAXARI65FRDZXQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2M5SCA6YRXTAXARI65FRDZXQE/action/storage_attestation","attest_author":"https://pith.science/pith/U2M5SCA6YRXTAXARI65FRDZXQE/action/author_attestation","sign_citation":"https://pith.science/pith/U2M5SCA6YRXTAXARI65FRDZXQE/action/citation_signature","submit_replication":"https://pith.science/pith/U2M5SCA6YRXTAXARI65FRDZXQE/action/replication_record"}},"created_at":"2026-05-18T00:15:33.541946+00:00","updated_at":"2026-05-18T00:15:33.541946+00:00"}