{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DIYL6UNMWGNPUX7YK2NZ44XGPI","short_pith_number":"pith:DIYL6UNM","schema_version":"1.0","canonical_sha256":"1a30bf51acb19afa5ff8569b9e72e67a37cc5f643c896885922d1e9ccec916dd","source":{"kind":"arxiv","id":"1610.00159","version":1},"attestation_state":"computed","paper":{"title":"On the complexity of the permanent in various computational models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Christian Ikenmeyer, J.M. Landsberg","submitted_at":"2016-10-01T17:04:36Z","abstract_excerpt":"We answer a question in [Landsberg, Ressayre, 2015], showing the regular determinantal complexity of the determinant det_m is O(m^3). We answer questions in, and generalize results of [Aravind, Joglekar, 2015], showing there is no rank one determinantal expression for perm_m or det_m when m >= 3. Finally we state and prove several \"folklore\" results relating different models of computation."},"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":"1610.00159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-01T17:04:36Z","cross_cats_sorted":[],"title_canon_sha256":"2f7567860008fb252c10c3ddf2cf564eb14c71c1063bff48e0ab664672536efb","abstract_canon_sha256":"332697adb6ac2c7af4d554621ddd8b42ab0211a8c5320f9ccd4b96bf170d4fe3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:31.752952Z","signature_b64":"WySUxfNH63v5NtOvgAMcMx7urq/Y8NWIXxeMqR1/xG6VzwlpQP0M+kRJ+Yw7kkb9k7jyWLEr7z1aDeHjOQYMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a30bf51acb19afa5ff8569b9e72e67a37cc5f643c896885922d1e9ccec916dd","last_reissued_at":"2026-05-18T01:03:31.752455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:31.752455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of the permanent in various computational models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Christian Ikenmeyer, J.M. Landsberg","submitted_at":"2016-10-01T17:04:36Z","abstract_excerpt":"We answer a question in [Landsberg, Ressayre, 2015], showing the regular determinantal complexity of the determinant det_m is O(m^3). We answer questions in, and generalize results of [Aravind, Joglekar, 2015], showing there is no rank one determinantal expression for perm_m or det_m when m >= 3. Finally we state and prove several \"folklore\" results relating different models of computation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00159","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":""},"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":"1610.00159","created_at":"2026-05-18T01:03:31.752535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00159v1","created_at":"2026-05-18T01:03:31.752535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00159","created_at":"2026-05-18T01:03:31.752535+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIYL6UNMWGNP","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIYL6UNMWGNPUX7Y","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIYL6UNM","created_at":"2026-05-18T12:30:12.583610+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/DIYL6UNMWGNPUX7YK2NZ44XGPI","json":"https://pith.science/pith/DIYL6UNMWGNPUX7YK2NZ44XGPI.json","graph_json":"https://pith.science/api/pith-number/DIYL6UNMWGNPUX7YK2NZ44XGPI/graph.json","events_json":"https://pith.science/api/pith-number/DIYL6UNMWGNPUX7YK2NZ44XGPI/events.json","paper":"https://pith.science/paper/DIYL6UNM"},"agent_actions":{"view_html":"https://pith.science/pith/DIYL6UNMWGNPUX7YK2NZ44XGPI","download_json":"https://pith.science/pith/DIYL6UNMWGNPUX7YK2NZ44XGPI.json","view_paper":"https://pith.science/paper/DIYL6UNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00159&json=true","fetch_graph":"https://pith.science/api/pith-number/DIYL6UNMWGNPUX7YK2NZ44XGPI/graph.json","fetch_events":"https://pith.science/api/pith-number/DIYL6UNMWGNPUX7YK2NZ44XGPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIYL6UNMWGNPUX7YK2NZ44XGPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIYL6UNMWGNPUX7YK2NZ44XGPI/action/storage_attestation","attest_author":"https://pith.science/pith/DIYL6UNMWGNPUX7YK2NZ44XGPI/action/author_attestation","sign_citation":"https://pith.science/pith/DIYL6UNMWGNPUX7YK2NZ44XGPI/action/citation_signature","submit_replication":"https://pith.science/pith/DIYL6UNMWGNPUX7YK2NZ44XGPI/action/replication_record"}},"created_at":"2026-05-18T01:03:31.752535+00:00","updated_at":"2026-05-18T01:03:31.752535+00:00"}