{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6VTALXMYED2UHRBEGO3DRXIEHX","short_pith_number":"pith:6VTALXMY","schema_version":"1.0","canonical_sha256":"f56605dd9820f543c42433b638dd043dc2103d489b47c3076074ec42d7466d3c","source":{"kind":"arxiv","id":"1505.01350","version":1},"attestation_state":"computed","paper":{"title":"Classification of Occluded Objects using Fast Recurrent Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ozgur Yilmaz","submitted_at":"2015-05-06T12:58:58Z","abstract_excerpt":"Recurrent neural networks are powerful tools for handling incomplete data problems in computer vision, thanks to their significant generative capabilities. However, the computational demand for these algorithms is too high to work in real time, without specialized hardware or software solutions. In this paper, we propose a framework for augmenting recurrent processing capabilities into a feedforward network without sacrificing much from computational efficiency. We assume a mixture model and generate samples of the last hidden layer according to the class decisions of the output layer, modify "},"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":"1505.01350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-06T12:58:58Z","cross_cats_sorted":[],"title_canon_sha256":"0fe60572de9a68a669adeaf0dba3fbd4ee816cab744a8995c25f1a447a656657","abstract_canon_sha256":"a5e173bb6f3dc6ccce32a53a4c8d1c43ad556328a922f3b89fa0e5d82d12ec4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:49.673601Z","signature_b64":"r7RzWKxFy1U1ybREbyvkUPYScDnpPFgKx5Y0enOJQ/Kf/bY9uDGQx0TJhg52pvxaOccpGQxhIlVA++Fc1YMEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f56605dd9820f543c42433b638dd043dc2103d489b47c3076074ec42d7466d3c","last_reissued_at":"2026-05-18T02:16:49.672832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:49.672832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of Occluded Objects using Fast Recurrent Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ozgur Yilmaz","submitted_at":"2015-05-06T12:58:58Z","abstract_excerpt":"Recurrent neural networks are powerful tools for handling incomplete data problems in computer vision, thanks to their significant generative capabilities. However, the computational demand for these algorithms is too high to work in real time, without specialized hardware or software solutions. In this paper, we propose a framework for augmenting recurrent processing capabilities into a feedforward network without sacrificing much from computational efficiency. We assume a mixture model and generate samples of the last hidden layer according to the class decisions of the output layer, modify "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01350","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":"1505.01350","created_at":"2026-05-18T02:16:49.672960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01350v1","created_at":"2026-05-18T02:16:49.672960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01350","created_at":"2026-05-18T02:16:49.672960+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VTALXMYED2U","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VTALXMYED2UHRBE","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VTALXMY","created_at":"2026-05-18T12:29:07.941421+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/6VTALXMYED2UHRBEGO3DRXIEHX","json":"https://pith.science/pith/6VTALXMYED2UHRBEGO3DRXIEHX.json","graph_json":"https://pith.science/api/pith-number/6VTALXMYED2UHRBEGO3DRXIEHX/graph.json","events_json":"https://pith.science/api/pith-number/6VTALXMYED2UHRBEGO3DRXIEHX/events.json","paper":"https://pith.science/paper/6VTALXMY"},"agent_actions":{"view_html":"https://pith.science/pith/6VTALXMYED2UHRBEGO3DRXIEHX","download_json":"https://pith.science/pith/6VTALXMYED2UHRBEGO3DRXIEHX.json","view_paper":"https://pith.science/paper/6VTALXMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01350&json=true","fetch_graph":"https://pith.science/api/pith-number/6VTALXMYED2UHRBEGO3DRXIEHX/graph.json","fetch_events":"https://pith.science/api/pith-number/6VTALXMYED2UHRBEGO3DRXIEHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VTALXMYED2UHRBEGO3DRXIEHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VTALXMYED2UHRBEGO3DRXIEHX/action/storage_attestation","attest_author":"https://pith.science/pith/6VTALXMYED2UHRBEGO3DRXIEHX/action/author_attestation","sign_citation":"https://pith.science/pith/6VTALXMYED2UHRBEGO3DRXIEHX/action/citation_signature","submit_replication":"https://pith.science/pith/6VTALXMYED2UHRBEGO3DRXIEHX/action/replication_record"}},"created_at":"2026-05-18T02:16:49.672960+00:00","updated_at":"2026-05-18T02:16:49.672960+00:00"}