{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:P4OV7ZL6FL43FCTY5HD4YWWKQ6","short_pith_number":"pith:P4OV7ZL6","schema_version":"1.0","canonical_sha256":"7f1d5fe57e2af9b28a78e9c7cc5aca87b8ec160418a6304b06e70dbdca6e40f6","source":{"kind":"arxiv","id":"quant-ph/0701194","version":1},"attestation_state":"computed","paper":{"title":"Computation at a distance","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Petrie Moulton, Lawren M. Smithline, Samuel A. Kutin","submitted_at":"2007-01-26T19:48:41Z","abstract_excerpt":"We consider a model of computation motivated by possible limitations on quantum computers. We have a linear array of n wires, and we may perform operations only on pairs of adjacent wires. Our goal is to build a circuits that perform specified operations spanning all n wires. We show that the natural lower bound of n-1 on circuit depth is nearly tight for a variety of problems, and we prove linear upper bounds for additional problems. In particular, using only gates adding a wire (mod 2) into an adjacent wire, we can realize any linear operation in GL_n(2) as a circuit of depth 5n. We show tha"},"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":"quant-ph/0701194","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-01-26T19:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"58a9cd4482bd7ae2ebee18f62ca115102e88af96b3ef3550117c9f4725b4e7b6","abstract_canon_sha256":"fe4d7ad3eda75ee68d9f63597f42af527b1acef5eb7a4cd429282455ae78478b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:59:05.836634Z","signature_b64":"ewBM0A6Me6g9ceWjJcHW8TugnhM6y4575lAeWsFGjrjahl1WqXACXwdObtSn97j47SxRS7IizQRqr4jt18BTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f1d5fe57e2af9b28a78e9c7cc5aca87b8ec160418a6304b06e70dbdca6e40f6","last_reissued_at":"2026-07-04T14:59:05.836256Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:59:05.836256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computation at a distance","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Petrie Moulton, Lawren M. Smithline, Samuel A. Kutin","submitted_at":"2007-01-26T19:48:41Z","abstract_excerpt":"We consider a model of computation motivated by possible limitations on quantum computers. We have a linear array of n wires, and we may perform operations only on pairs of adjacent wires. Our goal is to build a circuits that perform specified operations spanning all n wires. We show that the natural lower bound of n-1 on circuit depth is nearly tight for a variety of problems, and we prove linear upper bounds for additional problems. In particular, using only gates adding a wire (mod 2) into an adjacent wire, we can realize any linear operation in GL_n(2) as a circuit of depth 5n. We show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0701194","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/quant-ph/0701194/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":"quant-ph/0701194","created_at":"2026-07-04T14:59:05.836321+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0701194v1","created_at":"2026-07-04T14:59:05.836321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0701194","created_at":"2026-07-04T14:59:05.836321+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4OV7ZL6FL43","created_at":"2026-07-04T14:59:05.836321+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4OV7ZL6FL43FCTY","created_at":"2026-07-04T14:59:05.836321+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4OV7ZL6","created_at":"2026-07-04T14:59:05.836321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.26041","citing_title":"Asymptotically Optimal Depth Fermionic Permutation on 2D Grid Quantum Architecture without Ancillas","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2508.21667","citing_title":"Block Encoding of Sparse Matrices via Coherent Permutation","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P4OV7ZL6FL43FCTY5HD4YWWKQ6","json":"https://pith.science/pith/P4OV7ZL6FL43FCTY5HD4YWWKQ6.json","graph_json":"https://pith.science/api/pith-number/P4OV7ZL6FL43FCTY5HD4YWWKQ6/graph.json","events_json":"https://pith.science/api/pith-number/P4OV7ZL6FL43FCTY5HD4YWWKQ6/events.json","paper":"https://pith.science/paper/P4OV7ZL6"},"agent_actions":{"view_html":"https://pith.science/pith/P4OV7ZL6FL43FCTY5HD4YWWKQ6","download_json":"https://pith.science/pith/P4OV7ZL6FL43FCTY5HD4YWWKQ6.json","view_paper":"https://pith.science/paper/P4OV7ZL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0701194&json=true","fetch_graph":"https://pith.science/api/pith-number/P4OV7ZL6FL43FCTY5HD4YWWKQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/P4OV7ZL6FL43FCTY5HD4YWWKQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4OV7ZL6FL43FCTY5HD4YWWKQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4OV7ZL6FL43FCTY5HD4YWWKQ6/action/storage_attestation","attest_author":"https://pith.science/pith/P4OV7ZL6FL43FCTY5HD4YWWKQ6/action/author_attestation","sign_citation":"https://pith.science/pith/P4OV7ZL6FL43FCTY5HD4YWWKQ6/action/citation_signature","submit_replication":"https://pith.science/pith/P4OV7ZL6FL43FCTY5HD4YWWKQ6/action/replication_record"}},"created_at":"2026-07-04T14:59:05.836321+00:00","updated_at":"2026-07-04T14:59:05.836321+00:00"}