{"as_of":"2026-08-11T18:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e99efd5137ee7db161bc33effa98d081f2a0ff44fef55309463c11c39570895","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T10:28:06.255508Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.10615/citation-record","integrity":"/paper/2607.10615/integrity","json":"/paper/2607.10615/citation-record.json","paper":"/paper/2607.10615"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Constructions of mutually unbiased bases","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:cdb4148e860aa3e67f02bfafb893b54d3bfb4065ede0e0ddf34205b8cd2913f3","observation_id":"7828c3ca-af8e-4c7a-bb7d-fbb26862a968","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Quantum cryptography: Public key distri- bution and coin tossing","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:35bfb76e9c440bdcc638221956e749906ca124761299a4217b67fdeea370c493","observation_id":"0660ddb4-1038-4182-8dbc-78f049ae5179","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Optimal state-determination by mutually unbiased measurements","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:8e549fcf7eac6b6a4c3c0a2b765e31dfe76f9eeecb6e30391bd5d1eee58f5ad9","observation_id":"e88c5fab-c89c-470f-a8a4-e4b30f53e1d0","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Mu- tually Unbiased Bases in Composite Dimen- sions-AReview","venue":null,"work_id":null,"year":2051},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:dd50b706a1adbb79e68b32c95d81d8eaa67510e05413a7cff6c05d6f7fa48465","observation_id":"f38fcb2e-8555-46e4-8779-3df46503ef41","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Mutually unbi- ased bases and hadamard matrices of order six","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:7075cc18baf02b8d060d6d92fc27781653b3e95733ef3772d73d524588c3c72f","observation_id":"72ff8f53-b087-4ed8-b485-399ddf872623","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Five open problems in quantum information theory","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:efbdf2015668743735eaede7e6686def71fe604300fa7b9f6f904cd8626bd056","observation_id":"6ac19c6e-1ac5-44af-80cf-66c5f24c61e3","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Allmutuallyunbiasedbases in dimensions two to five","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:4a99cfdda022f3503f90a634da929c5e011541a661f1ae74c4ad3db41a6cc3d9","observation_id":"4cd23aa0-b024-4a9b-9432-fbd504810964","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Approx- imating the exponential from a lie algebra to a lie group","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:12dcf108cdee486875e6f615a1573a3ef1f23b29979a5cd7b005fff539388a88","observation_id":"388dad15-61c7-420a-b30f-02d6d390666f","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Introduction to spectral theory in hilbert space","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:0fa1ad91041154f126263a71b9bbe691d88ae1074ab316728575ddad533ff2f5","observation_id":"f41c7e60-dbe1-4b64-a788-b5911fc6b052","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"The theory of group characters and matrix representations of groups","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:6c4bab92b913dc9855ddda44505c357e444494b26d435c1217abafb9ccd37b31","observation_id":"f2514477-f522-43bd-a22e-1fbf6e4c3037","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"On mutually unbiased bases","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:70c4f85cb5562e2d22cee803f8a16387f2ad2064a54b2a4402d89bd80d4b7157","observation_id":"3fbe3026-59dc-4669-8fec-45477f11c8f7","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Mutually unbiased bases in low dimensions","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:575ce29e4b860774afebd4b089d855f9029862b5a7b39c91611484e0cabd24f9","observation_id":"40101946-a718-4412-a25f-ffddbb5b7a73","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"On SIC-POVMs and MUBs in Dimension 6","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:37f84725e69ca5cc9b690c2f48e82f24a74071f8bb9278c5ff916ffa6aeee3a4","observation_id":"06a36c3d-28a3-466d-9800-ba2080309fd0","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Automatic differentiation in pytorch","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:9ffdfc627495bc8484f67bf7dd5423e5b87c37b4924352e1da5f102307d47871","observation_id":"7441698a-f833-48bc-abbd-d30a3bb0c420","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Pytorch: An imperative style, high- performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:27dda27d31da3abad30724b3046a399adf868f9af450d5f9706807c849ccdd8a","observation_id":"879e661f-47a5-4a0b-893c-392d29a9eb85","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Functions of matrices","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:6378422bc0e2e826e44078f0dcc98cac9ee32bdf4e2a1f11b40c83639caba1e7","observation_id":"4ca96c82-ab03-4207-b111-c777d925ecc7","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Quantum latin squares and quantum functions: Applications in quantum information","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:7d0e652147e9e8bdec7e6d0517379e87904b96da261c93195ef64b4144ff2d01","observation_id":"457dabb8-e525-4a80-9043-57f6e5586524","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9608048","last_updated":"1996-10-08T21:43:52Z","snapshot_observed_at":"2026-07-07T07:26:23.959413Z","submitted_at":"1996-08-29T19:17:10Z","title":"Non-binary Unitary Error Bases and Quantum Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9608048","snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Non-binary unitary er- ror bases and quantum codes","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"cited_paper":"/paper/quant-ph/9608048","citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:6ce2d3934841c982a9c2d7692567306e3c453302a0c99a690b5ddb7d4db71f42","observation_id":"67b98b5d-a7cf-4335-a6fc-d949a790f26b","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"Biuni- tary constructions in quantum information","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:64dc855ad8df14a2dc035b267ad117360364b763f1d81961bc4174a79e3fe18e","observation_id":"31f6e818-0ade-48c4-b8f0-14444e332e8e","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:28:06.255508Z","title":"IBM Quantum Platform Compute Resources: ibm_marrakesh","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T10:28:06.255508Z"},"links":{"citing_paper":"/paper/2607.10615"},"observation_digest":"sha256:e5819ce8107d4e15b3b9dd65e38c5b419044a706f91c59f3a1917f4622e40b7f","observation_id":"bc67c096-d48d-4bba-bfef-be978aa82ead","resolution":{"observed_at":"2026-07-14T10:28:06.255508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.10615","last_updated":"2026-07-12T07:24:25Z","latest_version":1,"primary_category":"cs.MS","snapshot_observed_at":"2026-08-08T23:13:02.981343Z","submitted_at":"2026-07-12T07:24:25Z","title":"A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2607.10615."}