{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AOGZTM5O337KLNOOE67KMZ7DYG","short_pith_number":"pith:AOGZTM5O","canonical_record":{"source":{"id":"1411.7380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-26T21:00:05Z","cross_cats_sorted":["math-ph","math.MP","quant-ph"],"title_canon_sha256":"191b90779011056e5f7c8a01c8b71f23a9f556c508cbd832a931df564d13086f","abstract_canon_sha256":"34ace49db3960dbb39d10ec2a9d8b7bdc9f4180bc8f0e02535268dd261b114bc"},"schema_version":"1.0"},"canonical_sha256":"038d99b3aedefea5b5ce27bea667e3c1b5732f95f572862d5bd574753ad29c0d","source":{"kind":"arxiv","id":"1411.7380","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7380","created_at":"2026-05-18T01:16:53Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7380v2","created_at":"2026-05-18T01:16:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7380","created_at":"2026-05-18T01:16:53Z"},{"alias_kind":"pith_short_12","alias_value":"AOGZTM5O337K","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AOGZTM5O337KLNOO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AOGZTM5O","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AOGZTM5O337KLNOOE67KMZ7DYG","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-26T21:00:05Z","cross_cats_sorted":["math-ph","math.MP","quant-ph"],"title_canon_sha256":"191b90779011056e5f7c8a01c8b71f23a9f556c508cbd832a931df564d13086f","abstract_canon_sha256":"34ace49db3960dbb39d10ec2a9d8b7bdc9f4180bc8f0e02535268dd261b114bc"},"schema_version":"1.0"},"canonical_sha256":"038d99b3aedefea5b5ce27bea667e3c1b5732f95f572862d5bd574753ad29c0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:53.405634Z","signature_b64":"WN/WmPfo8+wZuvFetioQ42krpknlTTC+TRARx+r9p6hzgwbaJjdlzmxxscvGMoHuzgHfy2rB7Q7fcLyLjj6ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"038d99b3aedefea5b5ce27bea667e3c1b5732f95f572862d5bd574753ad29c0d","last_reissued_at":"2026-05-18T01:16:53.404870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:53.404870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7380","source_version":2,"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-18T01:16:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jswcjtaEFUlqzH3wQABarlEyCKCRKfUeTO6/Vp8koijlnvLZV5B7ZejKaGSg+o2yxhWS2Kn39MAENg6eQLO8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T07:31:11.794911Z"},"content_sha256":"57eddd128918bef341a17ae70e46a729603ff2e060c36d93af5ce991f1e0699f","schema_version":"1.0","event_id":"sha256:57eddd128918bef341a17ae70e46a729603ff2e060c36d93af5ce991f1e0699f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AOGZTM5O337KLNOOE67KMZ7DYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Divisibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","quant-ph"],"primary_cat":"math.PR","authors_text":"Johannes Bausch, Toby Cubitt","submitted_at":"2014-11-26T21:00:05Z","abstract_excerpt":"We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic maps is an NP-complete problem, and extend this result to nonnegative matrices, and completely-positive trace-preserving maps, i.e. the quantum analogue of stochastic maps. We further prove a complexity hierarchy for the divisibility and decomposability of probability distributions, showing that finite distribution divisibility is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7380","kind":"arxiv","version":2},"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-18T01:16:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25BoX7E0zygc355UVpSRbKXjkjLWRv884xZ89P0JoU610/3C06+hGiO6SFsxzJStqLXrJASn1+uj5yq7GYZ5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T07:31:11.795294Z"},"content_sha256":"7c7b83512544d8fa7aa0247fc7b7f8c26e07c66b7166b8d03cd18d45e4e42022","schema_version":"1.0","event_id":"sha256:7c7b83512544d8fa7aa0247fc7b7f8c26e07c66b7166b8d03cd18d45e4e42022"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG/bundle.json","state_url":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOGZTM5O337KLNOOE67KMZ7DYG/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-23T07:31:11Z","links":{"resolver":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG","bundle":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG/bundle.json","state":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOGZTM5O337KLNOOE67KMZ7DYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AOGZTM5O337KLNOOE67KMZ7DYG","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":"34ace49db3960dbb39d10ec2a9d8b7bdc9f4180bc8f0e02535268dd261b114bc","cross_cats_sorted":["math-ph","math.MP","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-26T21:00:05Z","title_canon_sha256":"191b90779011056e5f7c8a01c8b71f23a9f556c508cbd832a931df564d13086f"},"schema_version":"1.0","source":{"id":"1411.7380","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7380","created_at":"2026-05-18T01:16:53Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7380v2","created_at":"2026-05-18T01:16:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7380","created_at":"2026-05-18T01:16:53Z"},{"alias_kind":"pith_short_12","alias_value":"AOGZTM5O337K","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AOGZTM5O337KLNOO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AOGZTM5O","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:7c7b83512544d8fa7aa0247fc7b7f8c26e07c66b7166b8d03cd18d45e4e42022","target":"graph","created_at":"2026-05-18T01:16:53Z","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":"We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic maps is an NP-complete problem, and extend this result to nonnegative matrices, and completely-positive trace-preserving maps, i.e. the quantum analogue of stochastic maps. We further prove a complexity hierarchy for the divisibility and decomposability of probability distributions, showing that finite distribution divisibility is","authors_text":"Johannes Bausch, Toby Cubitt","cross_cats":["math-ph","math.MP","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-26T21:00:05Z","title":"The Complexity of Divisibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7380","kind":"arxiv","version":2},"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:57eddd128918bef341a17ae70e46a729603ff2e060c36d93af5ce991f1e0699f","target":"record","created_at":"2026-05-18T01:16:53Z","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":"34ace49db3960dbb39d10ec2a9d8b7bdc9f4180bc8f0e02535268dd261b114bc","cross_cats_sorted":["math-ph","math.MP","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-26T21:00:05Z","title_canon_sha256":"191b90779011056e5f7c8a01c8b71f23a9f556c508cbd832a931df564d13086f"},"schema_version":"1.0","source":{"id":"1411.7380","kind":"arxiv","version":2}},"canonical_sha256":"038d99b3aedefea5b5ce27bea667e3c1b5732f95f572862d5bd574753ad29c0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"038d99b3aedefea5b5ce27bea667e3c1b5732f95f572862d5bd574753ad29c0d","first_computed_at":"2026-05-18T01:16:53.404870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:53.404870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WN/WmPfo8+wZuvFetioQ42krpknlTTC+TRARx+r9p6hzgwbaJjdlzmxxscvGMoHuzgHfy2rB7Q7fcLyLjj6ZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:53.405634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7380","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57eddd128918bef341a17ae70e46a729603ff2e060c36d93af5ce991f1e0699f","sha256:7c7b83512544d8fa7aa0247fc7b7f8c26e07c66b7166b8d03cd18d45e4e42022"],"state_sha256":"55080cf1df64428fc478ad5d828ff0c097574e4d4fa15c55422395fc81f67dd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6FRUUdbZwY8R2HDWj6cabMJowh8xer9eamg11K5Ec1ZwqHyqV/XZ3PvglSSwhFWmI2goFHrPDLuVx0G6K2F5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T07:31:11.797979Z","bundle_sha256":"1aff8af1ad073e085b9b15d12c3457dd34c01c138468c03b4e7b6a8745c185b9"}}