{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N3BQRZ2DRAYF2YFPAETTK5DONR","short_pith_number":"pith:N3BQRZ2D","canonical_record":{"source":{"id":"1710.10210","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-27T15:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"e5c78efc7c60a9d9a4005234ffd1103af8d4838666067fb0d3c841122cb21799","abstract_canon_sha256":"69e2a31920e935dfc1fe6d3ff7e2993552fa5cc781287202644d8125c5a1c1b7"},"schema_version":"1.0"},"canonical_sha256":"6ec308e74388305d60af012735746e6c767a1ed5a6888490a6129670acce7e61","source":{"kind":"arxiv","id":"1710.10210","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10210","created_at":"2026-05-18T00:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10210v4","created_at":"2026-05-18T00:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10210","created_at":"2026-05-18T00:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"N3BQRZ2DRAYF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N3BQRZ2DRAYF2YFP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N3BQRZ2D","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N3BQRZ2DRAYF2YFPAETTK5DONR","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10210","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-27T15:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"e5c78efc7c60a9d9a4005234ffd1103af8d4838666067fb0d3c841122cb21799","abstract_canon_sha256":"69e2a31920e935dfc1fe6d3ff7e2993552fa5cc781287202644d8125c5a1c1b7"},"schema_version":"1.0"},"canonical_sha256":"6ec308e74388305d60af012735746e6c767a1ed5a6888490a6129670acce7e61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:35.250377Z","signature_b64":"U/mpgWkqQlR7KzI+1fPufU1ns9M8P6Q+PNiXwcGEJPCCmzx+EZrYAqU9xyh5cmJlnDiNZLTnLaKeI4Kw89R3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec308e74388305d60af012735746e6c767a1ed5a6888490a6129670acce7e61","last_reissued_at":"2026-05-18T00:19:35.249705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:35.249705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10210","source_version":4,"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-18T00:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o16phw165PYKKZWMTJnxPx4umnu/9gwj1u2CqFcVr5Oz/WTAG9hmhc47MeNDPxYUEp7zUji3FrXgr4RgvvSEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:57:05.590019Z"},"content_sha256":"8fc7843341abfc32d49686b068e5f9df3831b4e51f602c255f6f9b1ac6ca6c82","schema_version":"1.0","event_id":"sha256:8fc7843341abfc32d49686b068e5f9df3831b4e51f602c255f6f9b1ac6ca6c82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N3BQRZ2DRAYF2YFPAETTK5DONR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On denoising modulo 1 samples of a function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Hemant Tyagi, Mihai Cucuringu","submitted_at":"2017-10-27T15:55:50Z","abstract_excerpt":"Consider an unknown smooth function $f: [0,1] \\rightarrow \\mathbb{R}$, and say we are given $n$ noisy$\\mod 1$ samples of $f$, i.e., $y_i = (f(x_i) + \\eta_i)\\mod 1$ for $x_i \\in [0,1]$, where $\\eta_i$ denotes noise. Given the samples $(x_i,y_i)_{i=1}^{n}$ our goal is to recover smooth, robust estimates of the clean samples $f(x_i) \\bmod 1$. We formulate a natural approach for solving this problem which works with representations of mod 1 values over the unit circle. This amounts to solving a quadratically constrained quadratic program (QCQP) with non-convex constraints involving points lying on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10210","kind":"arxiv","version":4},"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-18T00:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQLModMbSMrRFL1ypDivprmsmZqxnMbqsGufdLLKkQrKtv3AgFYofiv6niJYaj0w+IEwHNXEE1URkpvHT4bQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:57:05.590687Z"},"content_sha256":"f59a897b4986c468bfbad09a4775828d4238f43110649b02cccd3fe9399c7ecb","schema_version":"1.0","event_id":"sha256:f59a897b4986c468bfbad09a4775828d4238f43110649b02cccd3fe9399c7ecb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3BQRZ2DRAYF2YFPAETTK5DONR/bundle.json","state_url":"https://pith.science/pith/N3BQRZ2DRAYF2YFPAETTK5DONR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3BQRZ2DRAYF2YFPAETTK5DONR/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-28T21:57:05Z","links":{"resolver":"https://pith.science/pith/N3BQRZ2DRAYF2YFPAETTK5DONR","bundle":"https://pith.science/pith/N3BQRZ2DRAYF2YFPAETTK5DONR/bundle.json","state":"https://pith.science/pith/N3BQRZ2DRAYF2YFPAETTK5DONR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3BQRZ2DRAYF2YFPAETTK5DONR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N3BQRZ2DRAYF2YFPAETTK5DONR","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":"69e2a31920e935dfc1fe6d3ff7e2993552fa5cc781287202644d8125c5a1c1b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-27T15:55:50Z","title_canon_sha256":"e5c78efc7c60a9d9a4005234ffd1103af8d4838666067fb0d3c841122cb21799"},"schema_version":"1.0","source":{"id":"1710.10210","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10210","created_at":"2026-05-18T00:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10210v4","created_at":"2026-05-18T00:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10210","created_at":"2026-05-18T00:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"N3BQRZ2DRAYF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N3BQRZ2DRAYF2YFP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N3BQRZ2D","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:f59a897b4986c468bfbad09a4775828d4238f43110649b02cccd3fe9399c7ecb","target":"graph","created_at":"2026-05-18T00:19:35Z","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":"Consider an unknown smooth function $f: [0,1] \\rightarrow \\mathbb{R}$, and say we are given $n$ noisy$\\mod 1$ samples of $f$, i.e., $y_i = (f(x_i) + \\eta_i)\\mod 1$ for $x_i \\in [0,1]$, where $\\eta_i$ denotes noise. Given the samples $(x_i,y_i)_{i=1}^{n}$ our goal is to recover smooth, robust estimates of the clean samples $f(x_i) \\bmod 1$. We formulate a natural approach for solving this problem which works with representations of mod 1 values over the unit circle. This amounts to solving a quadratically constrained quadratic program (QCQP) with non-convex constraints involving points lying on","authors_text":"Hemant Tyagi, Mihai Cucuringu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-27T15:55:50Z","title":"On denoising modulo 1 samples of a function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10210","kind":"arxiv","version":4},"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:8fc7843341abfc32d49686b068e5f9df3831b4e51f602c255f6f9b1ac6ca6c82","target":"record","created_at":"2026-05-18T00:19:35Z","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":"69e2a31920e935dfc1fe6d3ff7e2993552fa5cc781287202644d8125c5a1c1b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-27T15:55:50Z","title_canon_sha256":"e5c78efc7c60a9d9a4005234ffd1103af8d4838666067fb0d3c841122cb21799"},"schema_version":"1.0","source":{"id":"1710.10210","kind":"arxiv","version":4}},"canonical_sha256":"6ec308e74388305d60af012735746e6c767a1ed5a6888490a6129670acce7e61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ec308e74388305d60af012735746e6c767a1ed5a6888490a6129670acce7e61","first_computed_at":"2026-05-18T00:19:35.249705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:35.249705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U/mpgWkqQlR7KzI+1fPufU1ns9M8P6Q+PNiXwcGEJPCCmzx+EZrYAqU9xyh5cmJlnDiNZLTnLaKeI4Kw89R3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:35.250377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10210","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fc7843341abfc32d49686b068e5f9df3831b4e51f602c255f6f9b1ac6ca6c82","sha256:f59a897b4986c468bfbad09a4775828d4238f43110649b02cccd3fe9399c7ecb"],"state_sha256":"57ea4e6020ac8718247313f6173c3bdf36c51588c6172482f57d2ca4c44a8ab0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TeUkzjUuPId59zQCFb6bw/4JLx6V0RDHQNuVDy4aoV6TZeMKi8+XdHZEc64IsTqp4rjCqJcqW7SoWjrnLjGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:57:05.593875Z","bundle_sha256":"c50467e32ba054dc1ab5a867fbbc5a43c1e650276bfb819df9da8c71920a35d2"}}