{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JXUNCLKTRCHWQLAP4WBPH2EFOF","short_pith_number":"pith:JXUNCLKT","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"},"canonical_sha256":"4de8d12d53888f682c0fe582f3e8857173d4fc74974d6162d006cbe55108c85a","source":{"kind":"arxiv","id":"1701.07667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07667","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07667v1","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07667","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"pith_short_12","alias_value":"JXUNCLKTRCHW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JXUNCLKTRCHWQLAP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JXUNCLKT","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JXUNCLKTRCHWQLAP4WBPH2EFOF","target":"record","payload":{"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"},"canonical_sha256":"4de8d12d53888f682c0fe582f3e8857173d4fc74974d6162d006cbe55108c85a","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"},"source_kind":"arxiv","source_id":"1701.07667","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qqU4ORRm4+rCEMT9Remwq67UrhzRQUFMh8Lf+YfAFnU6F2tdUOrOkQM8qUPLHEfB2Reh3xfE2r7MEbQfIRBuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:49:36.707128Z"},"content_sha256":"73f3de8c3d47eb07a5706e7a502f4fb974297bcc7ebd23ba0ebab125cc45fc93","schema_version":"1.0","event_id":"sha256:73f3de8c3d47eb07a5706e7a502f4fb974297bcc7ebd23ba0ebab125cc45fc93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JXUNCLKTRCHWQLAP4WBPH2EFOF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1X2visOeeapdON3sV4thgCUCRGqJS2Z8xUe+KMWsGuPpshSBRODFYO4EcJgK5YxI9CM26qYxWhc6m2ES+aZwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:49:36.707496Z"},"content_sha256":"5ff87af6fe817ab8416850c3b6f2226918816d0daf46b7508bf16f1be917372b","schema_version":"1.0","event_id":"sha256:5ff87af6fe817ab8416850c3b6f2226918816d0daf46b7508bf16f1be917372b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/bundle.json","state_url":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T00:49:36Z","links":{"resolver":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF","bundle":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/bundle.json","state":"https://pith.science/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXUNCLKTRCHWQLAP4WBPH2EFOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JXUNCLKTRCHWQLAP4WBPH2EFOF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e28eee22c5176c89ffed859e78e6b166239ae74f47b9d8c7d563c58168d83793","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-26T12:06:14Z","title_canon_sha256":"ba7ba37edee46956ffbe541515adc37d4532b8f94928c4b35944b1dc6e9d8b75"},"schema_version":"1.0","source":{"id":"1701.07667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07667","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07667v1","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07667","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"pith_short_12","alias_value":"JXUNCLKTRCHW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JXUNCLKTRCHWQLAP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JXUNCLKT","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:5ff87af6fe817ab8416850c3b6f2226918816d0daf46b7508bf16f1be917372b","target":"graph","created_at":"2026-05-17T23:52:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Renan Gross, Uri Grupel","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-26T12:06:14Z","title":"Indistinguishable sceneries on the Boolean hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07667","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:73f3de8c3d47eb07a5706e7a502f4fb974297bcc7ebd23ba0ebab125cc45fc93","target":"record","created_at":"2026-05-17T23:52:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e28eee22c5176c89ffed859e78e6b166239ae74f47b9d8c7d563c58168d83793","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-26T12:06:14Z","title_canon_sha256":"ba7ba37edee46956ffbe541515adc37d4532b8f94928c4b35944b1dc6e9d8b75"},"schema_version":"1.0","source":{"id":"1701.07667","kind":"arxiv","version":1}},"canonical_sha256":"4de8d12d53888f682c0fe582f3e8857173d4fc74974d6162d006cbe55108c85a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4de8d12d53888f682c0fe582f3e8857173d4fc74974d6162d006cbe55108c85a","first_computed_at":"2026-05-17T23:52:08.603086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:08.603086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n3fMhJ5dxN22PmjBCd1RY0UXzQVdor2jL7Et3wGFMbKcQwZNVHJl1J8vo9umvKIZ4j/ymYUCO0p1IskRKCqoBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:08.603566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73f3de8c3d47eb07a5706e7a502f4fb974297bcc7ebd23ba0ebab125cc45fc93","sha256:5ff87af6fe817ab8416850c3b6f2226918816d0daf46b7508bf16f1be917372b"],"state_sha256":"3233ca0f2b18b38cd0bf031d97875c861d54db477ea280982eced6f1b2462dc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHJhGtc3hVH9WNLVtsblyCINp99C3G/5fiXG4+cX/UTC11bIuVX3Dfwl7lCPHI6upsEoC3//ss4X3uGP4OtsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:49:36.709428Z","bundle_sha256":"ae281ba9ba9a51c9c25e031cc78800cae3d56663eb89c4f4ee3400dc77f66eb1"}}