{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3ALVC2JUHYNAKKOF2JM4HT4VCP","short_pith_number":"pith:3ALVC2JU","schema_version":"1.0","canonical_sha256":"d8175169343e1a0529c5d259c3cf9513e68af4e1156a6414a6ba502dbe19c896","source":{"kind":"arxiv","id":"1810.07162","version":1},"attestation_state":"computed","paper":{"title":"Critical probability on the product graph of a regular tree and a line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Kohei Yamamoto","submitted_at":"2018-10-16T17:42:49Z","abstract_excerpt":"We consider Bernoulli bond percolation on the product graph of a regular tree and a line.\n  Schonmann showed that there are a.s. infinitely many infinite clusters at $p=p_u$ by using a certain function $\\alpha(p)$.\n  The function $\\alpha(p)$ is defined by a exponential decay rate of probability that two vertices of the same layer are connected.\n  We show the critical probability $p_c$ can be written by using $\\alpha(p)$.\n  In other words, we construct another definition of the critical probability."},"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":"1810.07162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-10-16T17:42:49Z","cross_cats_sorted":[],"title_canon_sha256":"f8fa5f8bf379700ac88adc9686e2ed9d7065766ff53ea0fe4051c5025a62c89b","abstract_canon_sha256":"308bc4d5ef6394a9bc9367f92e6a2e4032633ad7b2d3915a8ff6237cde235051"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:10.240715Z","signature_b64":"HuurbqqAnWGcz6dDl/csqp3PResAD1M284Sgztd5y0/qPzDtvN8jJLpAxtFvR8ckAb4v7pUoBg3FVU5cQQ5ODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8175169343e1a0529c5d259c3cf9513e68af4e1156a6414a6ba502dbe19c896","last_reissued_at":"2026-05-18T00:03:10.239933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:10.239933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Critical probability on the product graph of a regular tree and a line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Kohei Yamamoto","submitted_at":"2018-10-16T17:42:49Z","abstract_excerpt":"We consider Bernoulli bond percolation on the product graph of a regular tree and a line.\n  Schonmann showed that there are a.s. infinitely many infinite clusters at $p=p_u$ by using a certain function $\\alpha(p)$.\n  The function $\\alpha(p)$ is defined by a exponential decay rate of probability that two vertices of the same layer are connected.\n  We show the critical probability $p_c$ can be written by using $\\alpha(p)$.\n  In other words, we construct another definition of the critical probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07162","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":"1810.07162","created_at":"2026-05-18T00:03:10.240057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07162v1","created_at":"2026-05-18T00:03:10.240057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07162","created_at":"2026-05-18T00:03:10.240057+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ALVC2JUHYNA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ALVC2JUHYNAKKOF","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ALVC2JU","created_at":"2026-05-18T12:32:02.567920+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/3ALVC2JUHYNAKKOF2JM4HT4VCP","json":"https://pith.science/pith/3ALVC2JUHYNAKKOF2JM4HT4VCP.json","graph_json":"https://pith.science/api/pith-number/3ALVC2JUHYNAKKOF2JM4HT4VCP/graph.json","events_json":"https://pith.science/api/pith-number/3ALVC2JUHYNAKKOF2JM4HT4VCP/events.json","paper":"https://pith.science/paper/3ALVC2JU"},"agent_actions":{"view_html":"https://pith.science/pith/3ALVC2JUHYNAKKOF2JM4HT4VCP","download_json":"https://pith.science/pith/3ALVC2JUHYNAKKOF2JM4HT4VCP.json","view_paper":"https://pith.science/paper/3ALVC2JU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07162&json=true","fetch_graph":"https://pith.science/api/pith-number/3ALVC2JUHYNAKKOF2JM4HT4VCP/graph.json","fetch_events":"https://pith.science/api/pith-number/3ALVC2JUHYNAKKOF2JM4HT4VCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ALVC2JUHYNAKKOF2JM4HT4VCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ALVC2JUHYNAKKOF2JM4HT4VCP/action/storage_attestation","attest_author":"https://pith.science/pith/3ALVC2JUHYNAKKOF2JM4HT4VCP/action/author_attestation","sign_citation":"https://pith.science/pith/3ALVC2JUHYNAKKOF2JM4HT4VCP/action/citation_signature","submit_replication":"https://pith.science/pith/3ALVC2JUHYNAKKOF2JM4HT4VCP/action/replication_record"}},"created_at":"2026-05-18T00:03:10.240057+00:00","updated_at":"2026-05-18T00:03:10.240057+00:00"}