{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Y3EKUG357S53W4J7WIBH732HWL","short_pith_number":"pith:Y3EKUG35","schema_version":"1.0","canonical_sha256":"c6c8aa1b7dfcbbbb713fb2027fef47b2d54a0a3ad5ac9ab129d71cd13ac0c041","source":{"kind":"arxiv","id":"2210.16935","version":1},"attestation_state":"computed","paper":{"title":"Scalable and self-correcting photonic computation using balanced photonic binary tree cascades","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","eess.SP"],"primary_cat":"physics.optics","authors_text":"David A.B. Miller, Olav Solgaard, Shanhui Fan, Sunil Pai","submitted_at":"2022-10-30T19:41:33Z","abstract_excerpt":"Programmable unitary photonic networks that interfere hundreds of modes are emerging as a key technology in energy-efficient sensing, machine learning, cryptography, and linear optical quantum computing applications. In this work, we establish a theoretical framework to quantify error tolerance and scalability in a more general class of \"binary tree cascade'' programmable photonic networks that accept up to tens of thousands of discrete input modes $N$. To justify this scalability claim, we derive error tolerance and configuration time that scale with $\\log_2 N$ for balanced trees versus $N$ i"},"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":"2210.16935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.optics","submitted_at":"2022-10-30T19:41:33Z","cross_cats_sorted":["cs.ET","eess.SP"],"title_canon_sha256":"f206be02e45c281a69c0391d81a6cf672e58abbcba3ac66dd5c2fc35d0e993da","abstract_canon_sha256":"34471c7d4065555a1d58828a7130013802635b6ba98cc3312183588a49e28ebb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:11:52.741176Z","signature_b64":"jbid22ZPObNVEoJsIZS7BWgzphCfcLkcMqjNa8xL3/mvJ98+cXB24n9oUaQYXMD9LBsdTlNTxhOq2KZtuso8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6c8aa1b7dfcbbbb713fb2027fef47b2d54a0a3ad5ac9ab129d71cd13ac0c041","last_reissued_at":"2026-07-05T05:11:52.740740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:11:52.740740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable and self-correcting photonic computation using balanced photonic binary tree cascades","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","eess.SP"],"primary_cat":"physics.optics","authors_text":"David A.B. Miller, Olav Solgaard, Shanhui Fan, Sunil Pai","submitted_at":"2022-10-30T19:41:33Z","abstract_excerpt":"Programmable unitary photonic networks that interfere hundreds of modes are emerging as a key technology in energy-efficient sensing, machine learning, cryptography, and linear optical quantum computing applications. In this work, we establish a theoretical framework to quantify error tolerance and scalability in a more general class of \"binary tree cascade'' programmable photonic networks that accept up to tens of thousands of discrete input modes $N$. To justify this scalability claim, we derive error tolerance and configuration time that scale with $\\log_2 N$ for balanced trees versus $N$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.16935","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/2210.16935/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":"2210.16935","created_at":"2026-07-05T05:11:52.740815+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.16935v1","created_at":"2026-07-05T05:11:52.740815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.16935","created_at":"2026-07-05T05:11:52.740815+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3EKUG357S53","created_at":"2026-07-05T05:11:52.740815+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3EKUG357S53W4J7","created_at":"2026-07-05T05:11:52.740815+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3EKUG35","created_at":"2026-07-05T05:11:52.740815+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/Y3EKUG357S53W4J7WIBH732HWL","json":"https://pith.science/pith/Y3EKUG357S53W4J7WIBH732HWL.json","graph_json":"https://pith.science/api/pith-number/Y3EKUG357S53W4J7WIBH732HWL/graph.json","events_json":"https://pith.science/api/pith-number/Y3EKUG357S53W4J7WIBH732HWL/events.json","paper":"https://pith.science/paper/Y3EKUG35"},"agent_actions":{"view_html":"https://pith.science/pith/Y3EKUG357S53W4J7WIBH732HWL","download_json":"https://pith.science/pith/Y3EKUG357S53W4J7WIBH732HWL.json","view_paper":"https://pith.science/paper/Y3EKUG35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.16935&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3EKUG357S53W4J7WIBH732HWL/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3EKUG357S53W4J7WIBH732HWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3EKUG357S53W4J7WIBH732HWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3EKUG357S53W4J7WIBH732HWL/action/storage_attestation","attest_author":"https://pith.science/pith/Y3EKUG357S53W4J7WIBH732HWL/action/author_attestation","sign_citation":"https://pith.science/pith/Y3EKUG357S53W4J7WIBH732HWL/action/citation_signature","submit_replication":"https://pith.science/pith/Y3EKUG357S53W4J7WIBH732HWL/action/replication_record"}},"created_at":"2026-07-05T05:11:52.740815+00:00","updated_at":"2026-07-05T05:11:52.740815+00:00"}