{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5LCMS5QD2J5HXZKDQF6QWVV6W3","short_pith_number":"pith:5LCMS5QD","schema_version":"1.0","canonical_sha256":"eac4c97603d27a7be543817d0b56beb6d55db2817a94058f63ce8eafa242faba","source":{"kind":"arxiv","id":"2411.18981","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Order-Finding for ROABPs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anamay Tengse, Pranjal Dutta, Sumanta Ghosh, Vishwas Bhargava","submitted_at":"2024-11-28T08:02:53Z","abstract_excerpt":"We study the \\emph{order-finding problem} for Read-once Oblivious Algebraic Branching Programs (ROABPs). Given a polynomial $f$ and a parameter $w$, the goal is to find an order $\\sigma$ in which $f$ has an ROABP of \\emph{width} $w$. We show that this problem is NP-hard in the worst case, even when the input is a constant degree polynomial that is given in its dense representation. We provide a reduction from CutWidth to prove these results. Owing to the exactness of our reduction, all the known results for the hardness of approximation of Cutwidth also transfer directly to the order-finding p"},"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.18981","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-28T08:02:53Z","cross_cats_sorted":[],"title_canon_sha256":"0de8249fdc054f4c2b7a0632db90699e1cec286b096a75d27a2094dac1748afa","abstract_canon_sha256":"48bc5fd1ac5a6a003428424d6bffb29478a6cc002e559a94861b0e426ca41fb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:55.357304Z","signature_b64":"NY/4Dv6ePEOCYwBe4a88+wIzFtOraOJ9W29rjB8Ki68CgAitEMC6F82e121dF+HJ7CD3ggLROB4bG0hg/HTXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eac4c97603d27a7be543817d0b56beb6d55db2817a94058f63ce8eafa242faba","last_reissued_at":"2026-07-05T09:41:55.356886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:55.356886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Order-Finding for ROABPs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anamay Tengse, Pranjal Dutta, Sumanta Ghosh, Vishwas Bhargava","submitted_at":"2024-11-28T08:02:53Z","abstract_excerpt":"We study the \\emph{order-finding problem} for Read-once Oblivious Algebraic Branching Programs (ROABPs). Given a polynomial $f$ and a parameter $w$, the goal is to find an order $\\sigma$ in which $f$ has an ROABP of \\emph{width} $w$. We show that this problem is NP-hard in the worst case, even when the input is a constant degree polynomial that is given in its dense representation. We provide a reduction from CutWidth to prove these results. Owing to the exactness of our reduction, all the known results for the hardness of approximation of Cutwidth also transfer directly to the order-finding p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18981","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.18981/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.18981","created_at":"2026-07-05T09:41:55.356944+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18981v1","created_at":"2026-07-05T09:41:55.356944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18981","created_at":"2026-07-05T09:41:55.356944+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LCMS5QD2J5H","created_at":"2026-07-05T09:41:55.356944+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LCMS5QD2J5HXZKD","created_at":"2026-07-05T09:41:55.356944+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LCMS5QD","created_at":"2026-07-05T09:41:55.356944+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.10725","citing_title":"On Closure Properties of Read-Once Oblivious Algebraic Branching Programs","ref_index":241,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5LCMS5QD2J5HXZKDQF6QWVV6W3","json":"https://pith.science/pith/5LCMS5QD2J5HXZKDQF6QWVV6W3.json","graph_json":"https://pith.science/api/pith-number/5LCMS5QD2J5HXZKDQF6QWVV6W3/graph.json","events_json":"https://pith.science/api/pith-number/5LCMS5QD2J5HXZKDQF6QWVV6W3/events.json","paper":"https://pith.science/paper/5LCMS5QD"},"agent_actions":{"view_html":"https://pith.science/pith/5LCMS5QD2J5HXZKDQF6QWVV6W3","download_json":"https://pith.science/pith/5LCMS5QD2J5HXZKDQF6QWVV6W3.json","view_paper":"https://pith.science/paper/5LCMS5QD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18981&json=true","fetch_graph":"https://pith.science/api/pith-number/5LCMS5QD2J5HXZKDQF6QWVV6W3/graph.json","fetch_events":"https://pith.science/api/pith-number/5LCMS5QD2J5HXZKDQF6QWVV6W3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LCMS5QD2J5HXZKDQF6QWVV6W3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LCMS5QD2J5HXZKDQF6QWVV6W3/action/storage_attestation","attest_author":"https://pith.science/pith/5LCMS5QD2J5HXZKDQF6QWVV6W3/action/author_attestation","sign_citation":"https://pith.science/pith/5LCMS5QD2J5HXZKDQF6QWVV6W3/action/citation_signature","submit_replication":"https://pith.science/pith/5LCMS5QD2J5HXZKDQF6QWVV6W3/action/replication_record"}},"created_at":"2026-07-05T09:41:55.356944+00:00","updated_at":"2026-07-05T09:41:55.356944+00:00"}