{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SL3DT457WB5PUTAZXNJCCSP72E","short_pith_number":"pith:SL3DT457","schema_version":"1.0","canonical_sha256":"92f639f3bfb07afa4c19bb522149ffd122ef969eadd0b2cd98e7c331f516c35b","source":{"kind":"arxiv","id":"1506.08459","version":1},"attestation_state":"computed","paper":{"title":"On the Approximation Theory of Linear Variational Subspace Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Jianbo Ye, Zhixin Yan","submitted_at":"2015-06-28T22:08:10Z","abstract_excerpt":"Solving large-scale optimization on-the-fly is often a difficult task for real-time computer graphics applications. To tackle this challenge, model reduction is a well-adopted technique. Despite its usefulness, model reduction often requires a handcrafted subspace that spans a domain that hypothetically embodies desirable solutions. For many applications, obtaining such subspaces case-by-case either is impossible or requires extensive human labors, hence does not readily have a scalable solution for growing number of tasks. We propose linear variational subspace design for large-scale constrai"},"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":"1506.08459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2015-06-28T22:08:10Z","cross_cats_sorted":[],"title_canon_sha256":"0de944c9fb6f1e00ba4f8b0651b17fe7f93058c7d49359255347bfbacd9656e1","abstract_canon_sha256":"a4578bd28e866d999b906bf832a1f8aae4faaf8b1cc7dbccf8e1dd7318b39f79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:45.286659Z","signature_b64":"nur5/Qb/pnvp8hF5/BN/MpH1d8ZxL2afQt3TE2BFZTUa8t/B2emL18BpJSqE4aQgtqPhHesctoWirs3b4CSWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92f639f3bfb07afa4c19bb522149ffd122ef969eadd0b2cd98e7c331f516c35b","last_reissued_at":"2026-05-18T01:37:45.286172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:45.286172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Approximation Theory of Linear Variational Subspace Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Jianbo Ye, Zhixin Yan","submitted_at":"2015-06-28T22:08:10Z","abstract_excerpt":"Solving large-scale optimization on-the-fly is often a difficult task for real-time computer graphics applications. To tackle this challenge, model reduction is a well-adopted technique. Despite its usefulness, model reduction often requires a handcrafted subspace that spans a domain that hypothetically embodies desirable solutions. For many applications, obtaining such subspaces case-by-case either is impossible or requires extensive human labors, hence does not readily have a scalable solution for growing number of tasks. We propose linear variational subspace design for large-scale constrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08459","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":"1506.08459","created_at":"2026-05-18T01:37:45.286254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08459v1","created_at":"2026-05-18T01:37:45.286254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08459","created_at":"2026-05-18T01:37:45.286254+00:00"},{"alias_kind":"pith_short_12","alias_value":"SL3DT457WB5P","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SL3DT457WB5PUTAZ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SL3DT457","created_at":"2026-05-18T12:29:42.218222+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/SL3DT457WB5PUTAZXNJCCSP72E","json":"https://pith.science/pith/SL3DT457WB5PUTAZXNJCCSP72E.json","graph_json":"https://pith.science/api/pith-number/SL3DT457WB5PUTAZXNJCCSP72E/graph.json","events_json":"https://pith.science/api/pith-number/SL3DT457WB5PUTAZXNJCCSP72E/events.json","paper":"https://pith.science/paper/SL3DT457"},"agent_actions":{"view_html":"https://pith.science/pith/SL3DT457WB5PUTAZXNJCCSP72E","download_json":"https://pith.science/pith/SL3DT457WB5PUTAZXNJCCSP72E.json","view_paper":"https://pith.science/paper/SL3DT457","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08459&json=true","fetch_graph":"https://pith.science/api/pith-number/SL3DT457WB5PUTAZXNJCCSP72E/graph.json","fetch_events":"https://pith.science/api/pith-number/SL3DT457WB5PUTAZXNJCCSP72E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SL3DT457WB5PUTAZXNJCCSP72E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SL3DT457WB5PUTAZXNJCCSP72E/action/storage_attestation","attest_author":"https://pith.science/pith/SL3DT457WB5PUTAZXNJCCSP72E/action/author_attestation","sign_citation":"https://pith.science/pith/SL3DT457WB5PUTAZXNJCCSP72E/action/citation_signature","submit_replication":"https://pith.science/pith/SL3DT457WB5PUTAZXNJCCSP72E/action/replication_record"}},"created_at":"2026-05-18T01:37:45.286254+00:00","updated_at":"2026-05-18T01:37:45.286254+00:00"}