{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WT4OJ4PVJRXEPP7M3LVVFOVPFN","short_pith_number":"pith:WT4OJ4PV","schema_version":"1.0","canonical_sha256":"b4f8e4f1f54c6e47bfecdaeb52baaf2b7060e32312987598dd5cf377ac0b817f","source":{"kind":"arxiv","id":"2309.10509","version":4},"attestation_state":"computed","paper":{"title":"Polynomial-time Solver of Tridiagonal QUBO, QUDO and Tensor QUDO problems with Tensor Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Aitor Moreno Fdez. de Leceta, Alejandro Mata Ali, I\\~nigo Perez Delgado, Marina Ristol Roura","submitted_at":"2023-09-19T10:45:15Z","abstract_excerpt":"We present a quantum-inspired tensor network algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and quadratic unconstrained discrete optimization (QUDO) problems. We also solve the more general Tensor quadratic unconstrained discrete optimization (T-QUDO) problems with one-neighbor interactions in a lineal chain. This method provides an exact and explicit equation for these problems. Our algorithms are based on the simulation of a state that undergoes imaginary time evolution and a Half partial trace. In addition, we address the degenerate case and ev"},"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":"2309.10509","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-19T10:45:15Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"16ac61af51ae9a9b1288db4ffb6cea2eb88c7e2660211c840b273a27900898bf","abstract_canon_sha256":"317b821dcc20037dc69a6e956d6ee67e8074e83cba2dd50252b354d34a27471d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:41.294245Z","signature_b64":"IZbDvRqQN/gb+zOxpV7FfB6OYIsAandRH03VDPEGIT52ToAyqTVUBB9Xbhi+u7w/j7mHhtOwsQm+vPcyjApBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f8e4f1f54c6e47bfecdaeb52baaf2b7060e32312987598dd5cf377ac0b817f","last_reissued_at":"2026-07-05T11:37:41.293668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:41.293668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time Solver of Tridiagonal QUBO, QUDO and Tensor QUDO problems with Tensor Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Aitor Moreno Fdez. de Leceta, Alejandro Mata Ali, I\\~nigo Perez Delgado, Marina Ristol Roura","submitted_at":"2023-09-19T10:45:15Z","abstract_excerpt":"We present a quantum-inspired tensor network algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and quadratic unconstrained discrete optimization (QUDO) problems. We also solve the more general Tensor quadratic unconstrained discrete optimization (T-QUDO) problems with one-neighbor interactions in a lineal chain. This method provides an exact and explicit equation for these problems. Our algorithms are based on the simulation of a state that undergoes imaginary time evolution and a Half partial trace. In addition, we address the degenerate case and ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10509","kind":"arxiv","version":4},"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/2309.10509/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":"2309.10509","created_at":"2026-07-05T11:37:41.293731+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.10509v4","created_at":"2026-07-05T11:37:41.293731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10509","created_at":"2026-07-05T11:37:41.293731+00:00"},{"alias_kind":"pith_short_12","alias_value":"WT4OJ4PVJRXE","created_at":"2026-07-05T11:37:41.293731+00:00"},{"alias_kind":"pith_short_16","alias_value":"WT4OJ4PVJRXEPP7M","created_at":"2026-07-05T11:37:41.293731+00:00"},{"alias_kind":"pith_short_8","alias_value":"WT4OJ4PV","created_at":"2026-07-05T11:37:41.293731+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2311.10433","citing_title":"Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WT4OJ4PVJRXEPP7M3LVVFOVPFN","json":"https://pith.science/pith/WT4OJ4PVJRXEPP7M3LVVFOVPFN.json","graph_json":"https://pith.science/api/pith-number/WT4OJ4PVJRXEPP7M3LVVFOVPFN/graph.json","events_json":"https://pith.science/api/pith-number/WT4OJ4PVJRXEPP7M3LVVFOVPFN/events.json","paper":"https://pith.science/paper/WT4OJ4PV"},"agent_actions":{"view_html":"https://pith.science/pith/WT4OJ4PVJRXEPP7M3LVVFOVPFN","download_json":"https://pith.science/pith/WT4OJ4PVJRXEPP7M3LVVFOVPFN.json","view_paper":"https://pith.science/paper/WT4OJ4PV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.10509&json=true","fetch_graph":"https://pith.science/api/pith-number/WT4OJ4PVJRXEPP7M3LVVFOVPFN/graph.json","fetch_events":"https://pith.science/api/pith-number/WT4OJ4PVJRXEPP7M3LVVFOVPFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WT4OJ4PVJRXEPP7M3LVVFOVPFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WT4OJ4PVJRXEPP7M3LVVFOVPFN/action/storage_attestation","attest_author":"https://pith.science/pith/WT4OJ4PVJRXEPP7M3LVVFOVPFN/action/author_attestation","sign_citation":"https://pith.science/pith/WT4OJ4PVJRXEPP7M3LVVFOVPFN/action/citation_signature","submit_replication":"https://pith.science/pith/WT4OJ4PVJRXEPP7M3LVVFOVPFN/action/replication_record"}},"created_at":"2026-07-05T11:37:41.293731+00:00","updated_at":"2026-07-05T11:37:41.293731+00:00"}