{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KB36STXZKUYHDHOQEME4VEFC7F","short_pith_number":"pith:KB36STXZ","schema_version":"1.0","canonical_sha256":"5077e94ef95530719dd02309ca90a2f97cdc66f665451737b08db6d0b2f7ea19","source":{"kind":"arxiv","id":"1703.07001","version":1},"attestation_state":"computed","paper":{"title":"Recovery of the starting times of delayed signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.data-an","authors_text":"Daniel Bessis, Daniel Vrinceanu, Luca Perotti","submitted_at":"2017-03-20T23:21:02Z","abstract_excerpt":"We present a new method to locate the starting points in time of an arbitrary number of (damped) delayed signals. For a finite data sequence, the method permits to first locate the starting point of the component with the longest delay, and then --by iteration-- all the preceding ones. Numerical examples are given and noise sensitivity is tested for weak noise."},"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":"1703.07001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2017-03-20T23:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"5e8d59e8368cf602f0a9e55fbb096d64f0c41a15a1f8ddd6211b1b2ce51eeeaf","abstract_canon_sha256":"b1fae968f45662541c69d076a1528a9f47d65c6aa67c0c274e22db4034c55d8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:19.790199Z","signature_b64":"5+hnTArFmuE8c0JwZuNIQG4fk1jeQMF5xDdYYOiYInNPOessosGfm9BVl+xnSR11iQ6W21Y/iszhASgqqZpMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5077e94ef95530719dd02309ca90a2f97cdc66f665451737b08db6d0b2f7ea19","last_reissued_at":"2026-05-18T00:03:19.789609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:19.789609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovery of the starting times of delayed signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.data-an","authors_text":"Daniel Bessis, Daniel Vrinceanu, Luca Perotti","submitted_at":"2017-03-20T23:21:02Z","abstract_excerpt":"We present a new method to locate the starting points in time of an arbitrary number of (damped) delayed signals. For a finite data sequence, the method permits to first locate the starting point of the component with the longest delay, and then --by iteration-- all the preceding ones. Numerical examples are given and noise sensitivity is tested for weak noise."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07001","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.07001","created_at":"2026-05-18T00:03:19.789695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07001v1","created_at":"2026-05-18T00:03:19.789695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07001","created_at":"2026-05-18T00:03:19.789695+00:00"},{"alias_kind":"pith_short_12","alias_value":"KB36STXZKUYH","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KB36STXZKUYHDHOQ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KB36STXZ","created_at":"2026-05-18T12:31:24.725408+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/KB36STXZKUYHDHOQEME4VEFC7F","json":"https://pith.science/pith/KB36STXZKUYHDHOQEME4VEFC7F.json","graph_json":"https://pith.science/api/pith-number/KB36STXZKUYHDHOQEME4VEFC7F/graph.json","events_json":"https://pith.science/api/pith-number/KB36STXZKUYHDHOQEME4VEFC7F/events.json","paper":"https://pith.science/paper/KB36STXZ"},"agent_actions":{"view_html":"https://pith.science/pith/KB36STXZKUYHDHOQEME4VEFC7F","download_json":"https://pith.science/pith/KB36STXZKUYHDHOQEME4VEFC7F.json","view_paper":"https://pith.science/paper/KB36STXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07001&json=true","fetch_graph":"https://pith.science/api/pith-number/KB36STXZKUYHDHOQEME4VEFC7F/graph.json","fetch_events":"https://pith.science/api/pith-number/KB36STXZKUYHDHOQEME4VEFC7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KB36STXZKUYHDHOQEME4VEFC7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KB36STXZKUYHDHOQEME4VEFC7F/action/storage_attestation","attest_author":"https://pith.science/pith/KB36STXZKUYHDHOQEME4VEFC7F/action/author_attestation","sign_citation":"https://pith.science/pith/KB36STXZKUYHDHOQEME4VEFC7F/action/citation_signature","submit_replication":"https://pith.science/pith/KB36STXZKUYHDHOQEME4VEFC7F/action/replication_record"}},"created_at":"2026-05-18T00:03:19.789695+00:00","updated_at":"2026-05-18T00:03:19.789695+00:00"}