{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:HP5QFH47PNADYQ4L6EACSNG4EC","short_pith_number":"pith:HP5QFH47","schema_version":"1.0","canonical_sha256":"3bfb029f9f7b403c438bf1002934dc209a8836498f98deffa183b114c8a47702","source":{"kind":"arxiv","id":"math/0201030","version":1},"attestation_state":"computed","paper":{"title":"The lowest crossing in 2D critical percolation","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"A. A. Jarai, J. van den Berg","submitted_at":"2002-01-04T18:56:21Z","abstract_excerpt":"We study the following problem for critical site percolation on the triangular lattice. Let A and B be sites on a horizontal line e separated by distance n. Consider, in the half-plane above e, the lowest occupied crossing R from the half-line left of A to the half-line right of B. We show that the probability that R has a site at distance smaller than m from AB is of order (log (n/m))^{-1}, uniformly in 1 <= m < n/2. Much of our analysis can be carried out for other two-dimensional lattices as well."},"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":"math/0201030","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2002-01-04T18:56:21Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"0be0e283e9aa77c91aca97dacc02e6cf7b0754175165d252706ed54b908d52c3","abstract_canon_sha256":"ecd3854b04c30dcf29f19f5a6796a9b05671f03d037b27282413c6c7468caf2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:52.727271Z","signature_b64":"Pp5e2eKbZA8hSWMRGoBHfJtp5/Mk93IB59KRRivxeWLlhxaY588UO5png+OSCiUzy7O6ISWsPJuuCJEd38u4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bfb029f9f7b403c438bf1002934dc209a8836498f98deffa183b114c8a47702","last_reissued_at":"2026-05-18T04:31:52.726833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:52.726833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The lowest crossing in 2D critical percolation","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"A. A. Jarai, J. van den Berg","submitted_at":"2002-01-04T18:56:21Z","abstract_excerpt":"We study the following problem for critical site percolation on the triangular lattice. Let A and B be sites on a horizontal line e separated by distance n. Consider, in the half-plane above e, the lowest occupied crossing R from the half-line left of A to the half-line right of B. We show that the probability that R has a site at distance smaller than m from AB is of order (log (n/m))^{-1}, uniformly in 1 <= m < n/2. Much of our analysis can be carried out for other two-dimensional lattices as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0201030","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":"math/0201030","created_at":"2026-05-18T04:31:52.726886+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0201030v1","created_at":"2026-05-18T04:31:52.726886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0201030","created_at":"2026-05-18T04:31:52.726886+00:00"},{"alias_kind":"pith_short_12","alias_value":"HP5QFH47PNAD","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"HP5QFH47PNADYQ4L","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"HP5QFH47","created_at":"2026-05-18T12:25:50.845339+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/HP5QFH47PNADYQ4L6EACSNG4EC","json":"https://pith.science/pith/HP5QFH47PNADYQ4L6EACSNG4EC.json","graph_json":"https://pith.science/api/pith-number/HP5QFH47PNADYQ4L6EACSNG4EC/graph.json","events_json":"https://pith.science/api/pith-number/HP5QFH47PNADYQ4L6EACSNG4EC/events.json","paper":"https://pith.science/paper/HP5QFH47"},"agent_actions":{"view_html":"https://pith.science/pith/HP5QFH47PNADYQ4L6EACSNG4EC","download_json":"https://pith.science/pith/HP5QFH47PNADYQ4L6EACSNG4EC.json","view_paper":"https://pith.science/paper/HP5QFH47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0201030&json=true","fetch_graph":"https://pith.science/api/pith-number/HP5QFH47PNADYQ4L6EACSNG4EC/graph.json","fetch_events":"https://pith.science/api/pith-number/HP5QFH47PNADYQ4L6EACSNG4EC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HP5QFH47PNADYQ4L6EACSNG4EC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HP5QFH47PNADYQ4L6EACSNG4EC/action/storage_attestation","attest_author":"https://pith.science/pith/HP5QFH47PNADYQ4L6EACSNG4EC/action/author_attestation","sign_citation":"https://pith.science/pith/HP5QFH47PNADYQ4L6EACSNG4EC/action/citation_signature","submit_replication":"https://pith.science/pith/HP5QFH47PNADYQ4L6EACSNG4EC/action/replication_record"}},"created_at":"2026-05-18T04:31:52.726886+00:00","updated_at":"2026-05-18T04:31:52.726886+00:00"}