{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CDT4TU7O575EM7DRGSP4GWTJ2B","short_pith_number":"pith:CDT4TU7O","canonical_record":{"source":{"id":"2308.02451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-08-04T16:34:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5de2e7c2931049ecf30405d544f141dba9e45e369f8eb917cb2c15222c52e313","abstract_canon_sha256":"69df685c7be0b744e72523ebbd8d7708ccd5a8e102344de5c87615c39fa63f65"},"schema_version":"1.0"},"canonical_sha256":"10e7c9d3eeeffa467c71349fc35a69d06c8926458b8a9babebfa386cf719767e","source":{"kind":"arxiv","id":"2308.02451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.02451","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"2308.02451v1","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.02451","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"CDT4TU7O575E","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"pith_short_16","alias_value":"CDT4TU7O575EM7DR","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"pith_short_8","alias_value":"CDT4TU7O","created_at":"2026-07-05T06:37:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CDT4TU7O575EM7DRGSP4GWTJ2B","target":"record","payload":{"canonical_record":{"source":{"id":"2308.02451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-08-04T16:34:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5de2e7c2931049ecf30405d544f141dba9e45e369f8eb917cb2c15222c52e313","abstract_canon_sha256":"69df685c7be0b744e72523ebbd8d7708ccd5a8e102344de5c87615c39fa63f65"},"schema_version":"1.0"},"canonical_sha256":"10e7c9d3eeeffa467c71349fc35a69d06c8926458b8a9babebfa386cf719767e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:44.437895Z","signature_b64":"LKxLbiyy3hPZuagmL4iMVyckewRqvO2jMfZRtsFoG69nUQfXYpYZgiZk/d9rqOmMgUzUgk1D1N2zUUqAacdmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10e7c9d3eeeffa467c71349fc35a69d06c8926458b8a9babebfa386cf719767e","last_reissued_at":"2026-07-05T06:37:44.437503Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:44.437503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.02451","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-07-05T06:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXwtJVgi2U6VNTl+DX3oOSr384F+AY8vHhvkEO7BKd1dDVjnd8FGIB7enF//u5CoK1orAzyPxV+046d2lY0SCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:40:53.099465Z"},"content_sha256":"16cc48c0a7664df20587d1ec133287cd68a5942cf8de4c0eec524fbcc4d72441","schema_version":"1.0","event_id":"sha256:16cc48c0a7664df20587d1ec133287cd68a5942cf8de4c0eec524fbcc4d72441"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CDT4TU7O575EM7DRGSP4GWTJ2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pruning a neural network using Bayesian inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Daniel B. Rowe, Sunil Mathew","submitted_at":"2023-08-04T16:34:06Z","abstract_excerpt":"Neural network pruning is a highly effective technique aimed at reducing the computational and memory demands of large neural networks. In this research paper, we present a novel approach to pruning neural networks utilizing Bayesian inference, which can seamlessly integrate into the training procedure. Our proposed method leverages the posterior probabilities of the neural network prior to and following pruning, enabling the calculation of Bayes factors. The calculated Bayes factors guide the iterative pruning. Through comprehensive evaluations conducted on multiple benchmarks, we demonstrate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.02451","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.02451/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sW+i5BMifLtM2W18R/fMoCQwceNvAmKyHTk9YVDdN8aw26oENEYf73OAFTgAGtmNLUkIy0LrzLoY2wgAwk7JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:40:53.100087Z"},"content_sha256":"c750c168fe1204b60c2d4c3dfc14606273bbe1282ecceefbab596acf4881e4db","schema_version":"1.0","event_id":"sha256:c750c168fe1204b60c2d4c3dfc14606273bbe1282ecceefbab596acf4881e4db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDT4TU7O575EM7DRGSP4GWTJ2B/bundle.json","state_url":"https://pith.science/pith/CDT4TU7O575EM7DRGSP4GWTJ2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDT4TU7O575EM7DRGSP4GWTJ2B/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-08-18T08:40:53Z","links":{"resolver":"https://pith.science/pith/CDT4TU7O575EM7DRGSP4GWTJ2B","bundle":"https://pith.science/pith/CDT4TU7O575EM7DRGSP4GWTJ2B/bundle.json","state":"https://pith.science/pith/CDT4TU7O575EM7DRGSP4GWTJ2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDT4TU7O575EM7DRGSP4GWTJ2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CDT4TU7O575EM7DRGSP4GWTJ2B","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":"69df685c7be0b744e72523ebbd8d7708ccd5a8e102344de5c87615c39fa63f65","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-08-04T16:34:06Z","title_canon_sha256":"5de2e7c2931049ecf30405d544f141dba9e45e369f8eb917cb2c15222c52e313"},"schema_version":"1.0","source":{"id":"2308.02451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.02451","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"2308.02451v1","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.02451","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"CDT4TU7O575E","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"pith_short_16","alias_value":"CDT4TU7O575EM7DR","created_at":"2026-07-05T06:37:44Z"},{"alias_kind":"pith_short_8","alias_value":"CDT4TU7O","created_at":"2026-07-05T06:37:44Z"}],"graph_snapshots":[{"event_id":"sha256:c750c168fe1204b60c2d4c3dfc14606273bbe1282ecceefbab596acf4881e4db","target":"graph","created_at":"2026-07-05T06:37:44Z","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.02451/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural network pruning is a highly effective technique aimed at reducing the computational and memory demands of large neural networks. In this research paper, we present a novel approach to pruning neural networks utilizing Bayesian inference, which can seamlessly integrate into the training procedure. Our proposed method leverages the posterior probabilities of the neural network prior to and following pruning, enabling the calculation of Bayes factors. The calculated Bayes factors guide the iterative pruning. Through comprehensive evaluations conducted on multiple benchmarks, we demonstrate","authors_text":"Daniel B. Rowe, Sunil Mathew","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-08-04T16:34:06Z","title":"Pruning a neural network using Bayesian inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.02451","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:16cc48c0a7664df20587d1ec133287cd68a5942cf8de4c0eec524fbcc4d72441","target":"record","created_at":"2026-07-05T06:37:44Z","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":"69df685c7be0b744e72523ebbd8d7708ccd5a8e102344de5c87615c39fa63f65","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-08-04T16:34:06Z","title_canon_sha256":"5de2e7c2931049ecf30405d544f141dba9e45e369f8eb917cb2c15222c52e313"},"schema_version":"1.0","source":{"id":"2308.02451","kind":"arxiv","version":1}},"canonical_sha256":"10e7c9d3eeeffa467c71349fc35a69d06c8926458b8a9babebfa386cf719767e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10e7c9d3eeeffa467c71349fc35a69d06c8926458b8a9babebfa386cf719767e","first_computed_at":"2026-07-05T06:37:44.437503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:37:44.437503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LKxLbiyy3hPZuagmL4iMVyckewRqvO2jMfZRtsFoG69nUQfXYpYZgiZk/d9rqOmMgUzUgk1D1N2zUUqAacdmCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:37:44.437895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.02451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16cc48c0a7664df20587d1ec133287cd68a5942cf8de4c0eec524fbcc4d72441","sha256:c750c168fe1204b60c2d4c3dfc14606273bbe1282ecceefbab596acf4881e4db"],"state_sha256":"aac2079302388a329361860b2e9d09c3d8d93d2ca1b63e0169e79b7874964631"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gRGxNtEepjC93CxegOWTtgdZGjoihlUN22xwY55i0Bt4I4T+mYM7rh+y4eSmKGI0uTr3gDu8stLi6lFdsXtMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:40:53.105025Z","bundle_sha256":"b9214f7a29756cbbd5f19343412195fd8b6db299a76cf3b48b96ce6cd284f473"}}