{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4H44QWDQMPEBPEQPQFQRXN25MO","short_pith_number":"pith:4H44QWDQ","schema_version":"1.0","canonical_sha256":"e1f9c8587063c817920f81611bb75d639303d50eda2aca01c95847cb6d12ba18","source":{"kind":"arxiv","id":"1501.07026","version":1},"attestation_state":"computed","paper":{"title":"Heuristic for estimation of multiqubit genuine multipartite entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gerard J. Milburn, Marcelo A. Marchiolli, Paulo E. M. F. Mendonca","submitted_at":"2015-01-28T08:35:28Z","abstract_excerpt":"For every N-qubit density matrix written in the computational basis, an associated \"X-density matrix\" can be obtained by vanishing all entries out of the main- and anti-diagonals. It is very simple to compute the genuine multipartite (GM) concurrence of this associated N-qubit X-state, which, moreover, lower bounds the GM-concurrence of the original (non-X) state. In this paper, we rely on these facts to introduce and benchmark a heuristic for estimating the GM-concurrence of an arbitrary multiqubit mixed state. By explicitly considering two classes of mixed states, we illustrate that our esti"},"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":"1501.07026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-01-28T08:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"cb62b8174ef0fed4ce54dd7ed49b3b01d3cf29a1ff096cbdcd231e79a02dbb8b","abstract_canon_sha256":"4115492a3b28dcc81bf31a6bcc5c717e349e5f0a21bd35d05ce89a3e968bea8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:10.907329Z","signature_b64":"79oHi5L+Mcn7G5h0H0pfIcorF0j8d6LwiquMDMINCve/Xm+lIta7v+f7U7QF4ylZLa6kcwD9IQxstpHCzRTxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f9c8587063c817920f81611bb75d639303d50eda2aca01c95847cb6d12ba18","last_reissued_at":"2026-05-18T02:12:10.906594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:10.906594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristic for estimation of multiqubit genuine multipartite entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gerard J. Milburn, Marcelo A. Marchiolli, Paulo E. M. F. Mendonca","submitted_at":"2015-01-28T08:35:28Z","abstract_excerpt":"For every N-qubit density matrix written in the computational basis, an associated \"X-density matrix\" can be obtained by vanishing all entries out of the main- and anti-diagonals. It is very simple to compute the genuine multipartite (GM) concurrence of this associated N-qubit X-state, which, moreover, lower bounds the GM-concurrence of the original (non-X) state. In this paper, we rely on these facts to introduce and benchmark a heuristic for estimating the GM-concurrence of an arbitrary multiqubit mixed state. By explicitly considering two classes of mixed states, we illustrate that our esti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07026","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":""},"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":"1501.07026","created_at":"2026-05-18T02:12:10.906722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07026v1","created_at":"2026-05-18T02:12:10.906722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07026","created_at":"2026-05-18T02:12:10.906722+00:00"},{"alias_kind":"pith_short_12","alias_value":"4H44QWDQMPEB","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4H44QWDQMPEBPEQP","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4H44QWDQ","created_at":"2026-05-18T12:29:05.191682+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/4H44QWDQMPEBPEQPQFQRXN25MO","json":"https://pith.science/pith/4H44QWDQMPEBPEQPQFQRXN25MO.json","graph_json":"https://pith.science/api/pith-number/4H44QWDQMPEBPEQPQFQRXN25MO/graph.json","events_json":"https://pith.science/api/pith-number/4H44QWDQMPEBPEQPQFQRXN25MO/events.json","paper":"https://pith.science/paper/4H44QWDQ"},"agent_actions":{"view_html":"https://pith.science/pith/4H44QWDQMPEBPEQPQFQRXN25MO","download_json":"https://pith.science/pith/4H44QWDQMPEBPEQPQFQRXN25MO.json","view_paper":"https://pith.science/paper/4H44QWDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07026&json=true","fetch_graph":"https://pith.science/api/pith-number/4H44QWDQMPEBPEQPQFQRXN25MO/graph.json","fetch_events":"https://pith.science/api/pith-number/4H44QWDQMPEBPEQPQFQRXN25MO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4H44QWDQMPEBPEQPQFQRXN25MO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4H44QWDQMPEBPEQPQFQRXN25MO/action/storage_attestation","attest_author":"https://pith.science/pith/4H44QWDQMPEBPEQPQFQRXN25MO/action/author_attestation","sign_citation":"https://pith.science/pith/4H44QWDQMPEBPEQPQFQRXN25MO/action/citation_signature","submit_replication":"https://pith.science/pith/4H44QWDQMPEBPEQPQFQRXN25MO/action/replication_record"}},"created_at":"2026-05-18T02:12:10.906722+00:00","updated_at":"2026-05-18T02:12:10.906722+00:00"}