{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W47XBI5NMYGNI377NPRV7BNMR4","short_pith_number":"pith:W47XBI5N","canonical_record":{"source":{"id":"1712.09630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-27T17:03:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0204a0a51c4d2181702e5797756f12397ceb2b0c5b17359965965e4be7240ad0","abstract_canon_sha256":"a646a51c4e373a73d64cdd238e7f0bb353f4c1d12fa8b2669b2eedb8b91fd6e7"},"schema_version":"1.0"},"canonical_sha256":"b73f70a3ad660cd46fff6be35f85ac8f22d4230461228df3f10a70de7fccf864","source":{"kind":"arxiv","id":"1712.09630","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09630","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09630v3","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09630","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"W47XBI5NMYGN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W47XBI5NMYGNI377","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W47XBI5N","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W47XBI5NMYGNI377NPRV7BNMR4","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-27T17:03:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0204a0a51c4d2181702e5797756f12397ceb2b0c5b17359965965e4be7240ad0","abstract_canon_sha256":"a646a51c4e373a73d64cdd238e7f0bb353f4c1d12fa8b2669b2eedb8b91fd6e7"},"schema_version":"1.0"},"canonical_sha256":"b73f70a3ad660cd46fff6be35f85ac8f22d4230461228df3f10a70de7fccf864","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:39.802297Z","signature_b64":"N+SakmhvatueX5qOSAUmfWMWuAQPXdRjq+h7Su4zTtQRvkUvDhttZefv0w+5reHdf6+QGOEdMi46yk8ccYHsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b73f70a3ad660cd46fff6be35f85ac8f22d4230461228df3f10a70de7fccf864","last_reissued_at":"2026-05-18T00:00:39.801830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:39.801830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09630","source_version":3,"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:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11JEkdXsSewaNTUR5C1e1aA3s8VcgU+3s9Ep+iz8JiHqg3vZkxR7ymBfR9RBXxDUx+gx8+U0hI5yo6TgCO2YCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:38:29.922617Z"},"content_sha256":"2577c4eab58a554657029fde21bfacef4399f2c656b599910165639d0a5975c1","schema_version":"1.0","event_id":"sha256:2577c4eab58a554657029fde21bfacef4399f2c656b599910165639d0a5975c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W47XBI5NMYGNI377NPRV7BNMR4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensor network complexity of multilinear maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Kaie Kubjas, Per Austrin, Petteri Kaski","submitted_at":"2017-12-27T17:03:56Z","abstract_excerpt":"We study tensor networks as a model of arithmetic computation for evaluating multilinear maps. These capture any algorithm based on low border rank tensor decompositions, such as $O(n^{\\omega+\\epsilon})$ time matrix multiplication, and in addition many other algorithms such as $O(n \\log n)$ time discrete Fourier transform and $O^*(2^n)$ time for computing the permanent of a matrix. However tensor networks sometimes yield faster algorithms than those that follow from low-rank decompositions. For instance the fastest known $O(n^{(\\omega +\\epsilon)t})$ time algorithms for counting $3t$-cliques ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09630","kind":"arxiv","version":3},"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:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NA2n56buX1kYnx/igiJaZua8OigrVisdzVp3xLBvfeRUjsBMpt/m63n9vrGuSZ5HUH0BLfwtDCKCJjDSlsHCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:38:29.923295Z"},"content_sha256":"6e441d8b9016c9221752372c6431fda04aa48f9266d8fc06aea7188ede87a42c","schema_version":"1.0","event_id":"sha256:6e441d8b9016c9221752372c6431fda04aa48f9266d8fc06aea7188ede87a42c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W47XBI5NMYGNI377NPRV7BNMR4/bundle.json","state_url":"https://pith.science/pith/W47XBI5NMYGNI377NPRV7BNMR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W47XBI5NMYGNI377NPRV7BNMR4/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-05-26T16:38:29Z","links":{"resolver":"https://pith.science/pith/W47XBI5NMYGNI377NPRV7BNMR4","bundle":"https://pith.science/pith/W47XBI5NMYGNI377NPRV7BNMR4/bundle.json","state":"https://pith.science/pith/W47XBI5NMYGNI377NPRV7BNMR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W47XBI5NMYGNI377NPRV7BNMR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W47XBI5NMYGNI377NPRV7BNMR4","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":"a646a51c4e373a73d64cdd238e7f0bb353f4c1d12fa8b2669b2eedb8b91fd6e7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-27T17:03:56Z","title_canon_sha256":"0204a0a51c4d2181702e5797756f12397ceb2b0c5b17359965965e4be7240ad0"},"schema_version":"1.0","source":{"id":"1712.09630","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09630","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09630v3","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09630","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"W47XBI5NMYGN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W47XBI5NMYGNI377","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W47XBI5N","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:6e441d8b9016c9221752372c6431fda04aa48f9266d8fc06aea7188ede87a42c","target":"graph","created_at":"2026-05-18T00:00:39Z","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 study tensor networks as a model of arithmetic computation for evaluating multilinear maps. These capture any algorithm based on low border rank tensor decompositions, such as $O(n^{\\omega+\\epsilon})$ time matrix multiplication, and in addition many other algorithms such as $O(n \\log n)$ time discrete Fourier transform and $O^*(2^n)$ time for computing the permanent of a matrix. However tensor networks sometimes yield faster algorithms than those that follow from low-rank decompositions. For instance the fastest known $O(n^{(\\omega +\\epsilon)t})$ time algorithms for counting $3t$-cliques ca","authors_text":"Kaie Kubjas, Per Austrin, Petteri Kaski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-27T17:03:56Z","title":"Tensor network complexity of multilinear maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09630","kind":"arxiv","version":3},"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:2577c4eab58a554657029fde21bfacef4399f2c656b599910165639d0a5975c1","target":"record","created_at":"2026-05-18T00:00:39Z","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":"a646a51c4e373a73d64cdd238e7f0bb353f4c1d12fa8b2669b2eedb8b91fd6e7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-27T17:03:56Z","title_canon_sha256":"0204a0a51c4d2181702e5797756f12397ceb2b0c5b17359965965e4be7240ad0"},"schema_version":"1.0","source":{"id":"1712.09630","kind":"arxiv","version":3}},"canonical_sha256":"b73f70a3ad660cd46fff6be35f85ac8f22d4230461228df3f10a70de7fccf864","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b73f70a3ad660cd46fff6be35f85ac8f22d4230461228df3f10a70de7fccf864","first_computed_at":"2026-05-18T00:00:39.801830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:39.801830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N+SakmhvatueX5qOSAUmfWMWuAQPXdRjq+h7Su4zTtQRvkUvDhttZefv0w+5reHdf6+QGOEdMi46yk8ccYHsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:39.802297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09630","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2577c4eab58a554657029fde21bfacef4399f2c656b599910165639d0a5975c1","sha256:6e441d8b9016c9221752372c6431fda04aa48f9266d8fc06aea7188ede87a42c"],"state_sha256":"d648825f3f9c6bcca84d8da2c0c6c7709239bfffd5ae3dff62bb883d8c9f4d2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8e7s1yMMwQ5y983GLaZoMynjAdywCwQT98/X/xvBRDovPqGfMzgFiHozXzPmdXIkyFTlFQpXzIt6nHYNG+xDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:38:29.927030Z","bundle_sha256":"47c09c032281cbaa0f9439ea76464f6c708013b87c5e5b42c37a4b7b544f454a"}}