{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:O3EC4W2LBLTXUZJZTNQUPA26KP","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":"aa01f93ddc8bbd90fb2eb4e8740d8b63063074f582dca31842505ea3c225b620","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-08-26T02:42:12Z","title_canon_sha256":"5689e52d6014ea2dfc881e27509c49cdc6dfda110e9d89d782e820fa64590a81"},"schema_version":"1.0","source":{"id":"2308.13735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13735","created_at":"2026-07-05T06:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13735v1","created_at":"2026-07-05T06:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13735","created_at":"2026-07-05T06:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"O3EC4W2LBLTX","created_at":"2026-07-05T06:45:04Z"},{"alias_kind":"pith_short_16","alias_value":"O3EC4W2LBLTXUZJZ","created_at":"2026-07-05T06:45:04Z"},{"alias_kind":"pith_short_8","alias_value":"O3EC4W2L","created_at":"2026-07-05T06:45:04Z"}],"graph_snapshots":[{"event_id":"sha256:c8c165332bd5f6cd82f70a31945d9f206776d2746d2f4652899e1e6dc4852c7a","target":"graph","created_at":"2026-07-05T06:45:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.13735/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Binary neural networks (BNNs) have been widely adopted to reduce the computational cost and memory storage on edge-computing devices by using one-bit representation for activations and weights. However, as neural networks become wider/deeper to improve accuracy and meet practical requirements, the computational burden remains a significant challenge even on the binary version. To address these issues, this paper proposes a novel method called Minimum Spanning Tree (MST) compression that learns to compress and accelerate BNNs. The proposed architecture leverages an observation from previous wor","authors_text":"Choong Seon Hong, Linh-Tam Tran, Lok-Won Kim, Quang Hieu Vo, Sung-Ho Bae","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-08-26T02:42:12Z","title":"MST-compression: Compressing and Accelerating Binary Neural Networks with Minimum Spanning Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13735","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:a9b37eceb7a2d7238293a7523f07ca7a9df4f62d6d462446b74810e76b6eef91","target":"record","created_at":"2026-07-05T06:45:04Z","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":"aa01f93ddc8bbd90fb2eb4e8740d8b63063074f582dca31842505ea3c225b620","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-08-26T02:42:12Z","title_canon_sha256":"5689e52d6014ea2dfc881e27509c49cdc6dfda110e9d89d782e820fa64590a81"},"schema_version":"1.0","source":{"id":"2308.13735","kind":"arxiv","version":1}},"canonical_sha256":"76c82e5b4b0ae77a65399b6147835e53d9dcafd9b328462ad5888a3acf379755","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76c82e5b4b0ae77a65399b6147835e53d9dcafd9b328462ad5888a3acf379755","first_computed_at":"2026-07-05T06:45:04.168365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:45:04.168365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"prot+JkXrcXVvjqJ46K9Ahw2wwdcOuKji9smJruflOu3KSI/kjgO/C1ILs4P8nG/LvL4riI0BXt7fB7CQ/5fDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:45:04.168840Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.13735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9b37eceb7a2d7238293a7523f07ca7a9df4f62d6d462446b74810e76b6eef91","sha256:c8c165332bd5f6cd82f70a31945d9f206776d2746d2f4652899e1e6dc4852c7a"],"state_sha256":"0e51062864a81451772290030ff970637fdb7e4f5107bf178a89faf9f872248b"}