{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XV5UTJCLHB5ZNFHYKTCGYGD4VA","short_pith_number":"pith:XV5UTJCL","canonical_record":{"source":{"id":"1803.09420","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-26T05:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"6b61ae22f5fb1c4ad7c9c92d22d20ccf5096df4d6d554f1f30c91798b442f4fb","abstract_canon_sha256":"106d57ebf2ad976fd9ec09dbf4dbaaef0b9624a1e181f79d729b5a6c485d2ce5"},"schema_version":"1.0"},"canonical_sha256":"bd7b49a44b387b9694f854c46c187ca829b9eafcd18897471cfd01b3b5dd39b1","source":{"kind":"arxiv","id":"1803.09420","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09420","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09420v5","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09420","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"pith_short_12","alias_value":"XV5UTJCLHB5Z","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"pith_short_16","alias_value":"XV5UTJCLHB5ZNFHY","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"pith_short_8","alias_value":"XV5UTJCL","created_at":"2026-07-05T03:19:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XV5UTJCLHB5ZNFHYKTCGYGD4VA","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09420","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-26T05:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"6b61ae22f5fb1c4ad7c9c92d22d20ccf5096df4d6d554f1f30c91798b442f4fb","abstract_canon_sha256":"106d57ebf2ad976fd9ec09dbf4dbaaef0b9624a1e181f79d729b5a6c485d2ce5"},"schema_version":"1.0"},"canonical_sha256":"bd7b49a44b387b9694f854c46c187ca829b9eafcd18897471cfd01b3b5dd39b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:57.604634Z","signature_b64":"2H3ZRKNQTOd6jaH/MbhY0fTSDGytw74CJLVZ+EjiTc1ve69JH61OJl4Tuxq6kOvznk++4s9YqXN/SlK/DHADDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd7b49a44b387b9694f854c46c187ca829b9eafcd18897471cfd01b3b5dd39b1","last_reissued_at":"2026-07-05T03:19:57.604229Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:57.604229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09420","source_version":5,"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-07-05T03:19:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mgaVGO2Pbg/DnfOOP18qs2UkNv7VB6INwDdPe2RLQyXEH14IUDGoOv0eRJtfNsByTGRBuRNQMZZ3sZ1cEylDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:30:59.259365Z"},"content_sha256":"482593b2c1d1804aa700e2ebbb5a300ce219591c856d406bbd52c06a1233298c","schema_version":"1.0","event_id":"sha256:482593b2c1d1804aa700e2ebbb5a300ce219591c856d406bbd52c06a1233298c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XV5UTJCLHB5ZNFHYKTCGYGD4VA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-scale Processing of Noisy Images using Edge Preservation Losses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Nati Ofir, Yosi Keller","submitted_at":"2018-03-26T05:39:31Z","abstract_excerpt":"Noisy images processing is a fundamental task of computer vision. The first example is the detection of faint edges in noisy images, a challenging problem studied in the last decades. A recent study introduced a fast method to detect faint edges in the highest accuracy among all the existing approaches. Their complexity is nearly linear in the image's pixels and their runtime is seconds for a noisy image. Their approach utilizes a multi-scale binary partitioning of the image. By utilizing the multi-scale U-net architecture, we show in this paper that their method can be dramatically improved i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09420","kind":"arxiv","version":5},"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/1803.09420/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"},"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-07-05T03:19:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVIrpINZRH0BXD67Pu2jHUWp0L0IP7ppaejkhwWIXYR60Bgp5QkvR3TdqpOGwB/gyeWDII1TMu2lxu5+TdQ2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:30:59.259823Z"},"content_sha256":"ac7a8fc3c4da9094d0e6d101851d6b7deba8711f087c06bc93097563b6c6819b","schema_version":"1.0","event_id":"sha256:ac7a8fc3c4da9094d0e6d101851d6b7deba8711f087c06bc93097563b6c6819b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XV5UTJCLHB5ZNFHYKTCGYGD4VA/bundle.json","state_url":"https://pith.science/pith/XV5UTJCLHB5ZNFHYKTCGYGD4VA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XV5UTJCLHB5ZNFHYKTCGYGD4VA/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-07-07T11:30:59Z","links":{"resolver":"https://pith.science/pith/XV5UTJCLHB5ZNFHYKTCGYGD4VA","bundle":"https://pith.science/pith/XV5UTJCLHB5ZNFHYKTCGYGD4VA/bundle.json","state":"https://pith.science/pith/XV5UTJCLHB5ZNFHYKTCGYGD4VA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XV5UTJCLHB5ZNFHYKTCGYGD4VA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XV5UTJCLHB5ZNFHYKTCGYGD4VA","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":"106d57ebf2ad976fd9ec09dbf4dbaaef0b9624a1e181f79d729b5a6c485d2ce5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-26T05:39:31Z","title_canon_sha256":"6b61ae22f5fb1c4ad7c9c92d22d20ccf5096df4d6d554f1f30c91798b442f4fb"},"schema_version":"1.0","source":{"id":"1803.09420","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09420","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09420v5","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09420","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"pith_short_12","alias_value":"XV5UTJCLHB5Z","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"pith_short_16","alias_value":"XV5UTJCLHB5ZNFHY","created_at":"2026-07-05T03:19:57Z"},{"alias_kind":"pith_short_8","alias_value":"XV5UTJCL","created_at":"2026-07-05T03:19:57Z"}],"graph_snapshots":[{"event_id":"sha256:ac7a8fc3c4da9094d0e6d101851d6b7deba8711f087c06bc93097563b6c6819b","target":"graph","created_at":"2026-07-05T03:19:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1803.09420/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Noisy images processing is a fundamental task of computer vision. The first example is the detection of faint edges in noisy images, a challenging problem studied in the last decades. A recent study introduced a fast method to detect faint edges in the highest accuracy among all the existing approaches. Their complexity is nearly linear in the image's pixels and their runtime is seconds for a noisy image. Their approach utilizes a multi-scale binary partitioning of the image. By utilizing the multi-scale U-net architecture, we show in this paper that their method can be dramatically improved i","authors_text":"Nati Ofir, Yosi Keller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-26T05:39:31Z","title":"Multi-scale Processing of Noisy Images using Edge Preservation Losses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09420","kind":"arxiv","version":5},"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:482593b2c1d1804aa700e2ebbb5a300ce219591c856d406bbd52c06a1233298c","target":"record","created_at":"2026-07-05T03:19:57Z","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":"106d57ebf2ad976fd9ec09dbf4dbaaef0b9624a1e181f79d729b5a6c485d2ce5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-26T05:39:31Z","title_canon_sha256":"6b61ae22f5fb1c4ad7c9c92d22d20ccf5096df4d6d554f1f30c91798b442f4fb"},"schema_version":"1.0","source":{"id":"1803.09420","kind":"arxiv","version":5}},"canonical_sha256":"bd7b49a44b387b9694f854c46c187ca829b9eafcd18897471cfd01b3b5dd39b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd7b49a44b387b9694f854c46c187ca829b9eafcd18897471cfd01b3b5dd39b1","first_computed_at":"2026-07-05T03:19:57.604229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:19:57.604229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2H3ZRKNQTOd6jaH/MbhY0fTSDGytw74CJLVZ+EjiTc1ve69JH61OJl4Tuxq6kOvznk++4s9YqXN/SlK/DHADDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:19:57.604634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09420","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:482593b2c1d1804aa700e2ebbb5a300ce219591c856d406bbd52c06a1233298c","sha256:ac7a8fc3c4da9094d0e6d101851d6b7deba8711f087c06bc93097563b6c6819b"],"state_sha256":"f53e01ffe1d9fdabefa0f97f8af83c025e553f97a7db40cc7d350131f5acf156"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxRUFfdLZQewvlY+OtkrHpoQ8qfviYgIdFknX5PJWX1F4ZkLhG4tbo9YNoJ3JYuKqGShBkzPYpenjxiYgha/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:30:59.261909Z","bundle_sha256":"8b52560f0be9650761dbdd4768d1f44adc6c293568b539c15431f3f02eb2e13f"}}