{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K5GTPP4XC4RTXC7FGO3Q43H3O5","short_pith_number":"pith:K5GTPP4X","schema_version":"1.0","canonical_sha256":"574d37bf9717233b8be533b70e6cfb777cc1477f56df7bd80b5f3628f6d01a2b","source":{"kind":"arxiv","id":"1711.10106","version":2},"attestation_state":"computed","paper":{"title":"A Galerkin approach to optimization in the space of convex and compact subsets of $\\R^d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Janosch Rieger","submitted_at":"2017-11-28T03:46:54Z","abstract_excerpt":"The aim of this paper is to establish a theory of Galerkin approximations to the space of convex and compact subsets of $\\R^d$ with favorable properties, both from a theoretical and from a computational perspective. These Galerkin spaces are first explored in depth and then used to solve optimization problems in the space of convex and compact subsets of $\\R^d$ approximately."},"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":"1711.10106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-28T03:46:54Z","cross_cats_sorted":[],"title_canon_sha256":"fd61e5a19f354c9bfa2d281d51fd2a1112521b6d40038d7a7001f73d63cd1a0b","abstract_canon_sha256":"dc238bbb23d7e531ceb41743a1eb17aed89b5722167695a586cf854741dbca6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:58.209753Z","signature_b64":"3wpiu5MHnw7V/HWZzQqYOibl/zODFWS1e9nrjwrnRFjfUfLkWwyCRrdO4Y8kXE+JkCOkkAhJE/6/GjIdMr0bDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"574d37bf9717233b8be533b70e6cfb777cc1477f56df7bd80b5f3628f6d01a2b","last_reissued_at":"2026-05-17T23:45:58.209132Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:58.209132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Galerkin approach to optimization in the space of convex and compact subsets of $\\R^d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Janosch Rieger","submitted_at":"2017-11-28T03:46:54Z","abstract_excerpt":"The aim of this paper is to establish a theory of Galerkin approximations to the space of convex and compact subsets of $\\R^d$ with favorable properties, both from a theoretical and from a computational perspective. These Galerkin spaces are first explored in depth and then used to solve optimization problems in the space of convex and compact subsets of $\\R^d$ approximately."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10106","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.10106","created_at":"2026-05-17T23:45:58.209245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10106v2","created_at":"2026-05-17T23:45:58.209245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10106","created_at":"2026-05-17T23:45:58.209245+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5GTPP4XC4RT","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5GTPP4XC4RTXC7F","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5GTPP4X","created_at":"2026-05-18T12:31:24.725408+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/K5GTPP4XC4RTXC7FGO3Q43H3O5","json":"https://pith.science/pith/K5GTPP4XC4RTXC7FGO3Q43H3O5.json","graph_json":"https://pith.science/api/pith-number/K5GTPP4XC4RTXC7FGO3Q43H3O5/graph.json","events_json":"https://pith.science/api/pith-number/K5GTPP4XC4RTXC7FGO3Q43H3O5/events.json","paper":"https://pith.science/paper/K5GTPP4X"},"agent_actions":{"view_html":"https://pith.science/pith/K5GTPP4XC4RTXC7FGO3Q43H3O5","download_json":"https://pith.science/pith/K5GTPP4XC4RTXC7FGO3Q43H3O5.json","view_paper":"https://pith.science/paper/K5GTPP4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10106&json=true","fetch_graph":"https://pith.science/api/pith-number/K5GTPP4XC4RTXC7FGO3Q43H3O5/graph.json","fetch_events":"https://pith.science/api/pith-number/K5GTPP4XC4RTXC7FGO3Q43H3O5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5GTPP4XC4RTXC7FGO3Q43H3O5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5GTPP4XC4RTXC7FGO3Q43H3O5/action/storage_attestation","attest_author":"https://pith.science/pith/K5GTPP4XC4RTXC7FGO3Q43H3O5/action/author_attestation","sign_citation":"https://pith.science/pith/K5GTPP4XC4RTXC7FGO3Q43H3O5/action/citation_signature","submit_replication":"https://pith.science/pith/K5GTPP4XC4RTXC7FGO3Q43H3O5/action/replication_record"}},"created_at":"2026-05-17T23:45:58.209245+00:00","updated_at":"2026-05-17T23:45:58.209245+00:00"}