{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ALH62FUZ65HVU5IJOO2QVKX6QE","short_pith_number":"pith:ALH62FUZ","schema_version":"1.0","canonical_sha256":"02cfed1699f74f5a750973b50aaafe81084c95675fba68d0b7a336b21c94d186","source":{"kind":"arxiv","id":"2408.03142","version":2},"attestation_state":"computed","paper":{"title":"A Graph Signal Processing Perspective of Network Multiple Hypothesis Testing with False Discovery Rate Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Abdelhak M. Zoubir, Feng Ji, Martin G\\\"olz, Wee Peng Tay, Xingchao Jian","submitted_at":"2024-08-06T12:35:35Z","abstract_excerpt":"We consider a multiple hypothesis testing problem in a sensor network over the joint spatio-temporal domain. The sensor network is modeled as a graph, with each vertex representing a sensor and a signal over time associated with each vertex. We assume a hypothesis test and an associated $p$-value for every sample point in the joint spatio-temporal domain. Our goal is to determine which points have true alternative. By parameterizing the unknown $p$-value distribution under the alternative and the prior probabilities of hypotheses being null with a bandlimited generalized graph signal, we can o"},"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":"2408.03142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2024-08-06T12:35:35Z","cross_cats_sorted":[],"title_canon_sha256":"43894cd95a57aa9ba652923ae2989282b6f0dcdde5574b2d8f6a3f49ab5b0ae2","abstract_canon_sha256":"c8bda3e2dd69fa3929b5ad036fd62bbfcd9587eadeb4ea971c902f154f91f85a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:44.732954Z","signature_b64":"k2WyUA771zCsD1R3qQSID+ro1AwgZ1N41XFzvc/lldYJFTo03SnkzFLlagpQComPWTEqCXoDwkxcMTt8auuZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02cfed1699f74f5a750973b50aaafe81084c95675fba68d0b7a336b21c94d186","last_reissued_at":"2026-07-05T10:03:44.732452Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:44.732452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Graph Signal Processing Perspective of Network Multiple Hypothesis Testing with False Discovery Rate Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Abdelhak M. Zoubir, Feng Ji, Martin G\\\"olz, Wee Peng Tay, Xingchao Jian","submitted_at":"2024-08-06T12:35:35Z","abstract_excerpt":"We consider a multiple hypothesis testing problem in a sensor network over the joint spatio-temporal domain. The sensor network is modeled as a graph, with each vertex representing a sensor and a signal over time associated with each vertex. We assume a hypothesis test and an associated $p$-value for every sample point in the joint spatio-temporal domain. Our goal is to determine which points have true alternative. By parameterizing the unknown $p$-value distribution under the alternative and the prior probabilities of hypotheses being null with a bandlimited generalized graph signal, we can o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03142","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/2408.03142/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":"2408.03142","created_at":"2026-07-05T10:03:44.732511+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03142v2","created_at":"2026-07-05T10:03:44.732511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03142","created_at":"2026-07-05T10:03:44.732511+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALH62FUZ65HV","created_at":"2026-07-05T10:03:44.732511+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALH62FUZ65HVU5IJ","created_at":"2026-07-05T10:03:44.732511+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALH62FUZ","created_at":"2026-07-05T10:03:44.732511+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.03496","citing_title":"A Generalized Graph Signal Processing Framework for Multiple Hypothesis Testing over Networks","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALH62FUZ65HVU5IJOO2QVKX6QE","json":"https://pith.science/pith/ALH62FUZ65HVU5IJOO2QVKX6QE.json","graph_json":"https://pith.science/api/pith-number/ALH62FUZ65HVU5IJOO2QVKX6QE/graph.json","events_json":"https://pith.science/api/pith-number/ALH62FUZ65HVU5IJOO2QVKX6QE/events.json","paper":"https://pith.science/paper/ALH62FUZ"},"agent_actions":{"view_html":"https://pith.science/pith/ALH62FUZ65HVU5IJOO2QVKX6QE","download_json":"https://pith.science/pith/ALH62FUZ65HVU5IJOO2QVKX6QE.json","view_paper":"https://pith.science/paper/ALH62FUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03142&json=true","fetch_graph":"https://pith.science/api/pith-number/ALH62FUZ65HVU5IJOO2QVKX6QE/graph.json","fetch_events":"https://pith.science/api/pith-number/ALH62FUZ65HVU5IJOO2QVKX6QE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALH62FUZ65HVU5IJOO2QVKX6QE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALH62FUZ65HVU5IJOO2QVKX6QE/action/storage_attestation","attest_author":"https://pith.science/pith/ALH62FUZ65HVU5IJOO2QVKX6QE/action/author_attestation","sign_citation":"https://pith.science/pith/ALH62FUZ65HVU5IJOO2QVKX6QE/action/citation_signature","submit_replication":"https://pith.science/pith/ALH62FUZ65HVU5IJOO2QVKX6QE/action/replication_record"}},"created_at":"2026-07-05T10:03:44.732511+00:00","updated_at":"2026-07-05T10:03:44.732511+00:00"}