{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VE7NDYQGNFFMHNCP5CHFFG7K4S","short_pith_number":"pith:VE7NDYQG","schema_version":"1.0","canonical_sha256":"a93ed1e206694ac3b44fe88e529beae4ad662257326fb3a2ddd8bf1ca9f30906","source":{"kind":"arxiv","id":"2209.11638","version":2},"attestation_state":"computed","paper":{"title":"GSP-Based MAP Estimation of Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Guy Sagi, Tirza Routtenberg","submitted_at":"2022-09-23T15:08:25Z","abstract_excerpt":"In this paper, we consider the problem of recovering random graph signals from nonlinear measurements. We formulate the maximum a-posteriori probability (MAP) estimator, which results in a nonconvex optimization problem. Conventional iterative methods for minimizing nonconvex problems are sensitive to the initialization, have high computational complexity, and do not utilize the underlying graph structure behind the data. In this paper we propose two new estimators that are both based on the Gauss-Newton method: 1) the elementwise graph-frequency-domain MAP (eGFD-MAP) estimator; and 2) the gra"},"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":"2209.11638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-09-23T15:08:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f99a72a65cfb9329035ae4805fcc5ff86ac9538bd55fb61fea3fc6d6e5453bf3","abstract_canon_sha256":"5ead2cdac4c1c3b0429c8e460019c833dceb5939f45cfc56361b846f92a16477"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:16.709941Z","signature_b64":"41DcoRKLBMaGzmAtq2vhW7cdEkzD3kdGc9Z8uiCnMKDHNkyQI4O2J5qc4OrNVG83/2J0OZNujRgGPh/yyqtPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a93ed1e206694ac3b44fe88e529beae4ad662257326fb3a2ddd8bf1ca9f30906","last_reissued_at":"2026-07-05T09:26:16.708994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:16.708994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GSP-Based MAP Estimation of Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Guy Sagi, Tirza Routtenberg","submitted_at":"2022-09-23T15:08:25Z","abstract_excerpt":"In this paper, we consider the problem of recovering random graph signals from nonlinear measurements. We formulate the maximum a-posteriori probability (MAP) estimator, which results in a nonconvex optimization problem. Conventional iterative methods for minimizing nonconvex problems are sensitive to the initialization, have high computational complexity, and do not utilize the underlying graph structure behind the data. In this paper we propose two new estimators that are both based on the Gauss-Newton method: 1) the elementwise graph-frequency-domain MAP (eGFD-MAP) estimator; and 2) the gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.11638","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.11638/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2209.11638","created_at":"2026-07-05T09:26:16.709450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.11638v2","created_at":"2026-07-05T09:26:16.709450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.11638","created_at":"2026-07-05T09:26:16.709450+00:00"},{"alias_kind":"pith_short_12","alias_value":"VE7NDYQGNFFM","created_at":"2026-07-05T09:26:16.709450+00:00"},{"alias_kind":"pith_short_16","alias_value":"VE7NDYQGNFFMHNCP","created_at":"2026-07-05T09:26:16.709450+00:00"},{"alias_kind":"pith_short_8","alias_value":"VE7NDYQG","created_at":"2026-07-05T09:26:16.709450+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28225","citing_title":"Estimation-Prediction Tradeoff in Causal Probabilistic Temporal Graphs","ref_index":164,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VE7NDYQGNFFMHNCP5CHFFG7K4S","json":"https://pith.science/pith/VE7NDYQGNFFMHNCP5CHFFG7K4S.json","graph_json":"https://pith.science/api/pith-number/VE7NDYQGNFFMHNCP5CHFFG7K4S/graph.json","events_json":"https://pith.science/api/pith-number/VE7NDYQGNFFMHNCP5CHFFG7K4S/events.json","paper":"https://pith.science/paper/VE7NDYQG"},"agent_actions":{"view_html":"https://pith.science/pith/VE7NDYQGNFFMHNCP5CHFFG7K4S","download_json":"https://pith.science/pith/VE7NDYQGNFFMHNCP5CHFFG7K4S.json","view_paper":"https://pith.science/paper/VE7NDYQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.11638&json=true","fetch_graph":"https://pith.science/api/pith-number/VE7NDYQGNFFMHNCP5CHFFG7K4S/graph.json","fetch_events":"https://pith.science/api/pith-number/VE7NDYQGNFFMHNCP5CHFFG7K4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VE7NDYQGNFFMHNCP5CHFFG7K4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VE7NDYQGNFFMHNCP5CHFFG7K4S/action/storage_attestation","attest_author":"https://pith.science/pith/VE7NDYQGNFFMHNCP5CHFFG7K4S/action/author_attestation","sign_citation":"https://pith.science/pith/VE7NDYQGNFFMHNCP5CHFFG7K4S/action/citation_signature","submit_replication":"https://pith.science/pith/VE7NDYQGNFFMHNCP5CHFFG7K4S/action/replication_record"}},"created_at":"2026-07-05T09:26:16.709450+00:00","updated_at":"2026-07-05T09:26:16.709450+00:00"}