{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OE7ZTHGS4XE7TZLVIE7I4XVKYE","short_pith_number":"pith:OE7ZTHGS","schema_version":"1.0","canonical_sha256":"713f999cd2e5c9f9e575413e8e5eaac133e9c372867aab30ec9317c3824d2b0c","source":{"kind":"arxiv","id":"2403.06821","version":1},"attestation_state":"computed","paper":{"title":"On discrete-time arrival processes and related random motions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alejandro P. Riascos, Federico Polito, Giuseppe D'Onofrio, Thomas M. Michelitsch","submitted_at":"2024-03-11T15:40:07Z","abstract_excerpt":"We consider three kinds of discrete-time arrival processes: transient, intermediate and recurrent, characterized by a finite, possibly finite and infinite number of events, respectively. In this context, we study renewal processes which are stopped at the first event of a further independent renewal process whose inter-arrival time distribution can be defective. If this is the case, the resulting arrival process is of an intermediate nature. For non-defective absorbing times, the resulting arrival process is transient, i.e.\\ stopped almost surely. For these processes we derive finite time and "},"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":"2403.06821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-03-11T15:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"96dd70d273498a11d07fa961044fee80745b1c0cd298d1e28853486d925e05ac","abstract_canon_sha256":"35b6e46434cce2f1fcfe850292c9f6bfee04b2a5206253013e90997e2fa4c8cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:43.143426Z","signature_b64":"mCwezg78i3AaHiNk9ODbNPsFiSoyh89r9J4sn/4mzx+4noEGvE5hnosPiUkJ2lYyqduAYdo65kjTheqYSIWkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"713f999cd2e5c9f9e575413e8e5eaac133e9c372867aab30ec9317c3824d2b0c","last_reissued_at":"2026-07-05T07:54:43.142986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:43.142986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On discrete-time arrival processes and related random motions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alejandro P. Riascos, Federico Polito, Giuseppe D'Onofrio, Thomas M. Michelitsch","submitted_at":"2024-03-11T15:40:07Z","abstract_excerpt":"We consider three kinds of discrete-time arrival processes: transient, intermediate and recurrent, characterized by a finite, possibly finite and infinite number of events, respectively. In this context, we study renewal processes which are stopped at the first event of a further independent renewal process whose inter-arrival time distribution can be defective. If this is the case, the resulting arrival process is of an intermediate nature. For non-defective absorbing times, the resulting arrival process is transient, i.e.\\ stopped almost surely. For these processes we derive finite time and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06821","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/2403.06821/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":"2403.06821","created_at":"2026-07-05T07:54:43.143042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.06821v1","created_at":"2026-07-05T07:54:43.143042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06821","created_at":"2026-07-05T07:54:43.143042+00:00"},{"alias_kind":"pith_short_12","alias_value":"OE7ZTHGS4XE7","created_at":"2026-07-05T07:54:43.143042+00:00"},{"alias_kind":"pith_short_16","alias_value":"OE7ZTHGS4XE7TZLV","created_at":"2026-07-05T07:54:43.143042+00:00"},{"alias_kind":"pith_short_8","alias_value":"OE7ZTHGS","created_at":"2026-07-05T07:54:43.143042+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08558","citing_title":"From random walks to epidemic spreading: Compartment model with mortality for vector transmitted diseases","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OE7ZTHGS4XE7TZLVIE7I4XVKYE","json":"https://pith.science/pith/OE7ZTHGS4XE7TZLVIE7I4XVKYE.json","graph_json":"https://pith.science/api/pith-number/OE7ZTHGS4XE7TZLVIE7I4XVKYE/graph.json","events_json":"https://pith.science/api/pith-number/OE7ZTHGS4XE7TZLVIE7I4XVKYE/events.json","paper":"https://pith.science/paper/OE7ZTHGS"},"agent_actions":{"view_html":"https://pith.science/pith/OE7ZTHGS4XE7TZLVIE7I4XVKYE","download_json":"https://pith.science/pith/OE7ZTHGS4XE7TZLVIE7I4XVKYE.json","view_paper":"https://pith.science/paper/OE7ZTHGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.06821&json=true","fetch_graph":"https://pith.science/api/pith-number/OE7ZTHGS4XE7TZLVIE7I4XVKYE/graph.json","fetch_events":"https://pith.science/api/pith-number/OE7ZTHGS4XE7TZLVIE7I4XVKYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OE7ZTHGS4XE7TZLVIE7I4XVKYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OE7ZTHGS4XE7TZLVIE7I4XVKYE/action/storage_attestation","attest_author":"https://pith.science/pith/OE7ZTHGS4XE7TZLVIE7I4XVKYE/action/author_attestation","sign_citation":"https://pith.science/pith/OE7ZTHGS4XE7TZLVIE7I4XVKYE/action/citation_signature","submit_replication":"https://pith.science/pith/OE7ZTHGS4XE7TZLVIE7I4XVKYE/action/replication_record"}},"created_at":"2026-07-05T07:54:43.143042+00:00","updated_at":"2026-07-05T07:54:43.143042+00:00"}