{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3KNXRER5TSHFV7HKFYIO2TSUMP","short_pith_number":"pith:3KNXRER5","schema_version":"1.0","canonical_sha256":"da9b78923d9c8e5afcea2e10ed4e5463f92a4f0b230f19df76272044b3d69cce","source":{"kind":"arxiv","id":"1304.0413","version":2},"attestation_state":"computed","paper":{"title":"An Efficient and Optimal Filter for Identifying Point Sources in Millimeter/Sub-Millimeter Wavelength Sky Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.CO"],"primary_cat":"astro-ph.IM","authors_text":"(2) University of Massachusetts Amherst, (3) National Radio Astronomy Observatory, (4) University of Colorado Boulder), A. Mancera (1) ((1) Illinois Wesleyan University, G. W. Wilson (2), J. E. Austermann (4), J. R. Schaar (1), K. S. Scott (3), T. A. Perera (1)","submitted_at":"2013-04-01T18:40:57Z","abstract_excerpt":"A new technique for reliably identifying point sources in millimeter/sub-millimeter wavelength maps is presented. This method accounts for the frequency dependence of noise in the Fourier domain as well as non-uniformities in the coverage of a field. This optimal filter is an improvement over commonly-used matched filters that ignore coverage gradients. Treating noise variations in the Fourier domain as well as map space is traditionally viewed as a computationally intensive problem. We show that the penalty incurred in terms of computing time is quite small due to casting many of the calculat"},"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":"1304.0413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2013-04-01T18:40:57Z","cross_cats_sorted":["astro-ph.CO"],"title_canon_sha256":"954f0dccc8c643fe7b67be6f0136e0a70d45e335fde3ff74bdc6c9876094cdb2","abstract_canon_sha256":"bb61828e157c552851ba379f42c4bde528e2fd9b2f21ca15e5d4213b9843c167"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:50:50.473611Z","signature_b64":"JVk2buXb3oSvT7p4HjuXkbkt0QMI1YTUABYsdd1XEJyKv/5/NwxshOrncHJSEVoODPaLHnNFuZk2H8q2AZx3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da9b78923d9c8e5afcea2e10ed4e5463f92a4f0b230f19df76272044b3d69cce","last_reissued_at":"2026-05-18T01:50:50.473044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:50:50.473044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient and Optimal Filter for Identifying Point Sources in Millimeter/Sub-Millimeter Wavelength Sky Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.CO"],"primary_cat":"astro-ph.IM","authors_text":"(2) University of Massachusetts Amherst, (3) National Radio Astronomy Observatory, (4) University of Colorado Boulder), A. Mancera (1) ((1) Illinois Wesleyan University, G. W. Wilson (2), J. E. Austermann (4), J. R. Schaar (1), K. S. Scott (3), T. A. Perera (1)","submitted_at":"2013-04-01T18:40:57Z","abstract_excerpt":"A new technique for reliably identifying point sources in millimeter/sub-millimeter wavelength maps is presented. This method accounts for the frequency dependence of noise in the Fourier domain as well as non-uniformities in the coverage of a field. This optimal filter is an improvement over commonly-used matched filters that ignore coverage gradients. Treating noise variations in the Fourier domain as well as map space is traditionally viewed as a computationally intensive problem. We show that the penalty incurred in terms of computing time is quite small due to casting many of the calculat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0413","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":"1304.0413","created_at":"2026-05-18T01:50:50.473141+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0413v2","created_at":"2026-05-18T01:50:50.473141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0413","created_at":"2026-05-18T01:50:50.473141+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KNXRER5TSHF","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KNXRER5TSHFV7HK","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KNXRER5","created_at":"2026-05-18T12:27:32.513160+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/3KNXRER5TSHFV7HKFYIO2TSUMP","json":"https://pith.science/pith/3KNXRER5TSHFV7HKFYIO2TSUMP.json","graph_json":"https://pith.science/api/pith-number/3KNXRER5TSHFV7HKFYIO2TSUMP/graph.json","events_json":"https://pith.science/api/pith-number/3KNXRER5TSHFV7HKFYIO2TSUMP/events.json","paper":"https://pith.science/paper/3KNXRER5"},"agent_actions":{"view_html":"https://pith.science/pith/3KNXRER5TSHFV7HKFYIO2TSUMP","download_json":"https://pith.science/pith/3KNXRER5TSHFV7HKFYIO2TSUMP.json","view_paper":"https://pith.science/paper/3KNXRER5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0413&json=true","fetch_graph":"https://pith.science/api/pith-number/3KNXRER5TSHFV7HKFYIO2TSUMP/graph.json","fetch_events":"https://pith.science/api/pith-number/3KNXRER5TSHFV7HKFYIO2TSUMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KNXRER5TSHFV7HKFYIO2TSUMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KNXRER5TSHFV7HKFYIO2TSUMP/action/storage_attestation","attest_author":"https://pith.science/pith/3KNXRER5TSHFV7HKFYIO2TSUMP/action/author_attestation","sign_citation":"https://pith.science/pith/3KNXRER5TSHFV7HKFYIO2TSUMP/action/citation_signature","submit_replication":"https://pith.science/pith/3KNXRER5TSHFV7HKFYIO2TSUMP/action/replication_record"}},"created_at":"2026-05-18T01:50:50.473141+00:00","updated_at":"2026-05-18T01:50:50.473141+00:00"}