{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2WIV7H25ZOK5QB4B5VOMR7XXIT","short_pith_number":"pith:2WIV7H25","canonical_record":{"source":{"id":"1603.01824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2016-03-06T13:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"eb2194945b3b22813f5df92fd8a0c996e99b7b5d60cacdf452bc400e3bd6e92b","abstract_canon_sha256":"81cfa0661dc051d91ef74e66aec1d48c3b3f8d937e2172af2ede0c1f8ccec3d5"},"schema_version":"1.0"},"canonical_sha256":"d5915f9f5dcb95d80781ed5cc8fef744c73141daaa69aa446a54613ca2b08b36","source":{"kind":"arxiv","id":"1603.01824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01824","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01824v1","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01824","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"2WIV7H25ZOK5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WIV7H25ZOK5QB4B","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WIV7H25","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2WIV7H25ZOK5QB4B5VOMR7XXIT","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2016-03-06T13:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"eb2194945b3b22813f5df92fd8a0c996e99b7b5d60cacdf452bc400e3bd6e92b","abstract_canon_sha256":"81cfa0661dc051d91ef74e66aec1d48c3b3f8d937e2172af2ede0c1f8ccec3d5"},"schema_version":"1.0"},"canonical_sha256":"d5915f9f5dcb95d80781ed5cc8fef744c73141daaa69aa446a54613ca2b08b36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:33.568231Z","signature_b64":"UnCNYpREjNDSPCk+LR0SDdr81yME5TdF+91o02OsAxuCzEZ8rP58DqNCz7+VdhsEbfbshhjTnNzF6hl6ECpvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5915f9f5dcb95d80781ed5cc8fef744c73141daaa69aa446a54613ca2b08b36","last_reissued_at":"2026-05-18T01:19:33.567836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:33.567836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01824","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otlAGmQfvOLhmJQLZcvdumbsxnOYAHj0xZa+TPqce155oyJ3kSg9QbfMVlU9G27BeLBiOD2Us1yguizxH5+aAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:51:58.300014Z"},"content_sha256":"1e01ae1aa5037a5fa6733c8a55ef7d0862a604aa6017435fa9daf6ed12d7a9c4","schema_version":"1.0","event_id":"sha256:1e01ae1aa5037a5fa6733c8a55ef7d0862a604aa6017435fa9daf6ed12d7a9c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2WIV7H25ZOK5QB4B5VOMR7XXIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Iterative Sinusoidal Parameter Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SD","authors_text":"Christopher Montgomery, Daniel V. Smith, Jean-Marc Valin, Timothy B. Terriberry","submitted_at":"2016-03-06T13:17:27Z","abstract_excerpt":"Sinusoidal parameter estimation is a computationally-intensive task, which can pose problems for real-time implementations. In this paper, we propose a low-complexity iterative method for estimating sinusoidal parameters that is based on the linearisation of the model around an initial frequency estimate. We show that for N sinusoids in a frame of length L, the proposed method has a complexity of O(LN), which is significantly less than the matching pursuits method. Furthermore, the proposed method is shown to be more accurate than the matching pursuits and time frequency reassignment methods i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01824","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhCUj/n5eiQLHbp3VSR+uXFBPaD2o6jHOE0Z2l6hJgZJislE9If4oL+iVGerQSB/uCa1fvhHy9KLk6xtvjUvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:51:58.300468Z"},"content_sha256":"ff4942bce34dcdeeaead442f401e9bbdc1764e25c605549392bf33ffd77cd17c","schema_version":"1.0","event_id":"sha256:ff4942bce34dcdeeaead442f401e9bbdc1764e25c605549392bf33ffd77cd17c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WIV7H25ZOK5QB4B5VOMR7XXIT/bundle.json","state_url":"https://pith.science/pith/2WIV7H25ZOK5QB4B5VOMR7XXIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WIV7H25ZOK5QB4B5VOMR7XXIT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T16:51:58Z","links":{"resolver":"https://pith.science/pith/2WIV7H25ZOK5QB4B5VOMR7XXIT","bundle":"https://pith.science/pith/2WIV7H25ZOK5QB4B5VOMR7XXIT/bundle.json","state":"https://pith.science/pith/2WIV7H25ZOK5QB4B5VOMR7XXIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WIV7H25ZOK5QB4B5VOMR7XXIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2WIV7H25ZOK5QB4B5VOMR7XXIT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"81cfa0661dc051d91ef74e66aec1d48c3b3f8d937e2172af2ede0c1f8ccec3d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2016-03-06T13:17:27Z","title_canon_sha256":"eb2194945b3b22813f5df92fd8a0c996e99b7b5d60cacdf452bc400e3bd6e92b"},"schema_version":"1.0","source":{"id":"1603.01824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01824","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01824v1","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01824","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"2WIV7H25ZOK5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WIV7H25ZOK5QB4B","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WIV7H25","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:ff4942bce34dcdeeaead442f401e9bbdc1764e25c605549392bf33ffd77cd17c","target":"graph","created_at":"2026-05-18T01:19:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Sinusoidal parameter estimation is a computationally-intensive task, which can pose problems for real-time implementations. In this paper, we propose a low-complexity iterative method for estimating sinusoidal parameters that is based on the linearisation of the model around an initial frequency estimate. We show that for N sinusoids in a frame of length L, the proposed method has a complexity of O(LN), which is significantly less than the matching pursuits method. Furthermore, the proposed method is shown to be more accurate than the matching pursuits and time frequency reassignment methods i","authors_text":"Christopher Montgomery, Daniel V. Smith, Jean-Marc Valin, Timothy B. Terriberry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2016-03-06T13:17:27Z","title":"Low-Complexity Iterative Sinusoidal Parameter Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01824","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1e01ae1aa5037a5fa6733c8a55ef7d0862a604aa6017435fa9daf6ed12d7a9c4","target":"record","created_at":"2026-05-18T01:19:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"81cfa0661dc051d91ef74e66aec1d48c3b3f8d937e2172af2ede0c1f8ccec3d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2016-03-06T13:17:27Z","title_canon_sha256":"eb2194945b3b22813f5df92fd8a0c996e99b7b5d60cacdf452bc400e3bd6e92b"},"schema_version":"1.0","source":{"id":"1603.01824","kind":"arxiv","version":1}},"canonical_sha256":"d5915f9f5dcb95d80781ed5cc8fef744c73141daaa69aa446a54613ca2b08b36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5915f9f5dcb95d80781ed5cc8fef744c73141daaa69aa446a54613ca2b08b36","first_computed_at":"2026-05-18T01:19:33.567836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:33.567836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UnCNYpREjNDSPCk+LR0SDdr81yME5TdF+91o02OsAxuCzEZ8rP58DqNCz7+VdhsEbfbshhjTnNzF6hl6ECpvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:33.568231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e01ae1aa5037a5fa6733c8a55ef7d0862a604aa6017435fa9daf6ed12d7a9c4","sha256:ff4942bce34dcdeeaead442f401e9bbdc1764e25c605549392bf33ffd77cd17c"],"state_sha256":"60317adcaebb955a9844ef95501101ed0ba84b65beca0fa6d00b048c19f76e88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OtjsGtC9AzbTFZgYgInZeSmrHXyUYwUhYYIGOUXSHorASmSMw+oJKx88zhpq6VKMcPMxi1L/8ZPVIfn/9GnSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:51:58.303403Z","bundle_sha256":"8518e9347b16b8f6f9821f14e85aee949b3a2e5a891fffa2c10304a34f2c34f4"}}