{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G6OPQ3DS2ONJIC4B65PUO4HS33","short_pith_number":"pith:G6OPQ3DS","schema_version":"1.0","canonical_sha256":"379cf86c72d39a940b81f75f4770f2dec500c0767aa59cf5ab0aa6362b77ef2a","source":{"kind":"arxiv","id":"1709.05916","version":4},"attestation_state":"computed","paper":{"title":"Coarse-grained entanglement classification through orthogonal arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Dardo Goyeneche, Karol \\.Zyczkowski, Luigi Seveso","submitted_at":"2017-09-18T13:29:54Z","abstract_excerpt":"Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in systems consisting of $N$ subsystems with an arbitrary number of internal levels each, based on properties of orthogonal arrays with $N$ columns. In particular, we investigate in detail a subset of highly entangled pure states which contains all states defining maximum distance separable codes. To illustrate the methods presented, we analyze systems of four"},"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":"1709.05916","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T13:29:54Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"647f04772de1769313b80f575dfc43715e5bc9b91f70b3e8e9eafa58bb0183af","abstract_canon_sha256":"e6330947b98d41d65193e4094ad4224a2aa798512f5b4c9eb3b21516878b0c26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:15.924325Z","signature_b64":"SgxyKU9n2hW/+LNPQ0tlX3nUCXeAOat0aSeHfygVObbjR3oBYyIF+MTS8hDQpw+Q+5jYzA2IgxwMUbFhvzs3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"379cf86c72d39a940b81f75f4770f2dec500c0767aa59cf5ab0aa6362b77ef2a","last_reissued_at":"2026-05-18T00:08:15.923858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:15.923858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coarse-grained entanglement classification through orthogonal arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Dardo Goyeneche, Karol \\.Zyczkowski, Luigi Seveso","submitted_at":"2017-09-18T13:29:54Z","abstract_excerpt":"Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in systems consisting of $N$ subsystems with an arbitrary number of internal levels each, based on properties of orthogonal arrays with $N$ columns. In particular, we investigate in detail a subset of highly entangled pure states which contains all states defining maximum distance separable codes. To illustrate the methods presented, we analyze systems of four"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05916","kind":"arxiv","version":4},"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":"1709.05916","created_at":"2026-05-18T00:08:15.923927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05916v4","created_at":"2026-05-18T00:08:15.923927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05916","created_at":"2026-05-18T00:08:15.923927+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6OPQ3DS2ONJ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6OPQ3DS2ONJIC4B","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6OPQ3DS","created_at":"2026-05-18T12:31:15.632608+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/G6OPQ3DS2ONJIC4B65PUO4HS33","json":"https://pith.science/pith/G6OPQ3DS2ONJIC4B65PUO4HS33.json","graph_json":"https://pith.science/api/pith-number/G6OPQ3DS2ONJIC4B65PUO4HS33/graph.json","events_json":"https://pith.science/api/pith-number/G6OPQ3DS2ONJIC4B65PUO4HS33/events.json","paper":"https://pith.science/paper/G6OPQ3DS"},"agent_actions":{"view_html":"https://pith.science/pith/G6OPQ3DS2ONJIC4B65PUO4HS33","download_json":"https://pith.science/pith/G6OPQ3DS2ONJIC4B65PUO4HS33.json","view_paper":"https://pith.science/paper/G6OPQ3DS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05916&json=true","fetch_graph":"https://pith.science/api/pith-number/G6OPQ3DS2ONJIC4B65PUO4HS33/graph.json","fetch_events":"https://pith.science/api/pith-number/G6OPQ3DS2ONJIC4B65PUO4HS33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6OPQ3DS2ONJIC4B65PUO4HS33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6OPQ3DS2ONJIC4B65PUO4HS33/action/storage_attestation","attest_author":"https://pith.science/pith/G6OPQ3DS2ONJIC4B65PUO4HS33/action/author_attestation","sign_citation":"https://pith.science/pith/G6OPQ3DS2ONJIC4B65PUO4HS33/action/citation_signature","submit_replication":"https://pith.science/pith/G6OPQ3DS2ONJIC4B65PUO4HS33/action/replication_record"}},"created_at":"2026-05-18T00:08:15.923927+00:00","updated_at":"2026-05-18T00:08:15.923927+00:00"}