{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QWKKETDL63GYBZ4WUD3LWOBTPY","short_pith_number":"pith:QWKKETDL","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"},"canonical_sha256":"8594a24c6bf6cd80e796a0f6bb38337e2776e5ca5369db5e1e9d3a5a9ce7cc3f","source":{"kind":"arxiv","id":"1709.08359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08359","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08359v1","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08359","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"QWKKETDL63GY","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QWKKETDL63GYBZ4W","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QWKKETDL","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QWKKETDL63GYBZ4WUD3LWOBTPY","target":"record","payload":{"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"},"canonical_sha256":"8594a24c6bf6cd80e796a0f6bb38337e2776e5ca5369db5e1e9d3a5a9ce7cc3f","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"},"source_kind":"arxiv","source_id":"1709.08359","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Od7jCCh81OaCjiDxVu1aJRoXbaZ9fCu9Jw1r9aCPSZ9kvDv3RI/whBhzAarfwyCTE6sWxugfmTr8S1mKFjgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:29:39.408167Z"},"content_sha256":"f8648a123c23adc71bf635749cdfd5d7fe1b5b897f70dd84748c34992e4798fc","schema_version":"1.0","event_id":"sha256:f8648a123c23adc71bf635749cdfd5d7fe1b5b897f70dd84748c34992e4798fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QWKKETDL63GYBZ4WUD3LWOBTPY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrT50NZTEREWBrD6HrKnMDNJK74UUG/DA/KhVYaS0nweakNTcIkWQwlbp1LZz8Ole8CevAvJVPwy1vpoeDkUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:29:39.408902Z"},"content_sha256":"d96544ee35ed1d86c8162b730e8406c6549318aa5f4e705bb5276bdcabf39091","schema_version":"1.0","event_id":"sha256:d96544ee35ed1d86c8162b730e8406c6549318aa5f4e705bb5276bdcabf39091"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/bundle.json","state_url":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T20:29:39Z","links":{"resolver":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY","bundle":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/bundle.json","state":"https://pith.science/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWKKETDL63GYBZ4WUD3LWOBTPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QWKKETDL63GYBZ4WUD3LWOBTPY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"feaf717d10d5f4eb85421753007c07c30971d41f503c1d3051f307f938d244dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-25T08:05:00Z","title_canon_sha256":"59d8aecf75ae4c60df99d2f4baedfa6f3b4c7740d4ad9467f65aad2e6f6d794e"},"schema_version":"1.0","source":{"id":"1709.08359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08359","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08359v1","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08359","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"QWKKETDL63GY","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QWKKETDL63GYBZ4W","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QWKKETDL","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:d96544ee35ed1d86c8162b730e8406c6549318aa5f4e705bb5276bdcabf39091","target":"graph","created_at":"2026-05-18T00:34:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Floris Geerts, Jan Van den Bussche, Robert Brijder, Timmy Weerwag","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-25T08:05:00Z","title":"On the expressive power of query languages for matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08359","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f8648a123c23adc71bf635749cdfd5d7fe1b5b897f70dd84748c34992e4798fc","target":"record","created_at":"2026-05-18T00:34:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"feaf717d10d5f4eb85421753007c07c30971d41f503c1d3051f307f938d244dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-25T08:05:00Z","title_canon_sha256":"59d8aecf75ae4c60df99d2f4baedfa6f3b4c7740d4ad9467f65aad2e6f6d794e"},"schema_version":"1.0","source":{"id":"1709.08359","kind":"arxiv","version":1}},"canonical_sha256":"8594a24c6bf6cd80e796a0f6bb38337e2776e5ca5369db5e1e9d3a5a9ce7cc3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8594a24c6bf6cd80e796a0f6bb38337e2776e5ca5369db5e1e9d3a5a9ce7cc3f","first_computed_at":"2026-05-18T00:34:25.797622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:25.797622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qnr2w9lptrv7GOVYj4Ap50cpnYOAJ0LYFeVN3vs8V0PTXyRXZsAStYNDObwyvQ8lX/3iVpDUE4Xw9lyPIxj2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:25.797989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8648a123c23adc71bf635749cdfd5d7fe1b5b897f70dd84748c34992e4798fc","sha256:d96544ee35ed1d86c8162b730e8406c6549318aa5f4e705bb5276bdcabf39091"],"state_sha256":"53c0ba6aaba2f04cb92b93c093afd8024b8c46b284554dbf2a3e16deea5c9773"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEHHy/L8cyrVXQqWBT6A1qHNFqylEYo7SEDtkuMEEJxct0cm5Cj6ed39VZOxkH7G2UKHE2fmlV72jm1nNKtcBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:29:39.412760Z","bundle_sha256":"e918a6d9f05a5f84526e20b1e2b6f300a9e07f4a0ebde9cfd31c2e25b611a086"}}