{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H4BJGR2HXYY4JAYMNN3R6RDRAT","short_pith_number":"pith:H4BJGR2H","canonical_record":{"source":{"id":"1810.08379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T07:37:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a8755ac8eaaacebe414bfbefa97407dff0b98158ba3ce8abafae0afe5a0ffd09","abstract_canon_sha256":"1fa13569b9c61d31d23581ac2ff1959adc01fd6a8e576bf5bdf6655647d40cf7"},"schema_version":"1.0"},"canonical_sha256":"3f02934747be31c4830c6b771f447104f0b70b59ee05df1aa40d031fdc361352","source":{"kind":"arxiv","id":"1810.08379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08379","created_at":"2026-05-18T00:02:48Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08379v1","created_at":"2026-05-18T00:02:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08379","created_at":"2026-05-18T00:02:48Z"},{"alias_kind":"pith_short_12","alias_value":"H4BJGR2HXYY4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H4BJGR2HXYY4JAYM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H4BJGR2H","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H4BJGR2HXYY4JAYMNN3R6RDRAT","target":"record","payload":{"canonical_record":{"source":{"id":"1810.08379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T07:37:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a8755ac8eaaacebe414bfbefa97407dff0b98158ba3ce8abafae0afe5a0ffd09","abstract_canon_sha256":"1fa13569b9c61d31d23581ac2ff1959adc01fd6a8e576bf5bdf6655647d40cf7"},"schema_version":"1.0"},"canonical_sha256":"3f02934747be31c4830c6b771f447104f0b70b59ee05df1aa40d031fdc361352","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:48.269508Z","signature_b64":"wblDwyD/tMYdzLRnKSM9lQ2Vpb8E9Aa3wtC5bOPTjf0YXY8AkFdyazhjPJULBkxei9ckJyQ/SnzHOViBvCRfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f02934747be31c4830c6b771f447104f0b70b59ee05df1aa40d031fdc361352","last_reissued_at":"2026-05-18T00:02:48.268995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:48.268995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.08379","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UokGZOxEumggT057JM/0gBuiQoXoD7RwBSdlw+VkoVsMpdOQlGaLVNU0YUsc/tryS/rxmMLf8XSxY7GzNpbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:03:41.307103Z"},"content_sha256":"d47a3229228b760e79d9dde95ed3d51026c3c6dbedd1a2a8176625a6603c6723","schema_version":"1.0","event_id":"sha256:d47a3229228b760e79d9dde95ed3d51026c3c6dbedd1a2a8176625a6603c6723"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H4BJGR2HXYY4JAYMNN3R6RDRAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Invocation-driven Neural Approximate Computing with a Multiclass-Classifier and Multiple Approximators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chengwen Xu, Haiyue Song, Li Jiang, Naifeng Jing, Qiang Xu, Xiaoyao Liang, Zhuoran Song","submitted_at":"2018-10-19T07:37:31Z","abstract_excerpt":"Neural approximate computing gains enormous energy-efficiency at the cost of tolerable quality-loss. A neural approximator can map the input data to output while a classifier determines whether the input data are safe to approximate with quality guarantee. However, existing works cannot maximize the invocation of the approximator, resulting in limited speedup and energy saving. By exploring the mapping space of those target functions, in this paper, we observe a nonuniform distribution of the approximation error incurred by the same approximator. We thus propose a novel approximate computing a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08379","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPB9Wt6sOIaluLH6F5LLStETNq9SoMwhH2+m2FZrCv0tWPajNlO785W23ddgZx/pPpO680/YoL+gCSMBxM/xCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:03:41.307717Z"},"content_sha256":"4d3a4a5838794ef04920b4b19dccc0c10a826de52359195d7c7bf777f136f5af","schema_version":"1.0","event_id":"sha256:4d3a4a5838794ef04920b4b19dccc0c10a826de52359195d7c7bf777f136f5af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4BJGR2HXYY4JAYMNN3R6RDRAT/bundle.json","state_url":"https://pith.science/pith/H4BJGR2HXYY4JAYMNN3R6RDRAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4BJGR2HXYY4JAYMNN3R6RDRAT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T15:03:41Z","links":{"resolver":"https://pith.science/pith/H4BJGR2HXYY4JAYMNN3R6RDRAT","bundle":"https://pith.science/pith/H4BJGR2HXYY4JAYMNN3R6RDRAT/bundle.json","state":"https://pith.science/pith/H4BJGR2HXYY4JAYMNN3R6RDRAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4BJGR2HXYY4JAYMNN3R6RDRAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H4BJGR2HXYY4JAYMNN3R6RDRAT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1fa13569b9c61d31d23581ac2ff1959adc01fd6a8e576bf5bdf6655647d40cf7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T07:37:31Z","title_canon_sha256":"a8755ac8eaaacebe414bfbefa97407dff0b98158ba3ce8abafae0afe5a0ffd09"},"schema_version":"1.0","source":{"id":"1810.08379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08379","created_at":"2026-05-18T00:02:48Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08379v1","created_at":"2026-05-18T00:02:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08379","created_at":"2026-05-18T00:02:48Z"},{"alias_kind":"pith_short_12","alias_value":"H4BJGR2HXYY4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H4BJGR2HXYY4JAYM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H4BJGR2H","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:4d3a4a5838794ef04920b4b19dccc0c10a826de52359195d7c7bf777f136f5af","target":"graph","created_at":"2026-05-18T00:02:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Neural approximate computing gains enormous energy-efficiency at the cost of tolerable quality-loss. A neural approximator can map the input data to output while a classifier determines whether the input data are safe to approximate with quality guarantee. However, existing works cannot maximize the invocation of the approximator, resulting in limited speedup and energy saving. By exploring the mapping space of those target functions, in this paper, we observe a nonuniform distribution of the approximation error incurred by the same approximator. We thus propose a novel approximate computing a","authors_text":"Chengwen Xu, Haiyue Song, Li Jiang, Naifeng Jing, Qiang Xu, Xiaoyao Liang, Zhuoran Song","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T07:37:31Z","title":"Invocation-driven Neural Approximate Computing with a Multiclass-Classifier and Multiple Approximators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08379","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d47a3229228b760e79d9dde95ed3d51026c3c6dbedd1a2a8176625a6603c6723","target":"record","created_at":"2026-05-18T00:02:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1fa13569b9c61d31d23581ac2ff1959adc01fd6a8e576bf5bdf6655647d40cf7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T07:37:31Z","title_canon_sha256":"a8755ac8eaaacebe414bfbefa97407dff0b98158ba3ce8abafae0afe5a0ffd09"},"schema_version":"1.0","source":{"id":"1810.08379","kind":"arxiv","version":1}},"canonical_sha256":"3f02934747be31c4830c6b771f447104f0b70b59ee05df1aa40d031fdc361352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f02934747be31c4830c6b771f447104f0b70b59ee05df1aa40d031fdc361352","first_computed_at":"2026-05-18T00:02:48.268995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:48.268995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wblDwyD/tMYdzLRnKSM9lQ2Vpb8E9Aa3wtC5bOPTjf0YXY8AkFdyazhjPJULBkxei9ckJyQ/SnzHOViBvCRfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:48.269508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d47a3229228b760e79d9dde95ed3d51026c3c6dbedd1a2a8176625a6603c6723","sha256:4d3a4a5838794ef04920b4b19dccc0c10a826de52359195d7c7bf777f136f5af"],"state_sha256":"26a9c666196c0ac4b8dedb12bcb09c585a4eda56d268eb82c55f489820110f7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oAzdPdIhQsKKAGk8XCb2WN6AdE5QdcM7xyZAcGFhIR9fS0RpKNIqSUWDWVXJHpxA3k5Tw4gVxIE+Puat5vUVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:03:41.311191Z","bundle_sha256":"49bc454a509a8f4d9bc7ffe1f743df0fdc593871d6c95a71703e4278346fad95"}}