{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:A7IA5M5VVMADOJAQ7OV3EI643G","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c9cc9f26ce2e0f2857911af3829301d81c02b7df4ec0dc4ee491b441dcbbada0","cross_cats_sorted":["cs.CC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-10-11T01:26:08Z","title_canon_sha256":"2ab3fa5461adf8c13e10e7f09002043538a42b24ce28483f286330292506ffd4"},"schema_version":"1.0","source":{"id":"1010.1982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1982","created_at":"2026-05-18T04:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1982v1","created_at":"2026-05-18T04:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1982","created_at":"2026-05-18T04:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"A7IA5M5VVMAD","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A7IA5M5VVMADOJAQ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A7IA5M5V","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:57285f586f7b38a7bc440c567018e123da9a52284234104c5d04c3e90649aeef","target":"graph","created_at":"2026-05-18T04:39:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An algorithm which either finds an nonzero integer vector ${\\mathbf m}$ for given $t$ real $n$-dimensional vectors ${\\mathbf x}_1,...,{\\mathbf x}_t$ such that ${\\mathbf x}_i^T{\\mathbf m}=0$ or proves that no such integer vector with norm less than a given bound exists is presented in this paper. The cost of the algorithm is at most ${\\mathcal O}(n^4 + n^3 \\log \\lambda(X))$ exact arithmetic operations in dimension $n$ and the least Euclidean norm $\\lambda(X)$ of such integer vectors. It matches the best complexity upper bound known for this problem. Experimental data show that the algorithm is ","authors_text":"Jingwei Chen, Jingzhong Zhang, Xiaolin Qin, Yong Feng","cross_cats":["cs.CC","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-10-11T01:26:08Z","title":"Detecting Simultaneous Integer Relations for Several Real Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1982","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:61b091e7ddb79c6473db4702ce8a8ef85668c351b18f97fa661fb5e87056deec","target":"record","created_at":"2026-05-18T04:39:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c9cc9f26ce2e0f2857911af3829301d81c02b7df4ec0dc4ee491b441dcbbada0","cross_cats_sorted":["cs.CC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-10-11T01:26:08Z","title_canon_sha256":"2ab3fa5461adf8c13e10e7f09002043538a42b24ce28483f286330292506ffd4"},"schema_version":"1.0","source":{"id":"1010.1982","kind":"arxiv","version":1}},"canonical_sha256":"07d00eb3b5ab00372410fbabb223dcd98c48d0eee0bfed4be9a1ad25b6309cb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07d00eb3b5ab00372410fbabb223dcd98c48d0eee0bfed4be9a1ad25b6309cb0","first_computed_at":"2026-05-18T04:39:29.945704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:29.945704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7/Rjw9uNFsDDywjarL0pA/Js7epAbD9Lv49ozQi6HzTQgY/kn/N7uMDDq1NFrOz15JcXho0OjeRlULEX9upoCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:29.946273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61b091e7ddb79c6473db4702ce8a8ef85668c351b18f97fa661fb5e87056deec","sha256:57285f586f7b38a7bc440c567018e123da9a52284234104c5d04c3e90649aeef"],"state_sha256":"14ad9aef2ed0e591526fd88e1e86e340c8bfab89e7b938601284070fe0827a9c"}