{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GHZAFGQROOR3KI3R3XBT52YJ47","short_pith_number":"pith:GHZAFGQR","schema_version":"1.0","canonical_sha256":"31f2029a1173a3b52371ddc33eeb09e7d7b88abfeab8a55681d34cceed828348","source":{"kind":"arxiv","id":"1805.00321","version":2},"attestation_state":"computed","paper":{"title":"PURE: Scalable Phase Unwrapping with Spatial Redundant Arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS"],"primary_cat":"cs.OH","authors_text":"Ravi Lanka","submitted_at":"2018-04-19T06:05:07Z","abstract_excerpt":"Phase unwrapping is a key problem in many coherent imaging systems, such as synthetic aperture radar (SAR) interferometry. A general formulation for redundant integration of finite differences for phase unwrapping (Costantini et al., 2010) was shown to produce a more reliable solution by exploiting redundant differential estimates. However, this technique requires a commercial linear programming solver for large-scale problems. For a linear cost function, we propose a method based on Dual Decomposition that breaks the given problem defined over a non-planar graph into tractable sub-problems ov"},"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.00321","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-04-19T06:05:07Z","cross_cats_sorted":["cs.CV","cs.DS"],"title_canon_sha256":"008054e93abcf1b533ad6beb7a7522b5116837d289cad2862c8d40e3b3c3e4ec","abstract_canon_sha256":"e1ce04d49cfc85c173b00fe8e7745014ef392702ce67175750813665bf66fdfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:53.120784Z","signature_b64":"SqBdd5QvxON5wyculef43vDK19BSSXq7dYfqQMKw2I0DjZLhYMVCvSu0hwe/CrGVhRR2cGelUEMjyWdLwCwACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31f2029a1173a3b52371ddc33eeb09e7d7b88abfeab8a55681d34cceed828348","last_reissued_at":"2026-05-18T00:16:53.120084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:53.120084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PURE: Scalable Phase Unwrapping with Spatial Redundant Arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS"],"primary_cat":"cs.OH","authors_text":"Ravi Lanka","submitted_at":"2018-04-19T06:05:07Z","abstract_excerpt":"Phase unwrapping is a key problem in many coherent imaging systems, such as synthetic aperture radar (SAR) interferometry. A general formulation for redundant integration of finite differences for phase unwrapping (Costantini et al., 2010) was shown to produce a more reliable solution by exploiting redundant differential estimates. However, this technique requires a commercial linear programming solver for large-scale problems. For a linear cost function, we propose a method based on Dual Decomposition that breaks the given problem defined over a non-planar graph into tractable sub-problems ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00321","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":"1805.00321","created_at":"2026-05-18T00:16:53.120174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00321v2","created_at":"2026-05-18T00:16:53.120174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00321","created_at":"2026-05-18T00:16:53.120174+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHZAFGQROOR3","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHZAFGQROOR3KI3R","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHZAFGQR","created_at":"2026-05-18T12:32:25.280505+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/GHZAFGQROOR3KI3R3XBT52YJ47","json":"https://pith.science/pith/GHZAFGQROOR3KI3R3XBT52YJ47.json","graph_json":"https://pith.science/api/pith-number/GHZAFGQROOR3KI3R3XBT52YJ47/graph.json","events_json":"https://pith.science/api/pith-number/GHZAFGQROOR3KI3R3XBT52YJ47/events.json","paper":"https://pith.science/paper/GHZAFGQR"},"agent_actions":{"view_html":"https://pith.science/pith/GHZAFGQROOR3KI3R3XBT52YJ47","download_json":"https://pith.science/pith/GHZAFGQROOR3KI3R3XBT52YJ47.json","view_paper":"https://pith.science/paper/GHZAFGQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00321&json=true","fetch_graph":"https://pith.science/api/pith-number/GHZAFGQROOR3KI3R3XBT52YJ47/graph.json","fetch_events":"https://pith.science/api/pith-number/GHZAFGQROOR3KI3R3XBT52YJ47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHZAFGQROOR3KI3R3XBT52YJ47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHZAFGQROOR3KI3R3XBT52YJ47/action/storage_attestation","attest_author":"https://pith.science/pith/GHZAFGQROOR3KI3R3XBT52YJ47/action/author_attestation","sign_citation":"https://pith.science/pith/GHZAFGQROOR3KI3R3XBT52YJ47/action/citation_signature","submit_replication":"https://pith.science/pith/GHZAFGQROOR3KI3R3XBT52YJ47/action/replication_record"}},"created_at":"2026-05-18T00:16:53.120174+00:00","updated_at":"2026-05-18T00:16:53.120174+00:00"}