{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BXXSKOY7KAQDIEN5YAAJA2ZAYX","short_pith_number":"pith:BXXSKOY7","schema_version":"1.0","canonical_sha256":"0def253b1f50203411bdc000906b20c5da5f556410db2653c3f8110d71628d46","source":{"kind":"arxiv","id":"2406.13452","version":2},"attestation_state":"computed","paper":{"title":"Multipartite Entanglement Routing as a Hypergraph Immersion Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","physics.comp-ph","physics.soc-ph"],"primary_cat":"quant-ph","authors_text":"Xiangyi Meng, Yuefei Liu, Yu Tian","submitted_at":"2024-06-19T11:21:00Z","abstract_excerpt":"Multipartite entanglement, linking multiple nodes simultaneously, is a higher-order correlation that offers advantages over pairwise connections in quantum networks (QNs). Creating reliable, large-scale multipartite entanglement requires entanglement routing, a process that combines local, short-distance connections into a long-distance connection, which can be considered as a transformation of network topology. Here, we address the question of whether a QN can be topologically transformed into another via entanglement routing. Our key result is an exact mapping from multipartite entanglement "},"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":"2406.13452","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-06-19T11:21:00Z","cross_cats_sorted":["cs.DM","cs.SI","physics.comp-ph","physics.soc-ph"],"title_canon_sha256":"3c922ceebf939583520267c881e453f5ebae4aa8b68bd5825d43e1006b5ab43b","abstract_canon_sha256":"4dc972169ae3ce5fe71c47a67c8020bbed77bb420976358053b7a2bd3547c3a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:33.752537Z","signature_b64":"nRsqHLS9h9iWF+oVAvZTsClW536SB7NiybVDHTnQkO72PFNSfRvL+lCMayX8yGwCmJvmrhezwlljuxKSvDYQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0def253b1f50203411bdc000906b20c5da5f556410db2653c3f8110d71628d46","last_reissued_at":"2026-07-05T09:51:33.752038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:33.752038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multipartite Entanglement Routing as a Hypergraph Immersion Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","physics.comp-ph","physics.soc-ph"],"primary_cat":"quant-ph","authors_text":"Xiangyi Meng, Yuefei Liu, Yu Tian","submitted_at":"2024-06-19T11:21:00Z","abstract_excerpt":"Multipartite entanglement, linking multiple nodes simultaneously, is a higher-order correlation that offers advantages over pairwise connections in quantum networks (QNs). Creating reliable, large-scale multipartite entanglement requires entanglement routing, a process that combines local, short-distance connections into a long-distance connection, which can be considered as a transformation of network topology. Here, we address the question of whether a QN can be topologically transformed into another via entanglement routing. Our key result is an exact mapping from multipartite entanglement "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13452","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.13452/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.13452","created_at":"2026-07-05T09:51:33.752105+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.13452v2","created_at":"2026-07-05T09:51:33.752105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13452","created_at":"2026-07-05T09:51:33.752105+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXXSKOY7KAQD","created_at":"2026-07-05T09:51:33.752105+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXXSKOY7KAQDIEN5","created_at":"2026-07-05T09:51:33.752105+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXXSKOY7","created_at":"2026-07-05T09:51:33.752105+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16017","citing_title":"Finding hypergraph immersion is fixed-parameter tractable","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BXXSKOY7KAQDIEN5YAAJA2ZAYX","json":"https://pith.science/pith/BXXSKOY7KAQDIEN5YAAJA2ZAYX.json","graph_json":"https://pith.science/api/pith-number/BXXSKOY7KAQDIEN5YAAJA2ZAYX/graph.json","events_json":"https://pith.science/api/pith-number/BXXSKOY7KAQDIEN5YAAJA2ZAYX/events.json","paper":"https://pith.science/paper/BXXSKOY7"},"agent_actions":{"view_html":"https://pith.science/pith/BXXSKOY7KAQDIEN5YAAJA2ZAYX","download_json":"https://pith.science/pith/BXXSKOY7KAQDIEN5YAAJA2ZAYX.json","view_paper":"https://pith.science/paper/BXXSKOY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.13452&json=true","fetch_graph":"https://pith.science/api/pith-number/BXXSKOY7KAQDIEN5YAAJA2ZAYX/graph.json","fetch_events":"https://pith.science/api/pith-number/BXXSKOY7KAQDIEN5YAAJA2ZAYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXXSKOY7KAQDIEN5YAAJA2ZAYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXXSKOY7KAQDIEN5YAAJA2ZAYX/action/storage_attestation","attest_author":"https://pith.science/pith/BXXSKOY7KAQDIEN5YAAJA2ZAYX/action/author_attestation","sign_citation":"https://pith.science/pith/BXXSKOY7KAQDIEN5YAAJA2ZAYX/action/citation_signature","submit_replication":"https://pith.science/pith/BXXSKOY7KAQDIEN5YAAJA2ZAYX/action/replication_record"}},"created_at":"2026-07-05T09:51:33.752105+00:00","updated_at":"2026-07-05T09:51:33.752105+00:00"}