{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HE3C7JKPERXDKPTFUCXV6GV5A4","short_pith_number":"pith:HE3C7JKP","schema_version":"1.0","canonical_sha256":"39362fa54f246e353e65a0af5f1abd072a179fda893a860357d6d4f1660abd0b","source":{"kind":"arxiv","id":"2308.16388","version":2},"attestation_state":"computed","paper":{"title":"Is 'being above the median' a noise sensitive property?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daniel Ahlberg, Daniel de la Riva","submitted_at":"2023-08-31T01:42:29Z","abstract_excerpt":"Assign independent weights to the edges of the square lattice, from the uniform distribution on $\\{a,b\\}$ for some $0<a<b<\\infty$. The weighted graph induces a random metric on $\\mathbb{Z}^2$. Let $T_n$ denote the distance between $(0,0)$ and $(n,0)$ in this metric. The distribution of $T_n$ has a well-defined median. Itai Benjamini asked in 2011 if the sequence of Boolean functions encoding whether $T_n$ exceeds its median is noise sensitive? In this paper we present the first progress on Benjamini's problem. More precisely, we study the minimal weight along any path crossing an $n\\times n$-s"},"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":"2308.16388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-08-31T01:42:29Z","cross_cats_sorted":[],"title_canon_sha256":"7732b83d66fa1c7f91acae9b986022c25ac4d7541bb4727c0aeda7a5c1bbaa8a","abstract_canon_sha256":"571295b67dcfc6a60d727ecf15e7513b519c69007c2e7d4eeda00d031dcd8478"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:58.735876Z","signature_b64":"clTWzBfhJomilYalwNtIfUeKEtameb0RKPyPSyJr7iGLmLQKfjIY7tTI4/vvta6a568pDNbWIdGtSen3/KX1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39362fa54f246e353e65a0af5f1abd072a179fda893a860357d6d4f1660abd0b","last_reissued_at":"2026-07-05T11:25:58.735404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:58.735404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Is 'being above the median' a noise sensitive property?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daniel Ahlberg, Daniel de la Riva","submitted_at":"2023-08-31T01:42:29Z","abstract_excerpt":"Assign independent weights to the edges of the square lattice, from the uniform distribution on $\\{a,b\\}$ for some $0<a<b<\\infty$. The weighted graph induces a random metric on $\\mathbb{Z}^2$. Let $T_n$ denote the distance between $(0,0)$ and $(n,0)$ in this metric. The distribution of $T_n$ has a well-defined median. Itai Benjamini asked in 2011 if the sequence of Boolean functions encoding whether $T_n$ exceeds its median is noise sensitive? In this paper we present the first progress on Benjamini's problem. More precisely, we study the minimal weight along any path crossing an $n\\times n$-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16388","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.16388/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.16388","created_at":"2026-07-05T11:25:58.735470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.16388v2","created_at":"2026-07-05T11:25:58.735470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16388","created_at":"2026-07-05T11:25:58.735470+00:00"},{"alias_kind":"pith_short_12","alias_value":"HE3C7JKPERXD","created_at":"2026-07-05T11:25:58.735470+00:00"},{"alias_kind":"pith_short_16","alias_value":"HE3C7JKPERXDKPTF","created_at":"2026-07-05T11:25:58.735470+00:00"},{"alias_kind":"pith_short_8","alias_value":"HE3C7JKP","created_at":"2026-07-05T11:25:58.735470+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.03211","citing_title":"Noise sensitivity and variance lower bound for minimal left-right crossing of a square in first-passage percolation","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HE3C7JKPERXDKPTFUCXV6GV5A4","json":"https://pith.science/pith/HE3C7JKPERXDKPTFUCXV6GV5A4.json","graph_json":"https://pith.science/api/pith-number/HE3C7JKPERXDKPTFUCXV6GV5A4/graph.json","events_json":"https://pith.science/api/pith-number/HE3C7JKPERXDKPTFUCXV6GV5A4/events.json","paper":"https://pith.science/paper/HE3C7JKP"},"agent_actions":{"view_html":"https://pith.science/pith/HE3C7JKPERXDKPTFUCXV6GV5A4","download_json":"https://pith.science/pith/HE3C7JKPERXDKPTFUCXV6GV5A4.json","view_paper":"https://pith.science/paper/HE3C7JKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.16388&json=true","fetch_graph":"https://pith.science/api/pith-number/HE3C7JKPERXDKPTFUCXV6GV5A4/graph.json","fetch_events":"https://pith.science/api/pith-number/HE3C7JKPERXDKPTFUCXV6GV5A4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HE3C7JKPERXDKPTFUCXV6GV5A4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HE3C7JKPERXDKPTFUCXV6GV5A4/action/storage_attestation","attest_author":"https://pith.science/pith/HE3C7JKPERXDKPTFUCXV6GV5A4/action/author_attestation","sign_citation":"https://pith.science/pith/HE3C7JKPERXDKPTFUCXV6GV5A4/action/citation_signature","submit_replication":"https://pith.science/pith/HE3C7JKPERXDKPTFUCXV6GV5A4/action/replication_record"}},"created_at":"2026-07-05T11:25:58.735470+00:00","updated_at":"2026-07-05T11:25:58.735470+00:00"}