{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZSQY5N54IPW4LMNLA3MXFYEEJ3","short_pith_number":"pith:ZSQY5N54","schema_version":"1.0","canonical_sha256":"cca18eb7bc43edc5b1ab06d972e0844efeb7272627838fae84d136838eabd2b4","source":{"kind":"arxiv","id":"1703.00429","version":2},"attestation_state":"computed","paper":{"title":"Multipartite entanglement detection for hypergraph states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chiara Macchiavello, Dagmar Bru{\\ss}, Daniele Malpetti, Maddalena Ghio, Matteo Rossi","submitted_at":"2017-03-01T18:24:12Z","abstract_excerpt":"We study the entanglement properties of quantum hypergraph states of $n$ qubits, focusing on multipartite entanglement. We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for hypergraph states endowed with all possible hyperedges of cardinality equal to $n-1$ and for those hypergraph states with all possible hyperedges of cardinality greater than or equal to $n-1$. We then find a lower bound to the multipartite entanglement of a generic quantum hypergraph state. We finally apply the multipartite entanglement results to the construction of"},"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":"1703.00429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-01T18:24:12Z","cross_cats_sorted":[],"title_canon_sha256":"4213b48c9184deb3af71eabbf980cbeaff9727c34040cefe0e93c254f14ac2ff","abstract_canon_sha256":"36a7c8eb1c9924155a8779d87b5ec56e8ad6c0858089f2dcb9f724c3063a54c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:00.988115Z","signature_b64":"BzY9pW5OZNamlGF75ttwIGZ23cSlS7v83UnUNuRgA82X+K/WOh/UswUhS0IxgWjNzIl8u8hS3PktKLLjMB6ZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cca18eb7bc43edc5b1ab06d972e0844efeb7272627838fae84d136838eabd2b4","last_reissued_at":"2026-05-18T00:26:00.987374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:00.987374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multipartite entanglement detection for hypergraph states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chiara Macchiavello, Dagmar Bru{\\ss}, Daniele Malpetti, Maddalena Ghio, Matteo Rossi","submitted_at":"2017-03-01T18:24:12Z","abstract_excerpt":"We study the entanglement properties of quantum hypergraph states of $n$ qubits, focusing on multipartite entanglement. We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for hypergraph states endowed with all possible hyperedges of cardinality equal to $n-1$ and for those hypergraph states with all possible hyperedges of cardinality greater than or equal to $n-1$. We then find a lower bound to the multipartite entanglement of a generic quantum hypergraph state. We finally apply the multipartite entanglement results to the construction of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00429","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":"1703.00429","created_at":"2026-05-18T00:26:00.987499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00429v2","created_at":"2026-05-18T00:26:00.987499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00429","created_at":"2026-05-18T00:26:00.987499+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSQY5N54IPW4","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSQY5N54IPW4LMNL","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSQY5N54","created_at":"2026-05-18T12:31:59.375834+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/ZSQY5N54IPW4LMNLA3MXFYEEJ3","json":"https://pith.science/pith/ZSQY5N54IPW4LMNLA3MXFYEEJ3.json","graph_json":"https://pith.science/api/pith-number/ZSQY5N54IPW4LMNLA3MXFYEEJ3/graph.json","events_json":"https://pith.science/api/pith-number/ZSQY5N54IPW4LMNLA3MXFYEEJ3/events.json","paper":"https://pith.science/paper/ZSQY5N54"},"agent_actions":{"view_html":"https://pith.science/pith/ZSQY5N54IPW4LMNLA3MXFYEEJ3","download_json":"https://pith.science/pith/ZSQY5N54IPW4LMNLA3MXFYEEJ3.json","view_paper":"https://pith.science/paper/ZSQY5N54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00429&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSQY5N54IPW4LMNLA3MXFYEEJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSQY5N54IPW4LMNLA3MXFYEEJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSQY5N54IPW4LMNLA3MXFYEEJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSQY5N54IPW4LMNLA3MXFYEEJ3/action/storage_attestation","attest_author":"https://pith.science/pith/ZSQY5N54IPW4LMNLA3MXFYEEJ3/action/author_attestation","sign_citation":"https://pith.science/pith/ZSQY5N54IPW4LMNLA3MXFYEEJ3/action/citation_signature","submit_replication":"https://pith.science/pith/ZSQY5N54IPW4LMNLA3MXFYEEJ3/action/replication_record"}},"created_at":"2026-05-18T00:26:00.987499+00:00","updated_at":"2026-05-18T00:26:00.987499+00:00"}