{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CFQWKGG5A2ETCP2UWGJ76EE372","short_pith_number":"pith:CFQWKGG5","schema_version":"1.0","canonical_sha256":"11616518dd0689313f54b193ff109bfeab2f5fb377390f04d1cbae52e98274d4","source":{"kind":"arxiv","id":"1509.02042","version":1},"attestation_state":"computed","paper":{"title":"Truncated long-range percolation on oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Aernout C. D. van Enter, Bernardo N. B. de Lima, Daniel Valesin","submitted_at":"2015-09-07T13:52:22Z","abstract_excerpt":"We consider different problems within the general theme of long-range percolation on oriented graphs. Our aim is to settle the so-called truncation question, described as follows. We are given probabilities that certain long-range oriented bonds are open; assuming that the sum of these probabilities is infinite, we ask if the probability of percolation is positive when we truncate the graph, disallowing bonds of range above a possibly large but finite threshold. We give some conditions in which the answer is affirmative. We also translate some of our results on oriented percolation to the cont"},"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":"1509.02042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-07T13:52:22Z","cross_cats_sorted":[],"title_canon_sha256":"376ece4434f99cb49735a1880ad2aecae79cec31668d672fca027e34c01331d9","abstract_canon_sha256":"27bb43f84f14439dacb75cab26044942b26d840a173c95ac22c14bf821fc43de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:08.065598Z","signature_b64":"Ga51rnpwfUnMytjvI0+znzUxph3FCLokxJ7sQSaHUC+yWD/I+KpEUkmuGxL2UzpiSpozv/MuJyYHrtluKOcDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11616518dd0689313f54b193ff109bfeab2f5fb377390f04d1cbae52e98274d4","last_reissued_at":"2026-05-18T01:12:08.065131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:08.065131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Truncated long-range percolation on oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Aernout C. D. van Enter, Bernardo N. B. de Lima, Daniel Valesin","submitted_at":"2015-09-07T13:52:22Z","abstract_excerpt":"We consider different problems within the general theme of long-range percolation on oriented graphs. Our aim is to settle the so-called truncation question, described as follows. We are given probabilities that certain long-range oriented bonds are open; assuming that the sum of these probabilities is infinite, we ask if the probability of percolation is positive when we truncate the graph, disallowing bonds of range above a possibly large but finite threshold. We give some conditions in which the answer is affirmative. We also translate some of our results on oriented percolation to the cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02042","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":"1509.02042","created_at":"2026-05-18T01:12:08.065221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02042v1","created_at":"2026-05-18T01:12:08.065221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02042","created_at":"2026-05-18T01:12:08.065221+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFQWKGG5A2ET","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFQWKGG5A2ETCP2U","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFQWKGG5","created_at":"2026-05-18T12:29:14.074870+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/CFQWKGG5A2ETCP2UWGJ76EE372","json":"https://pith.science/pith/CFQWKGG5A2ETCP2UWGJ76EE372.json","graph_json":"https://pith.science/api/pith-number/CFQWKGG5A2ETCP2UWGJ76EE372/graph.json","events_json":"https://pith.science/api/pith-number/CFQWKGG5A2ETCP2UWGJ76EE372/events.json","paper":"https://pith.science/paper/CFQWKGG5"},"agent_actions":{"view_html":"https://pith.science/pith/CFQWKGG5A2ETCP2UWGJ76EE372","download_json":"https://pith.science/pith/CFQWKGG5A2ETCP2UWGJ76EE372.json","view_paper":"https://pith.science/paper/CFQWKGG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02042&json=true","fetch_graph":"https://pith.science/api/pith-number/CFQWKGG5A2ETCP2UWGJ76EE372/graph.json","fetch_events":"https://pith.science/api/pith-number/CFQWKGG5A2ETCP2UWGJ76EE372/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFQWKGG5A2ETCP2UWGJ76EE372/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFQWKGG5A2ETCP2UWGJ76EE372/action/storage_attestation","attest_author":"https://pith.science/pith/CFQWKGG5A2ETCP2UWGJ76EE372/action/author_attestation","sign_citation":"https://pith.science/pith/CFQWKGG5A2ETCP2UWGJ76EE372/action/citation_signature","submit_replication":"https://pith.science/pith/CFQWKGG5A2ETCP2UWGJ76EE372/action/replication_record"}},"created_at":"2026-05-18T01:12:08.065221+00:00","updated_at":"2026-05-18T01:12:08.065221+00:00"}