{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SLCEUOLAZXKUAZD7EHUOORGD7X","short_pith_number":"pith:SLCEUOLA","canonical_record":{"source":{"id":"2606.07110","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-05T10:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"91351a055ec3bf19cb6b7e61afdf303fd465dedad491d2cee95f0ac23a7f023b","abstract_canon_sha256":"4696a81981bc6370d05e0d30480162e4a030984f9d3674a590a731ef72cd11bb"},"schema_version":"1.0"},"canonical_sha256":"92c44a3960cdd540647f21e8e744c3fdfed32313f4faaa2fb7211773132fabc7","source":{"kind":"arxiv","id":"2606.07110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.07110","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.07110v1","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07110","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"SLCEUOLAZXKU","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"SLCEUOLAZXKUAZD7","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"SLCEUOLA","created_at":"2026-06-08T01:04:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SLCEUOLAZXKUAZD7EHUOORGD7X","target":"record","payload":{"canonical_record":{"source":{"id":"2606.07110","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-05T10:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"91351a055ec3bf19cb6b7e61afdf303fd465dedad491d2cee95f0ac23a7f023b","abstract_canon_sha256":"4696a81981bc6370d05e0d30480162e4a030984f9d3674a590a731ef72cd11bb"},"schema_version":"1.0"},"canonical_sha256":"92c44a3960cdd540647f21e8e744c3fdfed32313f4faaa2fb7211773132fabc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:46.884350Z","signature_b64":"jPg6yBqVzI0sOCG2ZAqNXyksNtYlezT7QNFLffW3oBosa6yON/8tUrYvP4G/slfPh1ZVvd2QOnUwo8vvC8HkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92c44a3960cdd540647f21e8e744c3fdfed32313f4faaa2fb7211773132fabc7","last_reissued_at":"2026-06-08T01:04:46.883594Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:46.883594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.07110","source_version":1,"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-06-08T01:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SaG/pRPifwoTqib7H53NywAUTDba9V+Dl0Cm41UemH3s5LU4aWgiijJbfKg25+oQNZupCEyfIYxteqyF1VrhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:54:39.448889Z"},"content_sha256":"71ad7a1679df706317f0cdd7e189c62291c83aafad9e3d642906ddcf5b392fd2","schema_version":"1.0","event_id":"sha256:71ad7a1679df706317f0cdd7e189c62291c83aafad9e3d642906ddcf5b392fd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SLCEUOLAZXKUAZD7EHUOORGD7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entanglement from Expansion: High Rank-Width in Deterministic Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Cyril Gavoille, Simon Martiel, Tristan Cam, Yvan Le Borgne","submitted_at":"2026-06-05T10:04:54Z","abstract_excerpt":"Entanglement in quantum graph states is intrinsically linked to rank-width, a graph complexity measure introduced by Oum and Seymour. In this work, we enable the preparation of maximally entangled deterministic graph states in constant depth by developing a general method to derive lower bounds on the rank-width of regular graphs from their edge expansion. By bridging edge-isoperimetric inequalities with the strong chromatic index and Jel\\'inek's approach for lower bounding cut-rank, we systematically establish lower bounds for the rank-width of Cartesian products, including hypercubes, Hammin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07110","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.07110/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"},"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-06-08T01:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlWfUSmRsbkfQ7va1cQhRsUs5L7fzxfwmPsA0modA1WabPpkwIh0uGrr+KqHugeV2jaB317yD81VYSqGLElPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:54:39.449253Z"},"content_sha256":"e659f3a315086712dd5df83aefcbcc7cc356c875056088240fc5fc0474d0c5bb","schema_version":"1.0","event_id":"sha256:e659f3a315086712dd5df83aefcbcc7cc356c875056088240fc5fc0474d0c5bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLCEUOLAZXKUAZD7EHUOORGD7X/bundle.json","state_url":"https://pith.science/pith/SLCEUOLAZXKUAZD7EHUOORGD7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLCEUOLAZXKUAZD7EHUOORGD7X/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-06-28T06:54:39Z","links":{"resolver":"https://pith.science/pith/SLCEUOLAZXKUAZD7EHUOORGD7X","bundle":"https://pith.science/pith/SLCEUOLAZXKUAZD7EHUOORGD7X/bundle.json","state":"https://pith.science/pith/SLCEUOLAZXKUAZD7EHUOORGD7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLCEUOLAZXKUAZD7EHUOORGD7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SLCEUOLAZXKUAZD7EHUOORGD7X","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":"4696a81981bc6370d05e0d30480162e4a030984f9d3674a590a731ef72cd11bb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-05T10:04:54Z","title_canon_sha256":"91351a055ec3bf19cb6b7e61afdf303fd465dedad491d2cee95f0ac23a7f023b"},"schema_version":"1.0","source":{"id":"2606.07110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.07110","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.07110v1","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07110","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"SLCEUOLAZXKU","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"SLCEUOLAZXKUAZD7","created_at":"2026-06-08T01:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"SLCEUOLA","created_at":"2026-06-08T01:04:46Z"}],"graph_snapshots":[{"event_id":"sha256:e659f3a315086712dd5df83aefcbcc7cc356c875056088240fc5fc0474d0c5bb","target":"graph","created_at":"2026-06-08T01:04:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.07110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Entanglement in quantum graph states is intrinsically linked to rank-width, a graph complexity measure introduced by Oum and Seymour. In this work, we enable the preparation of maximally entangled deterministic graph states in constant depth by developing a general method to derive lower bounds on the rank-width of regular graphs from their edge expansion. By bridging edge-isoperimetric inequalities with the strong chromatic index and Jel\\'inek's approach for lower bounding cut-rank, we systematically establish lower bounds for the rank-width of Cartesian products, including hypercubes, Hammin","authors_text":"Cyril Gavoille, Simon Martiel, Tristan Cam, Yvan Le Borgne","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-05T10:04:54Z","title":"Entanglement from Expansion: High Rank-Width in Deterministic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07110","kind":"arxiv","version":1},"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:71ad7a1679df706317f0cdd7e189c62291c83aafad9e3d642906ddcf5b392fd2","target":"record","created_at":"2026-06-08T01:04:46Z","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":"4696a81981bc6370d05e0d30480162e4a030984f9d3674a590a731ef72cd11bb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-05T10:04:54Z","title_canon_sha256":"91351a055ec3bf19cb6b7e61afdf303fd465dedad491d2cee95f0ac23a7f023b"},"schema_version":"1.0","source":{"id":"2606.07110","kind":"arxiv","version":1}},"canonical_sha256":"92c44a3960cdd540647f21e8e744c3fdfed32313f4faaa2fb7211773132fabc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92c44a3960cdd540647f21e8e744c3fdfed32313f4faaa2fb7211773132fabc7","first_computed_at":"2026-06-08T01:04:46.883594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:04:46.883594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jPg6yBqVzI0sOCG2ZAqNXyksNtYlezT7QNFLffW3oBosa6yON/8tUrYvP4G/slfPh1ZVvd2QOnUwo8vvC8HkAw==","signature_status":"signed_v1","signed_at":"2026-06-08T01:04:46.884350Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.07110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71ad7a1679df706317f0cdd7e189c62291c83aafad9e3d642906ddcf5b392fd2","sha256:e659f3a315086712dd5df83aefcbcc7cc356c875056088240fc5fc0474d0c5bb"],"state_sha256":"48635f56a4dd2e7d6284107e11384d3d73b44e6cb2e5a034e61b0dfac444b25f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rifChyvZqtS8IhnuONa7u3ecoLp6LnowAfUSZghAqZLPPMmvprYEgmb4TjacglIqKKHpJ2+8hQNkZis16PXnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T06:54:39.451260Z","bundle_sha256":"b0983f934e51c5fc930283da20c4790a70af99c3e0c86cd57f5e7c7344727576"}}