{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SNEMKIM4WX65GEN7UVHLQO636T","short_pith_number":"pith:SNEMKIM4","schema_version":"1.0","canonical_sha256":"9348c5219cb5fdd311bfa54eb83bdbf4d6e62d48b74431bea51d2247f533cc14","source":{"kind":"arxiv","id":"1605.02923","version":3},"attestation_state":"computed","paper":{"title":"Cross-diffusion systems for image processing: I. The linear case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"A. Araujo, A. Duran, E. Cuesta, S. Barbeiro","submitted_at":"2016-05-10T10:18:22Z","abstract_excerpt":"The use of cross-diffusion systems as mathematical models of different image processes is investigated. The present paper is concerned with linear filtering. First, those systems satisfying the most important scale-space properties are identified. Then a numerical study on the effect of cross-diffusion in filtering problems is presented."},"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":"1605.02923","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2016-05-10T10:18:22Z","cross_cats_sorted":[],"title_canon_sha256":"eeb72ad582fe4c4be452958eeab8bcc7f2db55dbf0c89b8c3afba52277aba536","abstract_canon_sha256":"50208f6b55af493aa40ac7589ffa65f85572df1fdcd6bc93dcf063152ce3bde0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:29.600174Z","signature_b64":"m5dD1DVyCLNpyHT3qvF0WzDAJoB1AwJKlfoQrk4Bbhxy3QS1I4eZ6ufdiuaA9s1qGp7Hz8IsbGFmNHc+Fp5VAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9348c5219cb5fdd311bfa54eb83bdbf4d6e62d48b74431bea51d2247f533cc14","last_reissued_at":"2026-05-18T00:50:29.599450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:29.599450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross-diffusion systems for image processing: I. The linear case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"A. Araujo, A. Duran, E. Cuesta, S. Barbeiro","submitted_at":"2016-05-10T10:18:22Z","abstract_excerpt":"The use of cross-diffusion systems as mathematical models of different image processes is investigated. The present paper is concerned with linear filtering. First, those systems satisfying the most important scale-space properties are identified. Then a numerical study on the effect of cross-diffusion in filtering problems is presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02923","kind":"arxiv","version":3},"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":"1605.02923","created_at":"2026-05-18T00:50:29.599539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02923v3","created_at":"2026-05-18T00:50:29.599539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02923","created_at":"2026-05-18T00:50:29.599539+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNEMKIM4WX65","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNEMKIM4WX65GEN7","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNEMKIM4","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SNEMKIM4WX65GEN7UVHLQO636T","json":"https://pith.science/pith/SNEMKIM4WX65GEN7UVHLQO636T.json","graph_json":"https://pith.science/api/pith-number/SNEMKIM4WX65GEN7UVHLQO636T/graph.json","events_json":"https://pith.science/api/pith-number/SNEMKIM4WX65GEN7UVHLQO636T/events.json","paper":"https://pith.science/paper/SNEMKIM4"},"agent_actions":{"view_html":"https://pith.science/pith/SNEMKIM4WX65GEN7UVHLQO636T","download_json":"https://pith.science/pith/SNEMKIM4WX65GEN7UVHLQO636T.json","view_paper":"https://pith.science/paper/SNEMKIM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02923&json=true","fetch_graph":"https://pith.science/api/pith-number/SNEMKIM4WX65GEN7UVHLQO636T/graph.json","fetch_events":"https://pith.science/api/pith-number/SNEMKIM4WX65GEN7UVHLQO636T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNEMKIM4WX65GEN7UVHLQO636T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNEMKIM4WX65GEN7UVHLQO636T/action/storage_attestation","attest_author":"https://pith.science/pith/SNEMKIM4WX65GEN7UVHLQO636T/action/author_attestation","sign_citation":"https://pith.science/pith/SNEMKIM4WX65GEN7UVHLQO636T/action/citation_signature","submit_replication":"https://pith.science/pith/SNEMKIM4WX65GEN7UVHLQO636T/action/replication_record"}},"created_at":"2026-05-18T00:50:29.599539+00:00","updated_at":"2026-05-18T00:50:29.599539+00:00"}