{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N4YBKJQNORYJUR4PC3XSMFIFAY","short_pith_number":"pith:N4YBKJQN","schema_version":"1.0","canonical_sha256":"6f3015260d74709a478f16ef261505060afc89a645720c042203e7fb2d3e6aed","source":{"kind":"arxiv","id":"1702.04688","version":1},"attestation_state":"computed","paper":{"title":"A density version for H\\\"aggstr\\\"om's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Itai Benjamini, Ori Gurel-Gurevich","submitted_at":"2017-02-15T17:14:49Z","abstract_excerpt":"Given invariant percolation on a regular tree, where the probability of an edge to be open equals $p$, is it always possible to find an infinite self-avoiding path along which the density of open edges is bigger then $p$?"},"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":"1702.04688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-15T17:14:49Z","cross_cats_sorted":[],"title_canon_sha256":"795587bae2b6f95c46ae3ea23b8a5393901b3129e3d5528cba31595aa8463498","abstract_canon_sha256":"30badcf274ac9ec362bb7abd84d772e17a2d39684ef849986d9688eb28a08818"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:40.927509Z","signature_b64":"3EpNkjrWQs6ewcjdV0n/ZqDXggE/r2esf3pZYRZVuSZYujqX6S3ms9UGT6Vvs3XpLMcbrcCYifwbKIAw2C+oCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f3015260d74709a478f16ef261505060afc89a645720c042203e7fb2d3e6aed","last_reissued_at":"2026-05-18T00:50:40.926765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:40.926765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A density version for H\\\"aggstr\\\"om's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Itai Benjamini, Ori Gurel-Gurevich","submitted_at":"2017-02-15T17:14:49Z","abstract_excerpt":"Given invariant percolation on a regular tree, where the probability of an edge to be open equals $p$, is it always possible to find an infinite self-avoiding path along which the density of open edges is bigger then $p$?"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04688","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":"1702.04688","created_at":"2026-05-18T00:50:40.926884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04688v1","created_at":"2026-05-18T00:50:40.926884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04688","created_at":"2026-05-18T00:50:40.926884+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4YBKJQNORYJ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4YBKJQNORYJUR4P","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4YBKJQN","created_at":"2026-05-18T12:31:31.346846+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/N4YBKJQNORYJUR4PC3XSMFIFAY","json":"https://pith.science/pith/N4YBKJQNORYJUR4PC3XSMFIFAY.json","graph_json":"https://pith.science/api/pith-number/N4YBKJQNORYJUR4PC3XSMFIFAY/graph.json","events_json":"https://pith.science/api/pith-number/N4YBKJQNORYJUR4PC3XSMFIFAY/events.json","paper":"https://pith.science/paper/N4YBKJQN"},"agent_actions":{"view_html":"https://pith.science/pith/N4YBKJQNORYJUR4PC3XSMFIFAY","download_json":"https://pith.science/pith/N4YBKJQNORYJUR4PC3XSMFIFAY.json","view_paper":"https://pith.science/paper/N4YBKJQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04688&json=true","fetch_graph":"https://pith.science/api/pith-number/N4YBKJQNORYJUR4PC3XSMFIFAY/graph.json","fetch_events":"https://pith.science/api/pith-number/N4YBKJQNORYJUR4PC3XSMFIFAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4YBKJQNORYJUR4PC3XSMFIFAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4YBKJQNORYJUR4PC3XSMFIFAY/action/storage_attestation","attest_author":"https://pith.science/pith/N4YBKJQNORYJUR4PC3XSMFIFAY/action/author_attestation","sign_citation":"https://pith.science/pith/N4YBKJQNORYJUR4PC3XSMFIFAY/action/citation_signature","submit_replication":"https://pith.science/pith/N4YBKJQNORYJUR4PC3XSMFIFAY/action/replication_record"}},"created_at":"2026-05-18T00:50:40.926884+00:00","updated_at":"2026-05-18T00:50:40.926884+00:00"}