{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FODLPJSUAB7ZIWTD7BUSDHQWX3","short_pith_number":"pith:FODLPJSU","schema_version":"1.0","canonical_sha256":"2b86b7a654007f945a63f869219e16bedc3fe2334c108cffddf6e8aaf212028f","source":{"kind":"arxiv","id":"2601.02087","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Framework for Failure-Aware Protocols in Fusion-Based Graph-State Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bhilahari Jeevanesan, Korbinian Staudacher, Tobias Guggemos","submitted_at":"2026-01-05T13:13:39Z","abstract_excerpt":"We consider the generation of photonic graph states in a linear optics setting where sequential non-deterministic fusion measurements are used to build large graph states out of small linear clusters and develop a framework to optimize the building process using graph theoretic characterizations of fusion networks. We present graph state generation protocols for linear cluster resource states and Type-I/Type-II fusions which are adaptive to fusion failure, that is, they reuse leftover graph states in the remaining building process. To estimate hardware costs, we interpret our protocols as fini"},"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":"2601.02087","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-01-05T13:13:39Z","cross_cats_sorted":[],"title_canon_sha256":"acac5fa58a29f1dc0be6cc8e2a56b99c2e421b8f54d7ee4c65362e8e97b59ba0","abstract_canon_sha256":"eb89afd571d05e94134eeb99966481d3439d743e0b75e268c351f48e4b36814d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:11:59.951358Z","signature_b64":"jX4ILNwednXzw51yJvpY9X5BgnzF1x2ugmqmPpm3x8HQZPDPOoOg/i5MVZhgJVAp1VByVUgbvyWmx2E1iB5oBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b86b7a654007f945a63f869219e16bedc3fe2334c108cffddf6e8aaf212028f","last_reissued_at":"2026-06-23T01:11:59.950802Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:11:59.950802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Framework for Failure-Aware Protocols in Fusion-Based Graph-State Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bhilahari Jeevanesan, Korbinian Staudacher, Tobias Guggemos","submitted_at":"2026-01-05T13:13:39Z","abstract_excerpt":"We consider the generation of photonic graph states in a linear optics setting where sequential non-deterministic fusion measurements are used to build large graph states out of small linear clusters and develop a framework to optimize the building process using graph theoretic characterizations of fusion networks. We present graph state generation protocols for linear cluster resource states and Type-I/Type-II fusions which are adaptive to fusion failure, that is, they reuse leftover graph states in the remaining building process. To estimate hardware costs, we interpret our protocols as fini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.02087","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.02087/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":"2601.02087","created_at":"2026-06-23T01:11:59.950863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.02087v2","created_at":"2026-06-23T01:11:59.950863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.02087","created_at":"2026-06-23T01:11:59.950863+00:00"},{"alias_kind":"pith_short_12","alias_value":"FODLPJSUAB7Z","created_at":"2026-06-23T01:11:59.950863+00:00"},{"alias_kind":"pith_short_16","alias_value":"FODLPJSUAB7ZIWTD","created_at":"2026-06-23T01:11:59.950863+00:00"},{"alias_kind":"pith_short_8","alias_value":"FODLPJSU","created_at":"2026-06-23T01:11:59.950863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.28490","citing_title":"The subthreshold issue of fusion-based quantum computing","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FODLPJSUAB7ZIWTD7BUSDHQWX3","json":"https://pith.science/pith/FODLPJSUAB7ZIWTD7BUSDHQWX3.json","graph_json":"https://pith.science/api/pith-number/FODLPJSUAB7ZIWTD7BUSDHQWX3/graph.json","events_json":"https://pith.science/api/pith-number/FODLPJSUAB7ZIWTD7BUSDHQWX3/events.json","paper":"https://pith.science/paper/FODLPJSU"},"agent_actions":{"view_html":"https://pith.science/pith/FODLPJSUAB7ZIWTD7BUSDHQWX3","download_json":"https://pith.science/pith/FODLPJSUAB7ZIWTD7BUSDHQWX3.json","view_paper":"https://pith.science/paper/FODLPJSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.02087&json=true","fetch_graph":"https://pith.science/api/pith-number/FODLPJSUAB7ZIWTD7BUSDHQWX3/graph.json","fetch_events":"https://pith.science/api/pith-number/FODLPJSUAB7ZIWTD7BUSDHQWX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FODLPJSUAB7ZIWTD7BUSDHQWX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FODLPJSUAB7ZIWTD7BUSDHQWX3/action/storage_attestation","attest_author":"https://pith.science/pith/FODLPJSUAB7ZIWTD7BUSDHQWX3/action/author_attestation","sign_citation":"https://pith.science/pith/FODLPJSUAB7ZIWTD7BUSDHQWX3/action/citation_signature","submit_replication":"https://pith.science/pith/FODLPJSUAB7ZIWTD7BUSDHQWX3/action/replication_record"}},"created_at":"2026-06-23T01:11:59.950863+00:00","updated_at":"2026-06-23T01:11:59.950863+00:00"}