{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FK5QZW6NSSAIDEWLEVMEWBR3FS","short_pith_number":"pith:FK5QZW6N","canonical_record":{"source":{"id":"1705.00006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-28T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"1c4b1d957a1b94dd6c4a49a751c42f8124cc63226405063dbba58e1aaac46fe5","abstract_canon_sha256":"2bdce84210aa3d2e46ad14dad2c95324a1db48ed6d47813a960d48215c6089f4"},"schema_version":"1.0"},"canonical_sha256":"2abb0cdbcd94808192cb25584b063b2c9fbb4eab8dd71909cf096345f557de9e","source":{"kind":"arxiv","id":"1705.00006","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00006","created_at":"2026-05-18T00:34:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00006v2","created_at":"2026-05-18T00:34:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00006","created_at":"2026-05-18T00:34:41Z"},{"alias_kind":"pith_short_12","alias_value":"FK5QZW6NSSAI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FK5QZW6NSSAIDEWL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FK5QZW6N","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FK5QZW6NSSAIDEWLEVMEWBR3FS","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-28T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"1c4b1d957a1b94dd6c4a49a751c42f8124cc63226405063dbba58e1aaac46fe5","abstract_canon_sha256":"2bdce84210aa3d2e46ad14dad2c95324a1db48ed6d47813a960d48215c6089f4"},"schema_version":"1.0"},"canonical_sha256":"2abb0cdbcd94808192cb25584b063b2c9fbb4eab8dd71909cf096345f557de9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:41.610108Z","signature_b64":"eoWNbFzLi415cfb3rYOY1rYHaad9hh1ilHEMGXhoGOhNmaXP2ToDl3MxRCidZfmzZkevvP+jFNKxbLleW8iSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2abb0cdbcd94808192cb25584b063b2c9fbb4eab8dd71909cf096345f557de9e","last_reissued_at":"2026-05-18T00:34:41.609250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:41.609250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00006","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUJ5gsI1exThjhiO/NDalzdnMngClEqIxEtzU3eXWg4N/A914plQd1/hEY7xW78FboeUrJsytovQ1IXdspudBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:44:07.802360Z"},"content_sha256":"0091d44e6528dde6d4dd0a88ba74117ff2fe06eaa21cc07f8d8ad92e9355b4bd","schema_version":"1.0","event_id":"sha256:0091d44e6528dde6d4dd0a88ba74117ff2fe06eaa21cc07f8d8ad92e9355b4bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FK5QZW6NSSAIDEWLEVMEWBR3FS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-associated entanglement cost of a multipartite state in exact and finite-block-length approximate constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akihito Soeda, Hayata Yamasaki, Mio Murao","submitted_at":"2017-04-28T18:00:00Z","abstract_excerpt":"We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be constructible when quantum communication between the multiple parties is restricted to a quantum network represented by a tree. The condition for exact state construction is expressed in terms of the Schmidt ranks of the state defined with respect to edges of the tree. We also study approximate state construction and provide a second-order asymptotic analysis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00006","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6E5vPVMd9Zz80614woP+M/jAvbQP1+aqB1msoEBK6dN33FoOy9dpcElOI3lk1LZhO00Nbq7uHImqYc8kywHRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:44:07.802717Z"},"content_sha256":"815339c8c26f518e9d0e1dfef78a121104540a8841f01e11876ba68e03612ae0","schema_version":"1.0","event_id":"sha256:815339c8c26f518e9d0e1dfef78a121104540a8841f01e11876ba68e03612ae0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FK5QZW6NSSAIDEWLEVMEWBR3FS/bundle.json","state_url":"https://pith.science/pith/FK5QZW6NSSAIDEWLEVMEWBR3FS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FK5QZW6NSSAIDEWLEVMEWBR3FS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T10:44:07Z","links":{"resolver":"https://pith.science/pith/FK5QZW6NSSAIDEWLEVMEWBR3FS","bundle":"https://pith.science/pith/FK5QZW6NSSAIDEWLEVMEWBR3FS/bundle.json","state":"https://pith.science/pith/FK5QZW6NSSAIDEWLEVMEWBR3FS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FK5QZW6NSSAIDEWLEVMEWBR3FS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FK5QZW6NSSAIDEWLEVMEWBR3FS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2bdce84210aa3d2e46ad14dad2c95324a1db48ed6d47813a960d48215c6089f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-28T18:00:00Z","title_canon_sha256":"1c4b1d957a1b94dd6c4a49a751c42f8124cc63226405063dbba58e1aaac46fe5"},"schema_version":"1.0","source":{"id":"1705.00006","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00006","created_at":"2026-05-18T00:34:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00006v2","created_at":"2026-05-18T00:34:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00006","created_at":"2026-05-18T00:34:41Z"},{"alias_kind":"pith_short_12","alias_value":"FK5QZW6NSSAI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FK5QZW6NSSAIDEWL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FK5QZW6N","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:815339c8c26f518e9d0e1dfef78a121104540a8841f01e11876ba68e03612ae0","target":"graph","created_at":"2026-05-18T00:34:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be constructible when quantum communication between the multiple parties is restricted to a quantum network represented by a tree. The condition for exact state construction is expressed in terms of the Schmidt ranks of the state defined with respect to edges of the tree. We also study approximate state construction and provide a second-order asymptotic analysis","authors_text":"Akihito Soeda, Hayata Yamasaki, Mio Murao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-28T18:00:00Z","title":"Graph-associated entanglement cost of a multipartite state in exact and finite-block-length approximate constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00006","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0091d44e6528dde6d4dd0a88ba74117ff2fe06eaa21cc07f8d8ad92e9355b4bd","target":"record","created_at":"2026-05-18T00:34:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2bdce84210aa3d2e46ad14dad2c95324a1db48ed6d47813a960d48215c6089f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-28T18:00:00Z","title_canon_sha256":"1c4b1d957a1b94dd6c4a49a751c42f8124cc63226405063dbba58e1aaac46fe5"},"schema_version":"1.0","source":{"id":"1705.00006","kind":"arxiv","version":2}},"canonical_sha256":"2abb0cdbcd94808192cb25584b063b2c9fbb4eab8dd71909cf096345f557de9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2abb0cdbcd94808192cb25584b063b2c9fbb4eab8dd71909cf096345f557de9e","first_computed_at":"2026-05-18T00:34:41.609250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:41.609250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eoWNbFzLi415cfb3rYOY1rYHaad9hh1ilHEMGXhoGOhNmaXP2ToDl3MxRCidZfmzZkevvP+jFNKxbLleW8iSAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:41.610108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00006","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0091d44e6528dde6d4dd0a88ba74117ff2fe06eaa21cc07f8d8ad92e9355b4bd","sha256:815339c8c26f518e9d0e1dfef78a121104540a8841f01e11876ba68e03612ae0"],"state_sha256":"9e757de2690325677c5dfe26140c83fe279c400a39875176a58a5aca49c9b129"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5oo7wTWSnuczoPD4FxESDZG399QUq8+sF/8fd/tPHZ+aGEmEJzVotim2fWFDRzH/E1gBHfjlDf5L/ya8SsjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:44:07.804728Z","bundle_sha256":"3ebd0cbf9cca21eabc6ba7da111736da2d824abf642954f36eee1251b38e60f9"}}