{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SFQN6X5RIBKX2EK2S5PV3WRHKQ","short_pith_number":"pith:SFQN6X5R","canonical_record":{"source":{"id":"1602.03115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-09T18:53:55Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"37a4ee2427b7ae1d05aad5307803d8ed42b67bfb8f5c98dc232d89dd117afcf7","abstract_canon_sha256":"b8059cce9fdfaaaf880e97a6215cf510924e5ff7c259c31ed43333d50b34fe46"},"schema_version":"1.0"},"canonical_sha256":"9160df5fb140557d115a975f5dda2754364521c6c5a2ee77b51706394e4db4c8","source":{"kind":"arxiv","id":"1602.03115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03115","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03115v1","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03115","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"SFQN6X5RIBKX","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SFQN6X5RIBKX2EK2","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SFQN6X5R","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SFQN6X5RIBKX2EK2S5PV3WRHKQ","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-09T18:53:55Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"37a4ee2427b7ae1d05aad5307803d8ed42b67bfb8f5c98dc232d89dd117afcf7","abstract_canon_sha256":"b8059cce9fdfaaaf880e97a6215cf510924e5ff7c259c31ed43333d50b34fe46"},"schema_version":"1.0"},"canonical_sha256":"9160df5fb140557d115a975f5dda2754364521c6c5a2ee77b51706394e4db4c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:15.546384Z","signature_b64":"qxACRCv7haBDh1TLVNuc7vst7nxDqNiZ1PEvXly3H+u3Svj+gZk+GCA5TT+TVwsf+lf8KPf5E8VQG6F/SiXnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9160df5fb140557d115a975f5dda2754364521c6c5a2ee77b51706394e4db4c8","last_reissued_at":"2026-05-18T00:47:15.545719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:15.545719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03115","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-18T00:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNb/7OKQoKU3ap1FtbS6AR2UVU/ptKHbIMrjWBEhMqm+OBrEBYaGb48BvlvSef/M24FeoXwsPd7PGb0eG3MmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:11:06.576594Z"},"content_sha256":"63074cd641684110e6979080bbd948655ac6483532b4b8c7ba10ba0e99147ebe","schema_version":"1.0","event_id":"sha256:63074cd641684110e6979080bbd948655ac6483532b4b8c7ba10ba0e99147ebe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SFQN6X5RIBKX2EK2S5PV3WRHKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Robustness in Residue Number Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Haiye Huo, Li Xiao, Xiang-Gen Xia","submitted_at":"2016-02-09T18:53:55Z","abstract_excerpt":"The problem of robustly reconstructing a large number from its erroneous remainders with respect to several moduli, namely the robust remaindering problem, may occur in many applications including phase unwrapping, frequency detection from several undersampled waveforms, wireless sensor networks, etc. Assuming that the dynamic range of the large number is the maximal possible one, i.e., the least common multiple (lcm) of all the moduli, a method called robust Chinese remainder theorem (CRT) for solving the robust remaindering problem has been recently proposed. In this paper, by relaxing the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03115","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-18T00:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rr9ugqReeyYZUnJ7xGmo5y5o6xfTmiPz6eCfdIZslYhnIyNqf2VT+i7Zbv0JSHyuYZagg+/9HGQQh6RU48oeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:11:06.576933Z"},"content_sha256":"be32ff61c0bd46ea0c12273c578f18a1c5bce9f52529ddddfc692795349f94f0","schema_version":"1.0","event_id":"sha256:be32ff61c0bd46ea0c12273c578f18a1c5bce9f52529ddddfc692795349f94f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFQN6X5RIBKX2EK2S5PV3WRHKQ/bundle.json","state_url":"https://pith.science/pith/SFQN6X5RIBKX2EK2S5PV3WRHKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFQN6X5RIBKX2EK2S5PV3WRHKQ/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-06-25T08:11:06Z","links":{"resolver":"https://pith.science/pith/SFQN6X5RIBKX2EK2S5PV3WRHKQ","bundle":"https://pith.science/pith/SFQN6X5RIBKX2EK2S5PV3WRHKQ/bundle.json","state":"https://pith.science/pith/SFQN6X5RIBKX2EK2S5PV3WRHKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFQN6X5RIBKX2EK2S5PV3WRHKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SFQN6X5RIBKX2EK2S5PV3WRHKQ","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":"b8059cce9fdfaaaf880e97a6215cf510924e5ff7c259c31ed43333d50b34fe46","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-09T18:53:55Z","title_canon_sha256":"37a4ee2427b7ae1d05aad5307803d8ed42b67bfb8f5c98dc232d89dd117afcf7"},"schema_version":"1.0","source":{"id":"1602.03115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03115","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03115v1","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03115","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"SFQN6X5RIBKX","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SFQN6X5RIBKX2EK2","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SFQN6X5R","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:be32ff61c0bd46ea0c12273c578f18a1c5bce9f52529ddddfc692795349f94f0","target":"graph","created_at":"2026-05-18T00:47:15Z","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":"The problem of robustly reconstructing a large number from its erroneous remainders with respect to several moduli, namely the robust remaindering problem, may occur in many applications including phase unwrapping, frequency detection from several undersampled waveforms, wireless sensor networks, etc. Assuming that the dynamic range of the large number is the maximal possible one, i.e., the least common multiple (lcm) of all the moduli, a method called robust Chinese remainder theorem (CRT) for solving the robust remaindering problem has been recently proposed. In this paper, by relaxing the a","authors_text":"Haiye Huo, Li Xiao, Xiang-Gen Xia","cross_cats":["math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-09T18:53:55Z","title":"Towards Robustness in Residue Number Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03115","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:63074cd641684110e6979080bbd948655ac6483532b4b8c7ba10ba0e99147ebe","target":"record","created_at":"2026-05-18T00:47:15Z","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":"b8059cce9fdfaaaf880e97a6215cf510924e5ff7c259c31ed43333d50b34fe46","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-09T18:53:55Z","title_canon_sha256":"37a4ee2427b7ae1d05aad5307803d8ed42b67bfb8f5c98dc232d89dd117afcf7"},"schema_version":"1.0","source":{"id":"1602.03115","kind":"arxiv","version":1}},"canonical_sha256":"9160df5fb140557d115a975f5dda2754364521c6c5a2ee77b51706394e4db4c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9160df5fb140557d115a975f5dda2754364521c6c5a2ee77b51706394e4db4c8","first_computed_at":"2026-05-18T00:47:15.545719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:15.545719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qxACRCv7haBDh1TLVNuc7vst7nxDqNiZ1PEvXly3H+u3Svj+gZk+GCA5TT+TVwsf+lf8KPf5E8VQG6F/SiXnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:15.546384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63074cd641684110e6979080bbd948655ac6483532b4b8c7ba10ba0e99147ebe","sha256:be32ff61c0bd46ea0c12273c578f18a1c5bce9f52529ddddfc692795349f94f0"],"state_sha256":"dde702b4f4b1b21133296eb8065284e3e69daa9fee65076b4cbb32a8b1b014be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZNE936+lnirDSheuEtzMgwCQEw8km8VPXnab2n7oBwehUZEEYFS51RLR9k8KpZKG5UpCautFFr9wKLqaNw5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:11:06.578853Z","bundle_sha256":"c40e281a2be7ded1ef75012b8a52a17aa8a8bc5b0314f74f3abdbbdaf664f183"}}