{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AOGZTM5O337KLNOOE67KMZ7DYG","short_pith_number":"pith:AOGZTM5O","schema_version":"1.0","canonical_sha256":"038d99b3aedefea5b5ce27bea667e3c1b5732f95f572862d5bd574753ad29c0d","source":{"kind":"arxiv","id":"1411.7380","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.7380","created_at":"2026-05-18T01:16:53.404982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7380v2","created_at":"2026-05-18T01:16:53.404982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7380","created_at":"2026-05-18T01:16:53.404982+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOGZTM5O337K","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOGZTM5O337KLNOO","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOGZTM5O","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG","json":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG.json","graph_json":"https://pith.science/api/pith-number/AOGZTM5O337KLNOOE67KMZ7DYG/graph.json","events_json":"https://pith.science/api/pith-number/AOGZTM5O337KLNOOE67KMZ7DYG/events.json","paper":"https://pith.science/paper/AOGZTM5O"},"agent_actions":{"view_html":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG","download_json":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG.json","view_paper":"https://pith.science/paper/AOGZTM5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7380&json=true","fetch_graph":"https://pith.science/api/pith-number/AOGZTM5O337KLNOOE67KMZ7DYG/graph.json","fetch_events":"https://pith.science/api/pith-number/AOGZTM5O337KLNOOE67KMZ7DYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG/action/storage_attestation","attest_author":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG/action/author_attestation","sign_citation":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG/action/citation_signature","submit_replication":"https://pith.science/pith/AOGZTM5O337KLNOOE67KMZ7DYG/action/replication_record"}},"created_at":"2026-05-18T01:16:53.404982+00:00","updated_at":"2026-05-18T01:16:53.404982+00:00"}