{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:V3OUBU4W6L3YDTO7S2ZBF6YHDS","short_pith_number":"pith:V3OUBU4W","schema_version":"1.0","canonical_sha256":"aedd40d396f2f781cddf96b212fb071c91cdc67de5b76dc1e3041949930c0f0a","source":{"kind":"arxiv","id":"1804.03867","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Binary Networks: Optimizing for Accuracy, Efficiency and Memory","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ameya Prabhu, Anoop Namboodiri, Rohit Gajawada, Sri Aurobindo Munagala, Vishal Batchu","submitted_at":"2018-04-11T08:27:49Z","abstract_excerpt":"Binarization is an extreme network compression approach that provides large computational speedups along with energy and memory savings, albeit at significant accuracy costs. We investigate the question of where to binarize inputs at layer-level granularity and show that selectively binarizing the inputs to specific layers in the network could lead to significant improvements in accuracy while preserving most of the advantages of binarization. We analyze the binarization tradeoff using a metric that jointly models the input binarization-error and computational cost and introduce an efficient a"},"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":"1804.03867","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2018-04-11T08:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"804b677a2fb18f776253d9a68f9a8ae0768eb17780d4fd6b1a77aa46150f3761","abstract_canon_sha256":"93485b502bd89e8c37d98d614f639e1067ccd5a876b8c76c5d2254a7380e208a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:42.824031Z","signature_b64":"d8/stm6d0qWz1LvYMQsiAajf5WlwCe8dNdtWNW2WgRvQa/JpqEI3tktvmmGmbCBrQGvDQf0ijxm6DkKopsP/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aedd40d396f2f781cddf96b212fb071c91cdc67de5b76dc1e3041949930c0f0a","last_reissued_at":"2026-05-18T00:18:42.823364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:42.823364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Binary Networks: Optimizing for Accuracy, Efficiency and Memory","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ameya Prabhu, Anoop Namboodiri, Rohit Gajawada, Sri Aurobindo Munagala, Vishal Batchu","submitted_at":"2018-04-11T08:27:49Z","abstract_excerpt":"Binarization is an extreme network compression approach that provides large computational speedups along with energy and memory savings, albeit at significant accuracy costs. We investigate the question of where to binarize inputs at layer-level granularity and show that selectively binarizing the inputs to specific layers in the network could lead to significant improvements in accuracy while preserving most of the advantages of binarization. We analyze the binarization tradeoff using a metric that jointly models the input binarization-error and computational cost and introduce an efficient a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03867","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":"1804.03867","created_at":"2026-05-18T00:18:42.823478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03867v1","created_at":"2026-05-18T00:18:42.823478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03867","created_at":"2026-05-18T00:18:42.823478+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3OUBU4W6L3Y","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3OUBU4W6L3YDTO7","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3OUBU4W","created_at":"2026-05-18T12:32:56.356000+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/V3OUBU4W6L3YDTO7S2ZBF6YHDS","json":"https://pith.science/pith/V3OUBU4W6L3YDTO7S2ZBF6YHDS.json","graph_json":"https://pith.science/api/pith-number/V3OUBU4W6L3YDTO7S2ZBF6YHDS/graph.json","events_json":"https://pith.science/api/pith-number/V3OUBU4W6L3YDTO7S2ZBF6YHDS/events.json","paper":"https://pith.science/paper/V3OUBU4W"},"agent_actions":{"view_html":"https://pith.science/pith/V3OUBU4W6L3YDTO7S2ZBF6YHDS","download_json":"https://pith.science/pith/V3OUBU4W6L3YDTO7S2ZBF6YHDS.json","view_paper":"https://pith.science/paper/V3OUBU4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03867&json=true","fetch_graph":"https://pith.science/api/pith-number/V3OUBU4W6L3YDTO7S2ZBF6YHDS/graph.json","fetch_events":"https://pith.science/api/pith-number/V3OUBU4W6L3YDTO7S2ZBF6YHDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3OUBU4W6L3YDTO7S2ZBF6YHDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3OUBU4W6L3YDTO7S2ZBF6YHDS/action/storage_attestation","attest_author":"https://pith.science/pith/V3OUBU4W6L3YDTO7S2ZBF6YHDS/action/author_attestation","sign_citation":"https://pith.science/pith/V3OUBU4W6L3YDTO7S2ZBF6YHDS/action/citation_signature","submit_replication":"https://pith.science/pith/V3OUBU4W6L3YDTO7S2ZBF6YHDS/action/replication_record"}},"created_at":"2026-05-18T00:18:42.823478+00:00","updated_at":"2026-05-18T00:18:42.823478+00:00"}