{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ND7EHGWVBP3KAHLVXTIMQTQIWS","short_pith_number":"pith:ND7EHGWV","schema_version":"1.0","canonical_sha256":"68fe439ad50bf6a01d75bcd0c84e08b4838a972dffa7b1112115fc8fbd529e63","source":{"kind":"arxiv","id":"1512.01180","version":1},"attestation_state":"computed","paper":{"title":"Bridges of Markov counting processes: quantitative estimates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Giovanni Conforti","submitted_at":"2015-12-03T18:22:32Z","abstract_excerpt":"In this paper we investigate the behavior of the bridges of a Markov counting process in several directions. We first characterize convexity(concavity) in time of the mean value in terms of lower (upper) bounds on the so called \\textit{reciprocal characteristics}. This result gives a natural criterion to determine whether bridges are \"lazy\" or \"hurried\". Under the hypothesis of global bounds on the reciprocal characteristics we prove sharp estimates for the marginal distributions and a comparison theorem for the jump times. When the height of the bridge tends to infinity we show the convergenc"},"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":"1512.01180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-03T18:22:32Z","cross_cats_sorted":[],"title_canon_sha256":"19c1c5f11444bf814243e76dabe47fef0ac73bd750f4cab3436fdde43a066d3e","abstract_canon_sha256":"8b1a289616ab3431ccaa5808b1b89bfed48ddbfb361b89388afc4a7a7b7a6e9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:18.744657Z","signature_b64":"JGaGrWZy6DCccqdPL7n76ZwxaXLW1rZDjGlUXww3VeizUUJg27S08WmYNgN7A03Ev2aMYXI0NobnOl+RW5yFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68fe439ad50bf6a01d75bcd0c84e08b4838a972dffa7b1112115fc8fbd529e63","last_reissued_at":"2026-05-18T01:25:18.744143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:18.744143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bridges of Markov counting processes: quantitative estimates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Giovanni Conforti","submitted_at":"2015-12-03T18:22:32Z","abstract_excerpt":"In this paper we investigate the behavior of the bridges of a Markov counting process in several directions. We first characterize convexity(concavity) in time of the mean value in terms of lower (upper) bounds on the so called \\textit{reciprocal characteristics}. This result gives a natural criterion to determine whether bridges are \"lazy\" or \"hurried\". Under the hypothesis of global bounds on the reciprocal characteristics we prove sharp estimates for the marginal distributions and a comparison theorem for the jump times. When the height of the bridge tends to infinity we show the convergenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01180","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":"1512.01180","created_at":"2026-05-18T01:25:18.744215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01180v1","created_at":"2026-05-18T01:25:18.744215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01180","created_at":"2026-05-18T01:25:18.744215+00:00"},{"alias_kind":"pith_short_12","alias_value":"ND7EHGWVBP3K","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"ND7EHGWVBP3KAHLV","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"ND7EHGWV","created_at":"2026-05-18T12:29:32.376354+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/ND7EHGWVBP3KAHLVXTIMQTQIWS","json":"https://pith.science/pith/ND7EHGWVBP3KAHLVXTIMQTQIWS.json","graph_json":"https://pith.science/api/pith-number/ND7EHGWVBP3KAHLVXTIMQTQIWS/graph.json","events_json":"https://pith.science/api/pith-number/ND7EHGWVBP3KAHLVXTIMQTQIWS/events.json","paper":"https://pith.science/paper/ND7EHGWV"},"agent_actions":{"view_html":"https://pith.science/pith/ND7EHGWVBP3KAHLVXTIMQTQIWS","download_json":"https://pith.science/pith/ND7EHGWVBP3KAHLVXTIMQTQIWS.json","view_paper":"https://pith.science/paper/ND7EHGWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01180&json=true","fetch_graph":"https://pith.science/api/pith-number/ND7EHGWVBP3KAHLVXTIMQTQIWS/graph.json","fetch_events":"https://pith.science/api/pith-number/ND7EHGWVBP3KAHLVXTIMQTQIWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ND7EHGWVBP3KAHLVXTIMQTQIWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ND7EHGWVBP3KAHLVXTIMQTQIWS/action/storage_attestation","attest_author":"https://pith.science/pith/ND7EHGWVBP3KAHLVXTIMQTQIWS/action/author_attestation","sign_citation":"https://pith.science/pith/ND7EHGWVBP3KAHLVXTIMQTQIWS/action/citation_signature","submit_replication":"https://pith.science/pith/ND7EHGWVBP3KAHLVXTIMQTQIWS/action/replication_record"}},"created_at":"2026-05-18T01:25:18.744215+00:00","updated_at":"2026-05-18T01:25:18.744215+00:00"}