{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JXUNCLKTRCHWQLAP4WBPH2EFOF","short_pith_number":"pith:JXUNCLKT","schema_version":"1.0","canonical_sha256":"4de8d12d53888f682c0fe582f3e8857173d4fc74974d6162d006cbe55108c85a","source":{"kind":"arxiv","id":"1701.07667","version":1},"attestation_state":"computed","paper":{"title":"Indistinguishable sceneries on the Boolean hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Renan Gross, Uri Grupel","submitted_at":"2017-01-26T12:06:14Z","abstract_excerpt":"We show that the scenery reconstruction problem on the Boolean hypercube is in general impossible. This is done by using locally biased functions, in which every vertex has a constant fraction of neighbors colored by $1$, and locally stable functions, in which every vertex has a constant fraction of neighbors colored by its own color. Our methods are constructive, and also give super-polynomial lower bounds on the number of locally biased and locally stable functions. We further show similar results for $\\mathbb{Z}^n$ and other graphs, and offer several follow-up questions."},"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":"1701.07667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-26T12:06:14Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ba7ba37edee46956ffbe541515adc37d4532b8f94928c4b35944b1dc6e9d8b75","abstract_canon_sha256":"e28eee22c5176c89ffed859e78e6b166239ae74f47b9d8c7d563c58168d83793"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:08.603566Z","signature_b64":"n3fMhJ5dxN22PmjBCd1RY0UXzQVdor2jL7Et3wGFMbKcQwZNVHJl1J8vo9umvKIZ4j/ymYUCO0p1IskRKCqoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4de8d12d53888f682c0fe582f3e8857173d4fc74974d6162d006cbe55108c85a","last_reissued_at":"2026-05-17T23:52:08.603086Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:08.603086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indistinguishable sceneries on the Boolean hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Renan Gross, Uri Grupel","submitted_at":"2017-01-26T12:06:14Z","abstract_excerpt":"We show that the scenery reconstruction problem on the Boolean hypercube is in general impossible. This is done by using locally biased functions, in which every vertex has a constant fraction of neighbors colored by $1$, and locally stable functions, in which every vertex has a constant fraction of neighbors colored by its own color. Our methods are constructive, and also give super-polynomial lower bounds on the number of locally biased and locally stable functions. We further show similar results for $\\mathbb{Z}^n$ and other graphs, and offer several follow-up questions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07667","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":"1701.07667","created_at":"2026-05-17T23:52:08.603146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07667v1","created_at":"2026-05-17T23:52:08.603146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07667","created_at":"2026-05-17T23:52:08.603146+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXUNCLKTRCHW","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXUNCLKTRCHWQLAP","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXUNCLKT","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07250","citing_title":"Shotgun reconstruction in the hypercube","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF","json":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF.json","graph_json":"https://pith.science/api/pith-number/JXUNCLKTRCHWQLAP4WBPH2EFOF/graph.json","events_json":"https://pith.science/api/pith-number/JXUNCLKTRCHWQLAP4WBPH2EFOF/events.json","paper":"https://pith.science/paper/JXUNCLKT"},"agent_actions":{"view_html":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF","download_json":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF.json","view_paper":"https://pith.science/paper/JXUNCLKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07667&json=true","fetch_graph":"https://pith.science/api/pith-number/JXUNCLKTRCHWQLAP4WBPH2EFOF/graph.json","fetch_events":"https://pith.science/api/pith-number/JXUNCLKTRCHWQLAP4WBPH2EFOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/action/storage_attestation","attest_author":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/action/author_attestation","sign_citation":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/action/citation_signature","submit_replication":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/action/replication_record"}},"created_at":"2026-05-17T23:52:08.603146+00:00","updated_at":"2026-05-17T23:52:08.603146+00:00"}