{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EZXQPDLLBF6C7Y5W7VICNY45CD","short_pith_number":"pith:EZXQPDLL","canonical_record":{"source":{"id":"1612.00212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T11:56:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ec90a6e6c5e185e43fc4c1e66e0e9761b4c8415108c246fc07c647fda6b16ae8","abstract_canon_sha256":"4e5de72a67d0ef9adc60f1e78ae23e62c75f14ff488696828ca3fb6cf832a385"},"schema_version":"1.0"},"canonical_sha256":"266f078d6b097c2fe3b6fd5026e39d10db5e8d719b691b90f60c0e3bb89b2f0f","source":{"kind":"arxiv","id":"1612.00212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00212","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00212v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00212","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"EZXQPDLLBF6C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EZXQPDLLBF6C7Y5W","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EZXQPDLL","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EZXQPDLLBF6C7Y5W7VICNY45CD","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T11:56:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ec90a6e6c5e185e43fc4c1e66e0e9761b4c8415108c246fc07c647fda6b16ae8","abstract_canon_sha256":"4e5de72a67d0ef9adc60f1e78ae23e62c75f14ff488696828ca3fb6cf832a385"},"schema_version":"1.0"},"canonical_sha256":"266f078d6b097c2fe3b6fd5026e39d10db5e8d719b691b90f60c0e3bb89b2f0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:05.752231Z","signature_b64":"Me4TqAkduzGlTEYR1i72K4BJA4iOwHw2rzR2RGprFTo4v24l+Zdfg1jmmGKgrYfcjgKewPG7OsQFP+j4OkErBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"266f078d6b097c2fe3b6fd5026e39d10db5e8d719b691b90f60c0e3bb89b2f0f","last_reissued_at":"2026-05-18T00:56:05.751563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:05.751563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00212","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:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeN+m5YT/QTJxIU74HAb0Rw/WW7sOWYp0DusRZB4XTsQZqgJGLLxJFUQruDTOJcNikNQ6QSzbMWtpNeqG0ALCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:12:08.992974Z"},"content_sha256":"07304a2542ec3ff5a179e901db1f8926cc6c83aa040158a795f2c91a2d18dada","schema_version":"1.0","event_id":"sha256:07304a2542ec3ff5a179e901db1f8926cc6c83aa040158a795f2c91a2d18dada"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EZXQPDLLBF6C7Y5W7VICNY45CD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Training Bit Fully Convolutional Network for Fast Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Cong Yao, Dieqiao Feng, He Wen, Shuchang Zhou, Xinyu Zhou, Yuxiang Zhang, Zhe Liang","submitted_at":"2016-12-01T11:56:15Z","abstract_excerpt":"Fully convolutional neural networks give accurate, per-pixel prediction for input images and have applications like semantic segmentation. However, a typical FCN usually requires lots of floating point computation and large run-time memory, which effectively limits its usability. We propose a method to train Bit Fully Convolution Network (BFCN), a fully convolutional neural network that has low bit-width weights and activations. Because most of its computation-intensive convolutions are accomplished between low bit-width numbers, a BFCN can be accelerated by an efficient bit-convolution implem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00212","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:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEJ2yYK4Uxuv/6OY6cT6lGOT7fya15rB+E1F8/Gg1Do5NFB7KEcBre77QDgIkyR3aDycdERLflLxy5xIneH7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:12:08.993645Z"},"content_sha256":"ef26cf2c89c26dadadb17c8b24ae72a2676c9a837e01015ebdae2ac61ff3447c","schema_version":"1.0","event_id":"sha256:ef26cf2c89c26dadadb17c8b24ae72a2676c9a837e01015ebdae2ac61ff3447c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZXQPDLLBF6C7Y5W7VICNY45CD/bundle.json","state_url":"https://pith.science/pith/EZXQPDLLBF6C7Y5W7VICNY45CD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZXQPDLLBF6C7Y5W7VICNY45CD/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-25T11:12:08Z","links":{"resolver":"https://pith.science/pith/EZXQPDLLBF6C7Y5W7VICNY45CD","bundle":"https://pith.science/pith/EZXQPDLLBF6C7Y5W7VICNY45CD/bundle.json","state":"https://pith.science/pith/EZXQPDLLBF6C7Y5W7VICNY45CD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZXQPDLLBF6C7Y5W7VICNY45CD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EZXQPDLLBF6C7Y5W7VICNY45CD","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":"4e5de72a67d0ef9adc60f1e78ae23e62c75f14ff488696828ca3fb6cf832a385","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T11:56:15Z","title_canon_sha256":"ec90a6e6c5e185e43fc4c1e66e0e9761b4c8415108c246fc07c647fda6b16ae8"},"schema_version":"1.0","source":{"id":"1612.00212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00212","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00212v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00212","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"EZXQPDLLBF6C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EZXQPDLLBF6C7Y5W","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EZXQPDLL","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:ef26cf2c89c26dadadb17c8b24ae72a2676c9a837e01015ebdae2ac61ff3447c","target":"graph","created_at":"2026-05-18T00:56:05Z","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":"Fully convolutional neural networks give accurate, per-pixel prediction for input images and have applications like semantic segmentation. However, a typical FCN usually requires lots of floating point computation and large run-time memory, which effectively limits its usability. We propose a method to train Bit Fully Convolution Network (BFCN), a fully convolutional neural network that has low bit-width weights and activations. Because most of its computation-intensive convolutions are accomplished between low bit-width numbers, a BFCN can be accelerated by an efficient bit-convolution implem","authors_text":"Cong Yao, Dieqiao Feng, He Wen, Shuchang Zhou, Xinyu Zhou, Yuxiang Zhang, Zhe Liang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T11:56:15Z","title":"Training Bit Fully Convolutional Network for Fast Semantic Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00212","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:07304a2542ec3ff5a179e901db1f8926cc6c83aa040158a795f2c91a2d18dada","target":"record","created_at":"2026-05-18T00:56:05Z","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":"4e5de72a67d0ef9adc60f1e78ae23e62c75f14ff488696828ca3fb6cf832a385","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T11:56:15Z","title_canon_sha256":"ec90a6e6c5e185e43fc4c1e66e0e9761b4c8415108c246fc07c647fda6b16ae8"},"schema_version":"1.0","source":{"id":"1612.00212","kind":"arxiv","version":1}},"canonical_sha256":"266f078d6b097c2fe3b6fd5026e39d10db5e8d719b691b90f60c0e3bb89b2f0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"266f078d6b097c2fe3b6fd5026e39d10db5e8d719b691b90f60c0e3bb89b2f0f","first_computed_at":"2026-05-18T00:56:05.751563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:05.751563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Me4TqAkduzGlTEYR1i72K4BJA4iOwHw2rzR2RGprFTo4v24l+Zdfg1jmmGKgrYfcjgKewPG7OsQFP+j4OkErBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:05.752231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07304a2542ec3ff5a179e901db1f8926cc6c83aa040158a795f2c91a2d18dada","sha256:ef26cf2c89c26dadadb17c8b24ae72a2676c9a837e01015ebdae2ac61ff3447c"],"state_sha256":"4235339341fe3f2ba22b2e65947307ecd70520ba8e770625b9bec05afb136f67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YT0MhFp3/Ibd6RwngcSgBKUKxkTagba2j7ZStDJYIQGIM5nJ2h2utIRSIEhNywGCXrhsZurwg+mlt4Ep7wtcDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:12:08.996607Z","bundle_sha256":"0a64622c17215855e699bd91481be4eadf4cf2ef1df29f7d67c5490296fccc6e"}}