{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IM57UBIXCRFDTQNZUAIVFD22JZ","short_pith_number":"pith:IM57UBIX","schema_version":"1.0","canonical_sha256":"433bfa0517144a39c1b9a011528f5a4e7a125925b604f24f927ac527c167f027","source":{"kind":"arxiv","id":"1604.06933","version":1},"attestation_state":"computed","paper":{"title":"The discrete sign problem: uniqueness, recovery algorithms and phase retrieval applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ariel Jaffe, Ben Leshem, Boaz Nadler, Oren Raz","submitted_at":"2016-04-23T18:25:02Z","abstract_excerpt":"In this paper we consider the following real-valued and finite dimensional specific instance of the 1-D classical phase retrieval problem. Let ${\\bf F}\\in\\mathbb{R}^N$ be an $N$-dimensional vector, whose discrete Fourier transform has a compact support. The sign problem is to recover ${\\bf F}$ from its magnitude $|{\\bf F}|$. First, in contrast to the classical 1-D phase problem which in general has multiple solutions, we prove that with sufficient over-sampling, the sign problem admits a unique solution. Next, we show that the sign problem can be viewed as a special case of a more general piec"},"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":"1604.06933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-23T18:25:02Z","cross_cats_sorted":[],"title_canon_sha256":"0f31c708d4a38636706b02fdcefe2fc98b1b9cd0290bdcce10a9bf98a84bc59f","abstract_canon_sha256":"502564bb5063c3e18488a9719f089ca7937cdf1c851c3d5004c8ba97fea061b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.546111Z","signature_b64":"1AwsBv32uCJYvtUOdmH6X6HZ8VtJt/GwcoyVcBtVQug24Q1u5vl1Jjjl5Yi/zJD6SXcDAgdVR4t+stDPRbK8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"433bfa0517144a39c1b9a011528f5a4e7a125925b604f24f927ac527c167f027","last_reissued_at":"2026-05-18T01:16:23.545437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.545437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The discrete sign problem: uniqueness, recovery algorithms and phase retrieval applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ariel Jaffe, Ben Leshem, Boaz Nadler, Oren Raz","submitted_at":"2016-04-23T18:25:02Z","abstract_excerpt":"In this paper we consider the following real-valued and finite dimensional specific instance of the 1-D classical phase retrieval problem. Let ${\\bf F}\\in\\mathbb{R}^N$ be an $N$-dimensional vector, whose discrete Fourier transform has a compact support. The sign problem is to recover ${\\bf F}$ from its magnitude $|{\\bf F}|$. First, in contrast to the classical 1-D phase problem which in general has multiple solutions, we prove that with sufficient over-sampling, the sign problem admits a unique solution. Next, we show that the sign problem can be viewed as a special case of a more general piec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06933","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":"1604.06933","created_at":"2026-05-18T01:16:23.545552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06933v1","created_at":"2026-05-18T01:16:23.545552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06933","created_at":"2026-05-18T01:16:23.545552+00:00"},{"alias_kind":"pith_short_12","alias_value":"IM57UBIXCRFD","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IM57UBIXCRFDTQNZ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IM57UBIX","created_at":"2026-05-18T12:30:22.444734+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/IM57UBIXCRFDTQNZUAIVFD22JZ","json":"https://pith.science/pith/IM57UBIXCRFDTQNZUAIVFD22JZ.json","graph_json":"https://pith.science/api/pith-number/IM57UBIXCRFDTQNZUAIVFD22JZ/graph.json","events_json":"https://pith.science/api/pith-number/IM57UBIXCRFDTQNZUAIVFD22JZ/events.json","paper":"https://pith.science/paper/IM57UBIX"},"agent_actions":{"view_html":"https://pith.science/pith/IM57UBIXCRFDTQNZUAIVFD22JZ","download_json":"https://pith.science/pith/IM57UBIXCRFDTQNZUAIVFD22JZ.json","view_paper":"https://pith.science/paper/IM57UBIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06933&json=true","fetch_graph":"https://pith.science/api/pith-number/IM57UBIXCRFDTQNZUAIVFD22JZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IM57UBIXCRFDTQNZUAIVFD22JZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IM57UBIXCRFDTQNZUAIVFD22JZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IM57UBIXCRFDTQNZUAIVFD22JZ/action/storage_attestation","attest_author":"https://pith.science/pith/IM57UBIXCRFDTQNZUAIVFD22JZ/action/author_attestation","sign_citation":"https://pith.science/pith/IM57UBIXCRFDTQNZUAIVFD22JZ/action/citation_signature","submit_replication":"https://pith.science/pith/IM57UBIXCRFDTQNZUAIVFD22JZ/action/replication_record"}},"created_at":"2026-05-18T01:16:23.545552+00:00","updated_at":"2026-05-18T01:16:23.545552+00:00"}