{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D7HK5Y6UZSAQXAA5WUAVL2PVNH","short_pith_number":"pith:D7HK5Y6U","schema_version":"1.0","canonical_sha256":"1fceaee3d4cc810b801db50155e9f569e0c4d5046d195d58a30d4f6d052fca07","source":{"kind":"arxiv","id":"2411.14676","version":1},"attestation_state":"computed","paper":{"title":"Depth-first search for tensor rank and border rank over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jason Yang","submitted_at":"2024-11-22T02:17:48Z","abstract_excerpt":"We present an $O^*\\left(|\\mathbb{F}|^{(R-n_*)\\left(\\sum_d n_d\\right)+n_*}\\right)$-time algorithm for determining whether a tensor of shape $n_0\\times\\dots\\times n_{D-1}$ over a finite field $\\mathbb{F}$ has rank $\\le R$, where $n_*:=\\max_d n_d$; we assume without loss of generality that $\\forall d:n_d\\le R$. We also extend this problem to its border rank analog, i.e., determining tensor rank over rings of the form $\\mathbb{F}[x]/(x^H)$, and give an $O^*\\left(|\\mathbb{F}|^{H\\sum_{1\\le r\\le R} \\sum_d \\min(r,n_d)}\\right)$-time algorithm. Both of our algorithms use polynomial space."},"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":"2411.14676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-22T02:17:48Z","cross_cats_sorted":[],"title_canon_sha256":"d17f07a9068f9b1306c73d4eb58e746779636e21b94a9ceb33735443aae63755","abstract_canon_sha256":"6e513a16c8bbdc70f55b10c178b8ddcc7e0d96ff842d09a80359ecd58c779a99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:55.409142Z","signature_b64":"E20DMo5IgiTf5jytBXit1YHgWZ6NwjUoMWEewRlYzNI9pLxdw85o2bpV+w0JCMNcjFYaIuJ0+jxpVbwbouqkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fceaee3d4cc810b801db50155e9f569e0c4d5046d195d58a30d4f6d052fca07","last_reissued_at":"2026-07-05T09:38:55.408656Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:55.408656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth-first search for tensor rank and border rank over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jason Yang","submitted_at":"2024-11-22T02:17:48Z","abstract_excerpt":"We present an $O^*\\left(|\\mathbb{F}|^{(R-n_*)\\left(\\sum_d n_d\\right)+n_*}\\right)$-time algorithm for determining whether a tensor of shape $n_0\\times\\dots\\times n_{D-1}$ over a finite field $\\mathbb{F}$ has rank $\\le R$, where $n_*:=\\max_d n_d$; we assume without loss of generality that $\\forall d:n_d\\le R$. We also extend this problem to its border rank analog, i.e., determining tensor rank over rings of the form $\\mathbb{F}[x]/(x^H)$, and give an $O^*\\left(|\\mathbb{F}|^{H\\sum_{1\\le r\\le R} \\sum_d \\min(r,n_d)}\\right)$-time algorithm. Both of our algorithms use polynomial space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14676","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/2411.14676/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":"2411.14676","created_at":"2026-07-05T09:38:55.408730+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14676v1","created_at":"2026-07-05T09:38:55.408730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14676","created_at":"2026-07-05T09:38:55.408730+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7HK5Y6UZSAQ","created_at":"2026-07-05T09:38:55.408730+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7HK5Y6UZSAQXAA5","created_at":"2026-07-05T09:38:55.408730+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7HK5Y6U","created_at":"2026-07-05T09:38:55.408730+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/D7HK5Y6UZSAQXAA5WUAVL2PVNH","json":"https://pith.science/pith/D7HK5Y6UZSAQXAA5WUAVL2PVNH.json","graph_json":"https://pith.science/api/pith-number/D7HK5Y6UZSAQXAA5WUAVL2PVNH/graph.json","events_json":"https://pith.science/api/pith-number/D7HK5Y6UZSAQXAA5WUAVL2PVNH/events.json","paper":"https://pith.science/paper/D7HK5Y6U"},"agent_actions":{"view_html":"https://pith.science/pith/D7HK5Y6UZSAQXAA5WUAVL2PVNH","download_json":"https://pith.science/pith/D7HK5Y6UZSAQXAA5WUAVL2PVNH.json","view_paper":"https://pith.science/paper/D7HK5Y6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14676&json=true","fetch_graph":"https://pith.science/api/pith-number/D7HK5Y6UZSAQXAA5WUAVL2PVNH/graph.json","fetch_events":"https://pith.science/api/pith-number/D7HK5Y6UZSAQXAA5WUAVL2PVNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7HK5Y6UZSAQXAA5WUAVL2PVNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7HK5Y6UZSAQXAA5WUAVL2PVNH/action/storage_attestation","attest_author":"https://pith.science/pith/D7HK5Y6UZSAQXAA5WUAVL2PVNH/action/author_attestation","sign_citation":"https://pith.science/pith/D7HK5Y6UZSAQXAA5WUAVL2PVNH/action/citation_signature","submit_replication":"https://pith.science/pith/D7HK5Y6UZSAQXAA5WUAVL2PVNH/action/replication_record"}},"created_at":"2026-07-05T09:38:55.408730+00:00","updated_at":"2026-07-05T09:38:55.408730+00:00"}