{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QWKKETDL63GYBZ4WUD3LWOBTPY","short_pith_number":"pith:QWKKETDL","schema_version":"1.0","canonical_sha256":"8594a24c6bf6cd80e796a0f6bb38337e2776e5ca5369db5e1e9d3a5a9ce7cc3f","source":{"kind":"arxiv","id":"1709.08359","version":1},"attestation_state":"computed","paper":{"title":"On the expressive power of query languages for matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Floris Geerts, Jan Van den Bussche, Robert Brijder, Timmy Weerwag","submitted_at":"2017-09-25T08:05:00Z","abstract_excerpt":"We investigate the expressive power of $\\mathsf{MATLANG}$, a formal language for matrix manipulation based on common matrix operations and linear algebra. The language can be extended with the operation $\\mathsf{inv}$ of inverting a matrix. In $\\mathsf{MATLANG}+\\mathsf{inv}$ we can compute the transitive closure of directed graphs, whereas we show that this is not possible without inversion. Indeed we show that the basic language can be simulated in the relational algebra with arithmetic operations, grouping, and summation. We also consider an operation $\\mathsf{eigen}$ for diagonalizing a mat"},"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":"1709.08359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-25T08:05:00Z","cross_cats_sorted":[],"title_canon_sha256":"59d8aecf75ae4c60df99d2f4baedfa6f3b4c7740d4ad9467f65aad2e6f6d794e","abstract_canon_sha256":"feaf717d10d5f4eb85421753007c07c30971d41f503c1d3051f307f938d244dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:25.797989Z","signature_b64":"qnr2w9lptrv7GOVYj4Ap50cpnYOAJ0LYFeVN3vs8V0PTXyRXZsAStYNDObwyvQ8lX/3iVpDUE4Xw9lyPIxj2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8594a24c6bf6cd80e796a0f6bb38337e2776e5ca5369db5e1e9d3a5a9ce7cc3f","last_reissued_at":"2026-05-18T00:34:25.797622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:25.797622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the expressive power of query languages for matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Floris Geerts, Jan Van den Bussche, Robert Brijder, Timmy Weerwag","submitted_at":"2017-09-25T08:05:00Z","abstract_excerpt":"We investigate the expressive power of $\\mathsf{MATLANG}$, a formal language for matrix manipulation based on common matrix operations and linear algebra. The language can be extended with the operation $\\mathsf{inv}$ of inverting a matrix. In $\\mathsf{MATLANG}+\\mathsf{inv}$ we can compute the transitive closure of directed graphs, whereas we show that this is not possible without inversion. Indeed we show that the basic language can be simulated in the relational algebra with arithmetic operations, grouping, and summation. We also consider an operation $\\mathsf{eigen}$ for diagonalizing a mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08359","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":"1709.08359","created_at":"2026-05-18T00:34:25.797677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08359v1","created_at":"2026-05-18T00:34:25.797677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08359","created_at":"2026-05-18T00:34:25.797677+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWKKETDL63GY","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWKKETDL63GYBZ4W","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWKKETDL","created_at":"2026-05-18T12:31:39.905425+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/QWKKETDL63GYBZ4WUD3LWOBTPY","json":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY.json","graph_json":"https://pith.science/api/pith-number/QWKKETDL63GYBZ4WUD3LWOBTPY/graph.json","events_json":"https://pith.science/api/pith-number/QWKKETDL63GYBZ4WUD3LWOBTPY/events.json","paper":"https://pith.science/paper/QWKKETDL"},"agent_actions":{"view_html":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY","download_json":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY.json","view_paper":"https://pith.science/paper/QWKKETDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08359&json=true","fetch_graph":"https://pith.science/api/pith-number/QWKKETDL63GYBZ4WUD3LWOBTPY/graph.json","fetch_events":"https://pith.science/api/pith-number/QWKKETDL63GYBZ4WUD3LWOBTPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/action/storage_attestation","attest_author":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/action/author_attestation","sign_citation":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/action/citation_signature","submit_replication":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/action/replication_record"}},"created_at":"2026-05-18T00:34:25.797677+00:00","updated_at":"2026-05-18T00:34:25.797677+00:00"}