{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JL3FR4VY3PGB3VGGKBAPNYYHIK","short_pith_number":"pith:JL3FR4VY","schema_version":"1.0","canonical_sha256":"4af658f2b8dbcc1dd4c65040f6e30742af60ce63e902185aa4c5fcd90b6522ec","source":{"kind":"arxiv","id":"1005.4806","version":1},"attestation_state":"computed","paper":{"title":"Limit theorems for a random directed slab graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Denis Denisov, Sergey Foss, Takis Konstantopoulos","submitted_at":"2010-05-26T13:14:55Z","abstract_excerpt":"We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we identify a regenerative structure that enables us to prove limit theorems for the maximal path length in a long chunk of the graph. The model is an extension of a special case of graphs studied by Foss and Konstantopoulos, Markov Process and Related Fields, 9, 413-468. We then consider a similar type of graph but on the `slab' $\\Z \\times I$, where $I$ is a fini"},"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":"1005.4806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-05-26T13:14:55Z","cross_cats_sorted":[],"title_canon_sha256":"a8c2826e51bd3e132d9b98665ba2abd21265a1e747e8d6ac2b4354ac4cab6b80","abstract_canon_sha256":"f476a67430e5c5c2a30ca913e57703ebdfb6699027ac9bef83c5335898bb35b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:34.176539Z","signature_b64":"6L3bjY7jDG9IZOhS2P5Nan2N3e8xwRbzwZigB9pMaoO3YZF28KgL4lSXYtTMrrsZwkhynkg5GtApVVDzOwKEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4af658f2b8dbcc1dd4c65040f6e30742af60ce63e902185aa4c5fcd90b6522ec","last_reissued_at":"2026-05-18T00:29:34.175882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:34.175882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limit theorems for a random directed slab graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Denis Denisov, Sergey Foss, Takis Konstantopoulos","submitted_at":"2010-05-26T13:14:55Z","abstract_excerpt":"We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we identify a regenerative structure that enables us to prove limit theorems for the maximal path length in a long chunk of the graph. The model is an extension of a special case of graphs studied by Foss and Konstantopoulos, Markov Process and Related Fields, 9, 413-468. We then consider a similar type of graph but on the `slab' $\\Z \\times I$, where $I$ is a fini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4806","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":"1005.4806","created_at":"2026-05-18T00:29:34.175984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.4806v1","created_at":"2026-05-18T00:29:34.175984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4806","created_at":"2026-05-18T00:29:34.175984+00:00"},{"alias_kind":"pith_short_12","alias_value":"JL3FR4VY3PGB","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JL3FR4VY3PGB3VGG","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JL3FR4VY","created_at":"2026-05-18T12:26:09.077623+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/JL3FR4VY3PGB3VGGKBAPNYYHIK","json":"https://pith.science/pith/JL3FR4VY3PGB3VGGKBAPNYYHIK.json","graph_json":"https://pith.science/api/pith-number/JL3FR4VY3PGB3VGGKBAPNYYHIK/graph.json","events_json":"https://pith.science/api/pith-number/JL3FR4VY3PGB3VGGKBAPNYYHIK/events.json","paper":"https://pith.science/paper/JL3FR4VY"},"agent_actions":{"view_html":"https://pith.science/pith/JL3FR4VY3PGB3VGGKBAPNYYHIK","download_json":"https://pith.science/pith/JL3FR4VY3PGB3VGGKBAPNYYHIK.json","view_paper":"https://pith.science/paper/JL3FR4VY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.4806&json=true","fetch_graph":"https://pith.science/api/pith-number/JL3FR4VY3PGB3VGGKBAPNYYHIK/graph.json","fetch_events":"https://pith.science/api/pith-number/JL3FR4VY3PGB3VGGKBAPNYYHIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JL3FR4VY3PGB3VGGKBAPNYYHIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JL3FR4VY3PGB3VGGKBAPNYYHIK/action/storage_attestation","attest_author":"https://pith.science/pith/JL3FR4VY3PGB3VGGKBAPNYYHIK/action/author_attestation","sign_citation":"https://pith.science/pith/JL3FR4VY3PGB3VGGKBAPNYYHIK/action/citation_signature","submit_replication":"https://pith.science/pith/JL3FR4VY3PGB3VGGKBAPNYYHIK/action/replication_record"}},"created_at":"2026-05-18T00:29:34.175984+00:00","updated_at":"2026-05-18T00:29:34.175984+00:00"}