{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:6QP7JYAVODMUIGFHFVPNDOS4TV","short_pith_number":"pith:6QP7JYAV","schema_version":"1.0","canonical_sha256":"f41ff4e01570d94418a72d5ed1ba5c9d64a848fbf8de8638801f054f177614b6","source":{"kind":"arxiv","id":"0705.2561","version":2},"attestation_state":"computed","paper":{"title":"The tripartite separability of density matrices of graphs","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Zhen Wang, Zhixi Wang","submitted_at":"2007-05-17T16:30:19Z","abstract_excerpt":"The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein {\\it et al.} Annals of Combinatorics, {\\bf 10}(2006)291 to tripartite states. Then we proved that the degree condition defined in Braunstein {\\it et al.} Phys. Rev. A {\\bf 73}, (2006)012320 is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph."},"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":"0705.2561","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-05-17T16:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"ab8f241f790d4b1bb252e3a03994c64d0088f82c2a0dac6672607a81e6b47773","abstract_canon_sha256":"9d11e3c2aa7e1bbf4c977500eae936ab9117b7ffc56e01de2c68d8a8f60a0571"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:04.467161Z","signature_b64":"iK8Pzelq6r3M93fZGmamAbG5EgrlTTqylsqZwXqRL+sE8NoCXOQx5BluWpqgjyAJuA2HE1aL8XYdI+wm7EznAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f41ff4e01570d94418a72d5ed1ba5c9d64a848fbf8de8638801f054f177614b6","last_reissued_at":"2026-05-18T04:24:04.466551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:04.466551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The tripartite separability of density matrices of graphs","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Zhen Wang, Zhixi Wang","submitted_at":"2007-05-17T16:30:19Z","abstract_excerpt":"The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein {\\it et al.} Annals of Combinatorics, {\\bf 10}(2006)291 to tripartite states. Then we proved that the degree condition defined in Braunstein {\\it et al.} Phys. Rev. A {\\bf 73}, (2006)012320 is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.2561","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":"0705.2561","created_at":"2026-05-18T04:24:04.466661+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.2561v2","created_at":"2026-05-18T04:24:04.466661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.2561","created_at":"2026-05-18T04:24:04.466661+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QP7JYAVODMU","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QP7JYAVODMUIGFH","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QP7JYAV","created_at":"2026-05-18T12:25:55.427421+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/6QP7JYAVODMUIGFHFVPNDOS4TV","json":"https://pith.science/pith/6QP7JYAVODMUIGFHFVPNDOS4TV.json","graph_json":"https://pith.science/api/pith-number/6QP7JYAVODMUIGFHFVPNDOS4TV/graph.json","events_json":"https://pith.science/api/pith-number/6QP7JYAVODMUIGFHFVPNDOS4TV/events.json","paper":"https://pith.science/paper/6QP7JYAV"},"agent_actions":{"view_html":"https://pith.science/pith/6QP7JYAVODMUIGFHFVPNDOS4TV","download_json":"https://pith.science/pith/6QP7JYAVODMUIGFHFVPNDOS4TV.json","view_paper":"https://pith.science/paper/6QP7JYAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.2561&json=true","fetch_graph":"https://pith.science/api/pith-number/6QP7JYAVODMUIGFHFVPNDOS4TV/graph.json","fetch_events":"https://pith.science/api/pith-number/6QP7JYAVODMUIGFHFVPNDOS4TV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QP7JYAVODMUIGFHFVPNDOS4TV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QP7JYAVODMUIGFHFVPNDOS4TV/action/storage_attestation","attest_author":"https://pith.science/pith/6QP7JYAVODMUIGFHFVPNDOS4TV/action/author_attestation","sign_citation":"https://pith.science/pith/6QP7JYAVODMUIGFHFVPNDOS4TV/action/citation_signature","submit_replication":"https://pith.science/pith/6QP7JYAVODMUIGFHFVPNDOS4TV/action/replication_record"}},"created_at":"2026-05-18T04:24:04.466661+00:00","updated_at":"2026-05-18T04:24:04.466661+00:00"}