{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TXUJHHANRQGQ3PVDFH5CH74Q45","short_pith_number":"pith:TXUJHHAN","schema_version":"1.0","canonical_sha256":"9de8939c0d8c0d0dbea329fa23ff90e74e08a20046cb69461a3c42af7272634a","source":{"kind":"arxiv","id":"1110.3061","version":2},"attestation_state":"computed","paper":{"title":"Iterative scheme for solving optimal transportation problems arising in reflector design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP","math.OC"],"primary_cat":"math.NA","authors_text":"Nick Henscheid, Tilmann Glimm","submitted_at":"2011-10-13T20:31:35Z","abstract_excerpt":"We consider the geometric optics problem of finding a system of two reflectors that transform a spherical wavefront into a beam of parallel rays with prescribed intensity distribution. Using techniques from optimal transportation theory, it has been shown before that this problem is equivalent to an infinite dimensional linear programming (LP) problem. We investigate techniques for constructing the two reflectors numerically. A straightforward discretization of this problem has the disadvantage that the number of constraints increases rapidly with the mesh size. So with this technique only ver"},"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":"1110.3061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-13T20:31:35Z","cross_cats_sorted":["math.AP","math.OC"],"title_canon_sha256":"5bb2a6b0a8edf65ea7e81ecbe1fab81a98fc84d79049b768481c409f3fd4fbef","abstract_canon_sha256":"68fdfcfbc29401aeab1fc30559912f5d4b8398e20c3ee6453e1cd5ed8fb8129c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:26.723599Z","signature_b64":"JEH6U+DnDcAE+sU5XbonzDl+9KmnnMdrc4WRXIqoIIWUzgtk+WKtfeIKXfjQm10dgVqkpq30kbMwkKzgWLkyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9de8939c0d8c0d0dbea329fa23ff90e74e08a20046cb69461a3c42af7272634a","last_reissued_at":"2026-05-18T04:09:26.722925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:26.722925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative scheme for solving optimal transportation problems arising in reflector design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP","math.OC"],"primary_cat":"math.NA","authors_text":"Nick Henscheid, Tilmann Glimm","submitted_at":"2011-10-13T20:31:35Z","abstract_excerpt":"We consider the geometric optics problem of finding a system of two reflectors that transform a spherical wavefront into a beam of parallel rays with prescribed intensity distribution. Using techniques from optimal transportation theory, it has been shown before that this problem is equivalent to an infinite dimensional linear programming (LP) problem. We investigate techniques for constructing the two reflectors numerically. A straightforward discretization of this problem has the disadvantage that the number of constraints increases rapidly with the mesh size. So with this technique only ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3061","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":"1110.3061","created_at":"2026-05-18T04:09:26.723009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3061v2","created_at":"2026-05-18T04:09:26.723009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3061","created_at":"2026-05-18T04:09:26.723009+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXUJHHANRQGQ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXUJHHANRQGQ3PVD","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXUJHHAN","created_at":"2026-05-18T12:26:42.757692+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/TXUJHHANRQGQ3PVDFH5CH74Q45","json":"https://pith.science/pith/TXUJHHANRQGQ3PVDFH5CH74Q45.json","graph_json":"https://pith.science/api/pith-number/TXUJHHANRQGQ3PVDFH5CH74Q45/graph.json","events_json":"https://pith.science/api/pith-number/TXUJHHANRQGQ3PVDFH5CH74Q45/events.json","paper":"https://pith.science/paper/TXUJHHAN"},"agent_actions":{"view_html":"https://pith.science/pith/TXUJHHANRQGQ3PVDFH5CH74Q45","download_json":"https://pith.science/pith/TXUJHHANRQGQ3PVDFH5CH74Q45.json","view_paper":"https://pith.science/paper/TXUJHHAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3061&json=true","fetch_graph":"https://pith.science/api/pith-number/TXUJHHANRQGQ3PVDFH5CH74Q45/graph.json","fetch_events":"https://pith.science/api/pith-number/TXUJHHANRQGQ3PVDFH5CH74Q45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXUJHHANRQGQ3PVDFH5CH74Q45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXUJHHANRQGQ3PVDFH5CH74Q45/action/storage_attestation","attest_author":"https://pith.science/pith/TXUJHHANRQGQ3PVDFH5CH74Q45/action/author_attestation","sign_citation":"https://pith.science/pith/TXUJHHANRQGQ3PVDFH5CH74Q45/action/citation_signature","submit_replication":"https://pith.science/pith/TXUJHHANRQGQ3PVDFH5CH74Q45/action/replication_record"}},"created_at":"2026-05-18T04:09:26.723009+00:00","updated_at":"2026-05-18T04:09:26.723009+00:00"}