{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IPNW2KODKXH5XTPMOOKO7G26Q6","short_pith_number":"pith:IPNW2KOD","schema_version":"1.0","canonical_sha256":"43db6d29c355cfdbcdec7394ef9b5e8788431131007dcd5e94ec5999b7a219b1","source":{"kind":"arxiv","id":"2304.13204","version":1},"attestation_state":"computed","paper":{"title":"Numerical methods for computing the discrete and continuous Laplace transforms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math-ph","math.CV","math.MP"],"primary_cat":"math.NA","authors_text":"Daxuan Deng, Ivo D. Dinov, Rongqian Zhang, Yueyang Shen, Yunjie Guo, Yupeng Zhang, Yuyao Liu","submitted_at":"2023-04-26T00:10:50Z","abstract_excerpt":"We propose a numerical method to spline-interpolate discrete signals and then apply the integral transforms to the corresponding analytical spline functions. This represents a robust and computationally efficient technique for estimating the Laplace transform for noisy data. We revisited a Meijer-G symbolic approach to compute the Laplace transform and alternative approaches to extend canonical observed time-series. A discrete quantization scheme provides the foundation for rapid and reliable estimation of the inverse Laplace transform. We derive theoretic estimates for the inverse Laplace tra"},"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":"2304.13204","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2023-04-26T00:10:50Z","cross_cats_sorted":["cs.NA","math-ph","math.CV","math.MP"],"title_canon_sha256":"b0c5b64648fac35df5aac2684075ea93ecc0addac926873b5f94445b3c009815","abstract_canon_sha256":"1776b84034ab5dc14f704315746139fd66edebbfe349a161a631ad300013ad18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:04:41.010478Z","signature_b64":"/i3YMY2G5Wls+PX4xrrGF5plx1QZd108RBqYHvs/nkShom452wHymUwMTpcjX4zTvksyYYalslbPy3blidY0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43db6d29c355cfdbcdec7394ef9b5e8788431131007dcd5e94ec5999b7a219b1","last_reissued_at":"2026-07-05T06:04:41.010060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:04:41.010060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical methods for computing the discrete and continuous Laplace transforms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math-ph","math.CV","math.MP"],"primary_cat":"math.NA","authors_text":"Daxuan Deng, Ivo D. Dinov, Rongqian Zhang, Yueyang Shen, Yunjie Guo, Yupeng Zhang, Yuyao Liu","submitted_at":"2023-04-26T00:10:50Z","abstract_excerpt":"We propose a numerical method to spline-interpolate discrete signals and then apply the integral transforms to the corresponding analytical spline functions. This represents a robust and computationally efficient technique for estimating the Laplace transform for noisy data. We revisited a Meijer-G symbolic approach to compute the Laplace transform and alternative approaches to extend canonical observed time-series. A discrete quantization scheme provides the foundation for rapid and reliable estimation of the inverse Laplace transform. We derive theoretic estimates for the inverse Laplace tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.13204","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/2304.13204/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":"2304.13204","created_at":"2026-07-05T06:04:41.010116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.13204v1","created_at":"2026-07-05T06:04:41.010116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.13204","created_at":"2026-07-05T06:04:41.010116+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPNW2KODKXH5","created_at":"2026-07-05T06:04:41.010116+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPNW2KODKXH5XTPM","created_at":"2026-07-05T06:04:41.010116+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPNW2KOD","created_at":"2026-07-05T06:04:41.010116+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03269","citing_title":"Theory and Fast Learned Solver for $\\ell^1$-TV Regularization","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IPNW2KODKXH5XTPMOOKO7G26Q6","json":"https://pith.science/pith/IPNW2KODKXH5XTPMOOKO7G26Q6.json","graph_json":"https://pith.science/api/pith-number/IPNW2KODKXH5XTPMOOKO7G26Q6/graph.json","events_json":"https://pith.science/api/pith-number/IPNW2KODKXH5XTPMOOKO7G26Q6/events.json","paper":"https://pith.science/paper/IPNW2KOD"},"agent_actions":{"view_html":"https://pith.science/pith/IPNW2KODKXH5XTPMOOKO7G26Q6","download_json":"https://pith.science/pith/IPNW2KODKXH5XTPMOOKO7G26Q6.json","view_paper":"https://pith.science/paper/IPNW2KOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.13204&json=true","fetch_graph":"https://pith.science/api/pith-number/IPNW2KODKXH5XTPMOOKO7G26Q6/graph.json","fetch_events":"https://pith.science/api/pith-number/IPNW2KODKXH5XTPMOOKO7G26Q6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPNW2KODKXH5XTPMOOKO7G26Q6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPNW2KODKXH5XTPMOOKO7G26Q6/action/storage_attestation","attest_author":"https://pith.science/pith/IPNW2KODKXH5XTPMOOKO7G26Q6/action/author_attestation","sign_citation":"https://pith.science/pith/IPNW2KODKXH5XTPMOOKO7G26Q6/action/citation_signature","submit_replication":"https://pith.science/pith/IPNW2KODKXH5XTPMOOKO7G26Q6/action/replication_record"}},"created_at":"2026-07-05T06:04:41.010116+00:00","updated_at":"2026-07-05T06:04:41.010116+00:00"}