{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VNPEUD7MPQNR63JGF7RVKGEIML","short_pith_number":"pith:VNPEUD7M","schema_version":"1.0","canonical_sha256":"ab5e4a0fec7c1b1f6d262fe355188862cb90800a8f201a0b7e97788a6d9d09de","source":{"kind":"arxiv","id":"1502.02772","version":2},"attestation_state":"computed","paper":{"title":"A HMAX with LLC for visual recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fook Loong Lo, Kean Hong Lau, Yong Haur Tay","submitted_at":"2015-02-10T04:01:43Z","abstract_excerpt":"Today's high performance deep artificial neural networks (ANNs) rely heavily on parameter optimization, which is sequential in nature and even with a powerful GPU, would have taken weeks to train them up for solving challenging tasks [22]. HMAX [17] has demonstrated that a simple high performing network could be obtained without heavy optimization. In this paper, we had improved on the existing best HMAX neural network [12] in terms of structural simplicity and performance. Our design replaces the L1 minimization sparse coding (SC) with a locality-constrained linear coding (LLC) [20] which has"},"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":"1502.02772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-02-10T04:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"f18355ad238c8bac9679fcf0856bf684045b34a8dd0554a8b7eeef0c5ddfcf55","abstract_canon_sha256":"36a05e5c0d34ecc9a9b8ba8c345300f65585978f088bac08d650b9d4bd66d0ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:20.616703Z","signature_b64":"R7l3zg24EmYg0Y4fv2+SFN8WQxpJ/eyG8Sd6Lqr3UwXg6in9aXhFQySFsQTQWzkCgJJM4JfvsF6ZmkrHWEtoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab5e4a0fec7c1b1f6d262fe355188862cb90800a8f201a0b7e97788a6d9d09de","last_reissued_at":"2026-05-18T02:27:20.615864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:20.615864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A HMAX with LLC for visual recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fook Loong Lo, Kean Hong Lau, Yong Haur Tay","submitted_at":"2015-02-10T04:01:43Z","abstract_excerpt":"Today's high performance deep artificial neural networks (ANNs) rely heavily on parameter optimization, which is sequential in nature and even with a powerful GPU, would have taken weeks to train them up for solving challenging tasks [22]. HMAX [17] has demonstrated that a simple high performing network could be obtained without heavy optimization. In this paper, we had improved on the existing best HMAX neural network [12] in terms of structural simplicity and performance. Our design replaces the L1 minimization sparse coding (SC) with a locality-constrained linear coding (LLC) [20] which has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02772","kind":"arxiv","version":2},"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":"1502.02772","created_at":"2026-05-18T02:27:20.615991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02772v2","created_at":"2026-05-18T02:27:20.615991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02772","created_at":"2026-05-18T02:27:20.615991+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNPEUD7MPQNR","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNPEUD7MPQNR63JG","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNPEUD7M","created_at":"2026-05-18T12:29:47.479230+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/VNPEUD7MPQNR63JGF7RVKGEIML","json":"https://pith.science/pith/VNPEUD7MPQNR63JGF7RVKGEIML.json","graph_json":"https://pith.science/api/pith-number/VNPEUD7MPQNR63JGF7RVKGEIML/graph.json","events_json":"https://pith.science/api/pith-number/VNPEUD7MPQNR63JGF7RVKGEIML/events.json","paper":"https://pith.science/paper/VNPEUD7M"},"agent_actions":{"view_html":"https://pith.science/pith/VNPEUD7MPQNR63JGF7RVKGEIML","download_json":"https://pith.science/pith/VNPEUD7MPQNR63JGF7RVKGEIML.json","view_paper":"https://pith.science/paper/VNPEUD7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02772&json=true","fetch_graph":"https://pith.science/api/pith-number/VNPEUD7MPQNR63JGF7RVKGEIML/graph.json","fetch_events":"https://pith.science/api/pith-number/VNPEUD7MPQNR63JGF7RVKGEIML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNPEUD7MPQNR63JGF7RVKGEIML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNPEUD7MPQNR63JGF7RVKGEIML/action/storage_attestation","attest_author":"https://pith.science/pith/VNPEUD7MPQNR63JGF7RVKGEIML/action/author_attestation","sign_citation":"https://pith.science/pith/VNPEUD7MPQNR63JGF7RVKGEIML/action/citation_signature","submit_replication":"https://pith.science/pith/VNPEUD7MPQNR63JGF7RVKGEIML/action/replication_record"}},"created_at":"2026-05-18T02:27:20.615991+00:00","updated_at":"2026-05-18T02:27:20.615991+00:00"}