{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:G5GJ3IUMNTZDCJXUMXQ2KINR6I","short_pith_number":"pith:G5GJ3IUM","schema_version":"1.0","canonical_sha256":"374c9da28c6cf23126f465e1a521b1f224106f373b8e888e74e9e9df962c23d7","source":{"kind":"arxiv","id":"2004.13900","version":1},"attestation_state":"computed","paper":{"title":"A GPS spoofing detection and classification correlator-based technique using the LASSO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"eess.SP","authors_text":"David Akopian, Erick Schmidt, Nikolaos Gatsis","submitted_at":"2020-04-29T00:26:57Z","abstract_excerpt":"This work proposes a global navigation satellite system (GNSS) spoofing detection and classification technique for single antenna receivers. We formulate an optimization problem at the baseband correlator domain by using the Least Absolute Shrinkage and Selection Operator (LASSO). We model correlator tap outputs of the received signal to form a dictionary of triangle-shaped functions and leverage sparse signal processing to choose a decomposition of shifted matching triangles from said dictionary. The optimal solution of this minimization problem discriminates the presence of a potential spoof"},"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":"2004.13900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-04-29T00:26:57Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"7683fdb20fcc520973e620e681f543fdffcee5bc190fea1300cf93602ab722c3","abstract_canon_sha256":"599dd2490f73304ef58243a4ec693fc3f1bf766ded5f800202d0a295728340de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:59:05.333890Z","signature_b64":"Z7Zh/9y8VZrnxdqpxTkgePyS7hPaZhmrKcHOK3gq7rOgxtxpOko9LpVXzED23/LA4VRDALdan97jTZ2PuJiTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"374c9da28c6cf23126f465e1a521b1f224106f373b8e888e74e9e9df962c23d7","last_reissued_at":"2026-07-05T00:59:05.333439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:59:05.333439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A GPS spoofing detection and classification correlator-based technique using the LASSO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"eess.SP","authors_text":"David Akopian, Erick Schmidt, Nikolaos Gatsis","submitted_at":"2020-04-29T00:26:57Z","abstract_excerpt":"This work proposes a global navigation satellite system (GNSS) spoofing detection and classification technique for single antenna receivers. We formulate an optimization problem at the baseband correlator domain by using the Least Absolute Shrinkage and Selection Operator (LASSO). We model correlator tap outputs of the received signal to form a dictionary of triangle-shaped functions and leverage sparse signal processing to choose a decomposition of shifted matching triangles from said dictionary. The optimal solution of this minimization problem discriminates the presence of a potential spoof"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.13900","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.13900/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":"2004.13900","created_at":"2026-07-05T00:59:05.333502+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.13900v1","created_at":"2026-07-05T00:59:05.333502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.13900","created_at":"2026-07-05T00:59:05.333502+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5GJ3IUMNTZD","created_at":"2026-07-05T00:59:05.333502+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5GJ3IUMNTZDCJXU","created_at":"2026-07-05T00:59:05.333502+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5GJ3IUM","created_at":"2026-07-05T00:59:05.333502+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04613","citing_title":"DeePoly: A High-Order Accuracy Scientific Machine Learning Framework for Function Approximation and Solving PDEs","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G5GJ3IUMNTZDCJXUMXQ2KINR6I","json":"https://pith.science/pith/G5GJ3IUMNTZDCJXUMXQ2KINR6I.json","graph_json":"https://pith.science/api/pith-number/G5GJ3IUMNTZDCJXUMXQ2KINR6I/graph.json","events_json":"https://pith.science/api/pith-number/G5GJ3IUMNTZDCJXUMXQ2KINR6I/events.json","paper":"https://pith.science/paper/G5GJ3IUM"},"agent_actions":{"view_html":"https://pith.science/pith/G5GJ3IUMNTZDCJXUMXQ2KINR6I","download_json":"https://pith.science/pith/G5GJ3IUMNTZDCJXUMXQ2KINR6I.json","view_paper":"https://pith.science/paper/G5GJ3IUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.13900&json=true","fetch_graph":"https://pith.science/api/pith-number/G5GJ3IUMNTZDCJXUMXQ2KINR6I/graph.json","fetch_events":"https://pith.science/api/pith-number/G5GJ3IUMNTZDCJXUMXQ2KINR6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5GJ3IUMNTZDCJXUMXQ2KINR6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5GJ3IUMNTZDCJXUMXQ2KINR6I/action/storage_attestation","attest_author":"https://pith.science/pith/G5GJ3IUMNTZDCJXUMXQ2KINR6I/action/author_attestation","sign_citation":"https://pith.science/pith/G5GJ3IUMNTZDCJXUMXQ2KINR6I/action/citation_signature","submit_replication":"https://pith.science/pith/G5GJ3IUMNTZDCJXUMXQ2KINR6I/action/replication_record"}},"created_at":"2026-07-05T00:59:05.333502+00:00","updated_at":"2026-07-05T00:59:05.333502+00:00"}