{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WH23BFCS7HYL5AWOC44ECFQ6YE","short_pith_number":"pith:WH23BFCS","schema_version":"1.0","canonical_sha256":"b1f5b09452f9f0be82ce173841161ec13f01a3652d2b3047b6b86d161c793f51","source":{"kind":"arxiv","id":"1002.0117","version":4},"attestation_state":"computed","paper":{"title":"Finding an Integral vector in an Unknown Polyhedral Cone","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Kakhbod, Morteza Zadimoghaddam","submitted_at":"2010-01-31T10:59:06Z","abstract_excerpt":"We present an algorithm to find an integral vector in the polyhedral cone $\\Gamma=\\{X | \\textbf{A}X \\leq \\textbf{0}\\}$, without assuming the explicit knowledge of $\\textbf{A}$. About the polyhedral cone, $\\Gamma$, it is only given that, (i) the elements of \\textbf{A} are in $\\{-d,-d+1,\\...,0,\\...,d-1,d\\}$, $d \\in \\mathbb{N}$, and, (ii) $Y=[y(1),y(2),\\...,y(n)]$ is a non-zero integral solution to $\\Gamma$. The proposed algorithm finds a non-zero integral vector in $\\Gamma$ such that its maximum element is less than ${(2d)^{2^{n-1}-1}}/{2^{n-1}}$."},"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":"1002.0117","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-01-31T10:59:06Z","cross_cats_sorted":[],"title_canon_sha256":"d3092f059fad6fddd57aa5e4451571db0e11bf27badfebe828e991b14e0894f0","abstract_canon_sha256":"6ab5bbe130f05a045efe93b576d3942a048d7abe2994d7ee594e762337a1a5ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:24.690356Z","signature_b64":"fR9ahtv1Rp//eY5Y/l02TSblqSKOFUffU4y3gCvmUwB4Yi+gz25lPvbjCIq4riZDlkoMGcO2YWhkoLnlZD2cCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1f5b09452f9f0be82ce173841161ec13f01a3652d2b3047b6b86d161c793f51","last_reissued_at":"2026-05-18T04:08:24.689825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:24.689825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding an Integral vector in an Unknown Polyhedral Cone","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Kakhbod, Morteza Zadimoghaddam","submitted_at":"2010-01-31T10:59:06Z","abstract_excerpt":"We present an algorithm to find an integral vector in the polyhedral cone $\\Gamma=\\{X | \\textbf{A}X \\leq \\textbf{0}\\}$, without assuming the explicit knowledge of $\\textbf{A}$. About the polyhedral cone, $\\Gamma$, it is only given that, (i) the elements of \\textbf{A} are in $\\{-d,-d+1,\\...,0,\\...,d-1,d\\}$, $d \\in \\mathbb{N}$, and, (ii) $Y=[y(1),y(2),\\...,y(n)]$ is a non-zero integral solution to $\\Gamma$. The proposed algorithm finds a non-zero integral vector in $\\Gamma$ such that its maximum element is less than ${(2d)^{2^{n-1}-1}}/{2^{n-1}}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0117","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":""},"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":"1002.0117","created_at":"2026-05-18T04:08:24.689905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.0117v4","created_at":"2026-05-18T04:08:24.689905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0117","created_at":"2026-05-18T04:08:24.689905+00:00"},{"alias_kind":"pith_short_12","alias_value":"WH23BFCS7HYL","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"WH23BFCS7HYL5AWO","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"WH23BFCS","created_at":"2026-05-18T12:26:15.391820+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/WH23BFCS7HYL5AWOC44ECFQ6YE","json":"https://pith.science/pith/WH23BFCS7HYL5AWOC44ECFQ6YE.json","graph_json":"https://pith.science/api/pith-number/WH23BFCS7HYL5AWOC44ECFQ6YE/graph.json","events_json":"https://pith.science/api/pith-number/WH23BFCS7HYL5AWOC44ECFQ6YE/events.json","paper":"https://pith.science/paper/WH23BFCS"},"agent_actions":{"view_html":"https://pith.science/pith/WH23BFCS7HYL5AWOC44ECFQ6YE","download_json":"https://pith.science/pith/WH23BFCS7HYL5AWOC44ECFQ6YE.json","view_paper":"https://pith.science/paper/WH23BFCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.0117&json=true","fetch_graph":"https://pith.science/api/pith-number/WH23BFCS7HYL5AWOC44ECFQ6YE/graph.json","fetch_events":"https://pith.science/api/pith-number/WH23BFCS7HYL5AWOC44ECFQ6YE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WH23BFCS7HYL5AWOC44ECFQ6YE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WH23BFCS7HYL5AWOC44ECFQ6YE/action/storage_attestation","attest_author":"https://pith.science/pith/WH23BFCS7HYL5AWOC44ECFQ6YE/action/author_attestation","sign_citation":"https://pith.science/pith/WH23BFCS7HYL5AWOC44ECFQ6YE/action/citation_signature","submit_replication":"https://pith.science/pith/WH23BFCS7HYL5AWOC44ECFQ6YE/action/replication_record"}},"created_at":"2026-05-18T04:08:24.689905+00:00","updated_at":"2026-05-18T04:08:24.689905+00:00"}