{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LVSYKZCJYLEUNMPRU6BWOSR6D5","short_pith_number":"pith:LVSYKZCJ","schema_version":"1.0","canonical_sha256":"5d65856449c2c946b1f1a783674a3e1f76cf80ffb7660f99dd4dc243a2ef8416","source":{"kind":"arxiv","id":"2006.04138","version":1},"attestation_state":"computed","paper":{"title":"Maximum Phase Modeling for Sparse Linear Prediction of Speech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.SD"],"primary_cat":"eess.AS","authors_text":"Thomas Drugman","submitted_at":"2020-06-07T12:34:20Z","abstract_excerpt":"Linear prediction (LP) is an ubiquitous analysis method in speech processing. Various studies have focused on sparse LP algorithms by introducing sparsity constraints into the LP framework. Sparse LP has been shown to be effective in several issues related to speech modeling and coding. However, all existing approaches assume the speech signal to be minimum-phase. Because speech is known to be mixed-phase, the resulting residual signal contains a persistent maximum-phase component. The aim of this paper is to propose a novel technique which incorporates a modeling of the maximum-phase contribu"},"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":"2006.04138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.AS","submitted_at":"2020-06-07T12:34:20Z","cross_cats_sorted":["cs.CL","cs.SD"],"title_canon_sha256":"c9c219365d2ae8950c515d77da5731a9e8492507f5992e79105665ab535e2378","abstract_canon_sha256":"7b3435222167ac74176a306315c19f86977e8031e330b9aa2c9d20769c7b8a64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:36.447358Z","signature_b64":"e5JUnPRvbtxyx7gS+Eluitsb4W+JfpxpchpymOQcVbJiKHOgl15Xjcfm+VSV9aYUf4rPVd3U8qchCjtsIkoBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d65856449c2c946b1f1a783674a3e1f76cf80ffb7660f99dd4dc243a2ef8416","last_reissued_at":"2026-07-05T01:08:36.446922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:36.446922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Phase Modeling for Sparse Linear Prediction of Speech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.SD"],"primary_cat":"eess.AS","authors_text":"Thomas Drugman","submitted_at":"2020-06-07T12:34:20Z","abstract_excerpt":"Linear prediction (LP) is an ubiquitous analysis method in speech processing. Various studies have focused on sparse LP algorithms by introducing sparsity constraints into the LP framework. Sparse LP has been shown to be effective in several issues related to speech modeling and coding. However, all existing approaches assume the speech signal to be minimum-phase. Because speech is known to be mixed-phase, the resulting residual signal contains a persistent maximum-phase component. The aim of this paper is to propose a novel technique which incorporates a modeling of the maximum-phase contribu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.04138","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/2006.04138/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":"2006.04138","created_at":"2026-07-05T01:08:36.446980+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.04138v1","created_at":"2026-07-05T01:08:36.446980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.04138","created_at":"2026-07-05T01:08:36.446980+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVSYKZCJYLEU","created_at":"2026-07-05T01:08:36.446980+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVSYKZCJYLEUNMPR","created_at":"2026-07-05T01:08:36.446980+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVSYKZCJ","created_at":"2026-07-05T01:08:36.446980+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/LVSYKZCJYLEUNMPRU6BWOSR6D5","json":"https://pith.science/pith/LVSYKZCJYLEUNMPRU6BWOSR6D5.json","graph_json":"https://pith.science/api/pith-number/LVSYKZCJYLEUNMPRU6BWOSR6D5/graph.json","events_json":"https://pith.science/api/pith-number/LVSYKZCJYLEUNMPRU6BWOSR6D5/events.json","paper":"https://pith.science/paper/LVSYKZCJ"},"agent_actions":{"view_html":"https://pith.science/pith/LVSYKZCJYLEUNMPRU6BWOSR6D5","download_json":"https://pith.science/pith/LVSYKZCJYLEUNMPRU6BWOSR6D5.json","view_paper":"https://pith.science/paper/LVSYKZCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.04138&json=true","fetch_graph":"https://pith.science/api/pith-number/LVSYKZCJYLEUNMPRU6BWOSR6D5/graph.json","fetch_events":"https://pith.science/api/pith-number/LVSYKZCJYLEUNMPRU6BWOSR6D5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVSYKZCJYLEUNMPRU6BWOSR6D5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVSYKZCJYLEUNMPRU6BWOSR6D5/action/storage_attestation","attest_author":"https://pith.science/pith/LVSYKZCJYLEUNMPRU6BWOSR6D5/action/author_attestation","sign_citation":"https://pith.science/pith/LVSYKZCJYLEUNMPRU6BWOSR6D5/action/citation_signature","submit_replication":"https://pith.science/pith/LVSYKZCJYLEUNMPRU6BWOSR6D5/action/replication_record"}},"created_at":"2026-07-05T01:08:36.446980+00:00","updated_at":"2026-07-05T01:08:36.446980+00:00"}