{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2P5WO2Y2MDZB7CLQFDGSFXEUQN","short_pith_number":"pith:2P5WO2Y2","schema_version":"1.0","canonical_sha256":"d3fb676b1a60f21f897028cd22dc94835a025ca803d638af310f829b6c49c392","source":{"kind":"arxiv","id":"1507.01422","version":1},"attestation_state":"computed","paper":{"title":"End-to-end Convolutional Network for Saliency Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Junting Pan, Xavier Gir\\'o-i-Nieto","submitted_at":"2015-07-06T12:43:26Z","abstract_excerpt":"The prediction of saliency areas in images has been traditionally addressed with hand crafted features based on neuroscience principles. This paper however addresses the problem with a completely data-driven approach by training a convolutional network. The learning process is formulated as a minimization of a loss function that measures the Euclidean distance of the predicted saliency map with the provided ground truth. The recent publication of large datasets of saliency prediction has provided enough data to train a not very deep architecture which is both fast and accurate. The convolution"},"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":"1507.01422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-06T12:43:26Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"74175054c16f6dad53be68231e314e08950962537287353398ebaccf977fcc59","abstract_canon_sha256":"1dd9c8971ed317d66bc6e0d811201bf9e7638cb0315fd7c6b099da1cc04c68b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:16.989297Z","signature_b64":"pXKWuGi/FeEKbFP5Dq1/MVt7B7/UQsCP+aMM2hZNnvwllHbE80+5tLEqu0N54Kffu40xYakVMAnHm05xJgM6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3fb676b1a60f21f897028cd22dc94835a025ca803d638af310f829b6c49c392","last_reissued_at":"2026-05-18T01:37:16.988746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:16.988746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end Convolutional Network for Saliency Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Junting Pan, Xavier Gir\\'o-i-Nieto","submitted_at":"2015-07-06T12:43:26Z","abstract_excerpt":"The prediction of saliency areas in images has been traditionally addressed with hand crafted features based on neuroscience principles. This paper however addresses the problem with a completely data-driven approach by training a convolutional network. The learning process is formulated as a minimization of a loss function that measures the Euclidean distance of the predicted saliency map with the provided ground truth. The recent publication of large datasets of saliency prediction has provided enough data to train a not very deep architecture which is both fast and accurate. The convolution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01422","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.01422","created_at":"2026-05-18T01:37:16.988829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01422v1","created_at":"2026-05-18T01:37:16.988829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01422","created_at":"2026-05-18T01:37:16.988829+00:00"},{"alias_kind":"pith_short_12","alias_value":"2P5WO2Y2MDZB","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2P5WO2Y2MDZB7CLQ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2P5WO2Y2","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06918","citing_title":"Tackling the Noisy Elephant in the Room: Label Noise-robust Out-of-Distribution Detection via Loss Correction and Low-rank Decomposition","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2P5WO2Y2MDZB7CLQFDGSFXEUQN","json":"https://pith.science/pith/2P5WO2Y2MDZB7CLQFDGSFXEUQN.json","graph_json":"https://pith.science/api/pith-number/2P5WO2Y2MDZB7CLQFDGSFXEUQN/graph.json","events_json":"https://pith.science/api/pith-number/2P5WO2Y2MDZB7CLQFDGSFXEUQN/events.json","paper":"https://pith.science/paper/2P5WO2Y2"},"agent_actions":{"view_html":"https://pith.science/pith/2P5WO2Y2MDZB7CLQFDGSFXEUQN","download_json":"https://pith.science/pith/2P5WO2Y2MDZB7CLQFDGSFXEUQN.json","view_paper":"https://pith.science/paper/2P5WO2Y2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01422&json=true","fetch_graph":"https://pith.science/api/pith-number/2P5WO2Y2MDZB7CLQFDGSFXEUQN/graph.json","fetch_events":"https://pith.science/api/pith-number/2P5WO2Y2MDZB7CLQFDGSFXEUQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2P5WO2Y2MDZB7CLQFDGSFXEUQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2P5WO2Y2MDZB7CLQFDGSFXEUQN/action/storage_attestation","attest_author":"https://pith.science/pith/2P5WO2Y2MDZB7CLQFDGSFXEUQN/action/author_attestation","sign_citation":"https://pith.science/pith/2P5WO2Y2MDZB7CLQFDGSFXEUQN/action/citation_signature","submit_replication":"https://pith.science/pith/2P5WO2Y2MDZB7CLQFDGSFXEUQN/action/replication_record"}},"created_at":"2026-05-18T01:37:16.988829+00:00","updated_at":"2026-05-18T01:37:16.988829+00:00"}