{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TCWUQRMBAR7WFLYFMZX7L4HGS2","short_pith_number":"pith:TCWUQRMB","schema_version":"1.0","canonical_sha256":"98ad484581047f62af05666ff5f0e696a0f90ea1fb7b9beda4797bd4a091dccd","source":{"kind":"arxiv","id":"1401.7883","version":2},"attestation_state":"computed","paper":{"title":"Scaling a unitary matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP","quant-ph"],"primary_cat":"math-ph","authors_text":"Alexis De Vos, Stijn De Baerdemacker","submitted_at":"2014-01-30T15:33:37Z","abstract_excerpt":"The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all line sums equal to 1. We conjecture that a similar procedure exists, which allows, starting from an arbitrary unitary matrix, to find a scaled matrix which is unitary and has all line sums equal to 1. The existence of such algorithm guarantees a powerful decomposition of an arbitrary quantum circuit."},"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":"1401.7883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2014-01-30T15:33:37Z","cross_cats_sorted":["math.MP","quant-ph"],"title_canon_sha256":"e17aba763bf9bd7c8504c96e891daa470c61f462686740863f88337b73dad709","abstract_canon_sha256":"47662194dc315c878ac7b69139d21b93b7ae56efd4ee94fff3babb884e4c5e8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:51.227385Z","signature_b64":"UYBaP00q+DX3cEpGc/iJhb3TuMkkJoTxOvzHiwulWjEV6qYjAaQEhb01F8Xz3fViXpX7gQx5kd/FLr7s+aNGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98ad484581047f62af05666ff5f0e696a0f90ea1fb7b9beda4797bd4a091dccd","last_reissued_at":"2026-05-18T02:27:51.226869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:51.226869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling a unitary matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP","quant-ph"],"primary_cat":"math-ph","authors_text":"Alexis De Vos, Stijn De Baerdemacker","submitted_at":"2014-01-30T15:33:37Z","abstract_excerpt":"The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all line sums equal to 1. We conjecture that a similar procedure exists, which allows, starting from an arbitrary unitary matrix, to find a scaled matrix which is unitary and has all line sums equal to 1. The existence of such algorithm guarantees a powerful decomposition of an arbitrary quantum circuit."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7883","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":"1401.7883","created_at":"2026-05-18T02:27:51.226955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7883v2","created_at":"2026-05-18T02:27:51.226955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7883","created_at":"2026-05-18T02:27:51.226955+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCWUQRMBAR7W","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCWUQRMBAR7WFLYF","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCWUQRMB","created_at":"2026-05-18T12:28:49.207871+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/TCWUQRMBAR7WFLYFMZX7L4HGS2","json":"https://pith.science/pith/TCWUQRMBAR7WFLYFMZX7L4HGS2.json","graph_json":"https://pith.science/api/pith-number/TCWUQRMBAR7WFLYFMZX7L4HGS2/graph.json","events_json":"https://pith.science/api/pith-number/TCWUQRMBAR7WFLYFMZX7L4HGS2/events.json","paper":"https://pith.science/paper/TCWUQRMB"},"agent_actions":{"view_html":"https://pith.science/pith/TCWUQRMBAR7WFLYFMZX7L4HGS2","download_json":"https://pith.science/pith/TCWUQRMBAR7WFLYFMZX7L4HGS2.json","view_paper":"https://pith.science/paper/TCWUQRMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7883&json=true","fetch_graph":"https://pith.science/api/pith-number/TCWUQRMBAR7WFLYFMZX7L4HGS2/graph.json","fetch_events":"https://pith.science/api/pith-number/TCWUQRMBAR7WFLYFMZX7L4HGS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCWUQRMBAR7WFLYFMZX7L4HGS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCWUQRMBAR7WFLYFMZX7L4HGS2/action/storage_attestation","attest_author":"https://pith.science/pith/TCWUQRMBAR7WFLYFMZX7L4HGS2/action/author_attestation","sign_citation":"https://pith.science/pith/TCWUQRMBAR7WFLYFMZX7L4HGS2/action/citation_signature","submit_replication":"https://pith.science/pith/TCWUQRMBAR7WFLYFMZX7L4HGS2/action/replication_record"}},"created_at":"2026-05-18T02:27:51.226955+00:00","updated_at":"2026-05-18T02:27:51.226955+00:00"}