{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5UXLJWKCPLQZR2GTNYVGD6SM4R","short_pith_number":"pith:5UXLJWKC","schema_version":"1.0","canonical_sha256":"ed2eb4d9427ae198e8d36e2a61fa4ce45f1f5acc0e62625f286ff17dd1fb83ea","source":{"kind":"arxiv","id":"1304.4691","version":1},"attestation_state":"computed","paper":{"title":"Efficient Calculation of Determinants of Symbolic Matrices with Many Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Tanya Khovanova, Ziv Scully","submitted_at":"2013-04-17T05:07:55Z","abstract_excerpt":"Efficient matrix determinant calculations have been studied since the 19th century. Computers expand the range of determinants that are practically calculable to include matrices with symbolic entries. However, the fastest determinant algorithms for numerical matrices are often not the fastest for symbolic matrices with many variables. We compare the performance of two algorithms, fraction-free Gaussian elimination and minor expansion, on symbolic matrices with many variables. We show that, under a simplified theoretical model, minor expansion is faster in most situations. We then propose opti"},"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":"1304.4691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-04-17T05:07:55Z","cross_cats_sorted":[],"title_canon_sha256":"0f5b5c53af2b9b261b67ec748d7a871c5d8c26ec93529fe9a54084bc8e3b1a8d","abstract_canon_sha256":"e04ea78bcf18cd2d9df529b283e28294c53233100bcf7416e7701361852644a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:43.960497Z","signature_b64":"74Mpei0kG9AfYAzef9leUOCdfuTBS3SzzWqmB77dQ9vv+U7Dkv88ySemJVZRgWgCEnO0DmYwEmfIV/stoWjiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed2eb4d9427ae198e8d36e2a61fa4ce45f1f5acc0e62625f286ff17dd1fb83ea","last_reissued_at":"2026-05-18T03:27:43.959957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:43.959957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Calculation of Determinants of Symbolic Matrices with Many Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Tanya Khovanova, Ziv Scully","submitted_at":"2013-04-17T05:07:55Z","abstract_excerpt":"Efficient matrix determinant calculations have been studied since the 19th century. Computers expand the range of determinants that are practically calculable to include matrices with symbolic entries. However, the fastest determinant algorithms for numerical matrices are often not the fastest for symbolic matrices with many variables. We compare the performance of two algorithms, fraction-free Gaussian elimination and minor expansion, on symbolic matrices with many variables. We show that, under a simplified theoretical model, minor expansion is faster in most situations. We then propose opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4691","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":"1304.4691","created_at":"2026-05-18T03:27:43.960014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4691v1","created_at":"2026-05-18T03:27:43.960014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4691","created_at":"2026-05-18T03:27:43.960014+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UXLJWKCPLQZ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UXLJWKCPLQZR2GT","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UXLJWKC","created_at":"2026-05-18T12:27:34.582898+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/5UXLJWKCPLQZR2GTNYVGD6SM4R","json":"https://pith.science/pith/5UXLJWKCPLQZR2GTNYVGD6SM4R.json","graph_json":"https://pith.science/api/pith-number/5UXLJWKCPLQZR2GTNYVGD6SM4R/graph.json","events_json":"https://pith.science/api/pith-number/5UXLJWKCPLQZR2GTNYVGD6SM4R/events.json","paper":"https://pith.science/paper/5UXLJWKC"},"agent_actions":{"view_html":"https://pith.science/pith/5UXLJWKCPLQZR2GTNYVGD6SM4R","download_json":"https://pith.science/pith/5UXLJWKCPLQZR2GTNYVGD6SM4R.json","view_paper":"https://pith.science/paper/5UXLJWKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4691&json=true","fetch_graph":"https://pith.science/api/pith-number/5UXLJWKCPLQZR2GTNYVGD6SM4R/graph.json","fetch_events":"https://pith.science/api/pith-number/5UXLJWKCPLQZR2GTNYVGD6SM4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UXLJWKCPLQZR2GTNYVGD6SM4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UXLJWKCPLQZR2GTNYVGD6SM4R/action/storage_attestation","attest_author":"https://pith.science/pith/5UXLJWKCPLQZR2GTNYVGD6SM4R/action/author_attestation","sign_citation":"https://pith.science/pith/5UXLJWKCPLQZR2GTNYVGD6SM4R/action/citation_signature","submit_replication":"https://pith.science/pith/5UXLJWKCPLQZR2GTNYVGD6SM4R/action/replication_record"}},"created_at":"2026-05-18T03:27:43.960014+00:00","updated_at":"2026-05-18T03:27:43.960014+00:00"}