{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TMJ3QKASWAKHKUFT6XHJW7WULV","short_pith_number":"pith:TMJ3QKAS","canonical_record":{"source":{"id":"1711.05619","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-11-15T15:14:47Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"c3c87d7b43346c23281e57e7012e63b00e6e33eaa84ca937bfbf9df400d4db31","abstract_canon_sha256":"30add5ce05e1ee3ac440ddeeceecaa4ff209b0bf9209c34e257f7d7b299bdb48"},"schema_version":"1.0"},"canonical_sha256":"9b13b82812b0147550b3f5ce9b7ed45d4ab1a45d1c97227a89dee8595d134faa","source":{"kind":"arxiv","id":"1711.05619","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05619","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05619v2","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05619","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"TMJ3QKASWAKH","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TMJ3QKASWAKHKUFT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TMJ3QKAS","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TMJ3QKASWAKHKUFT6XHJW7WULV","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05619","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-11-15T15:14:47Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"c3c87d7b43346c23281e57e7012e63b00e6e33eaa84ca937bfbf9df400d4db31","abstract_canon_sha256":"30add5ce05e1ee3ac440ddeeceecaa4ff209b0bf9209c34e257f7d7b299bdb48"},"schema_version":"1.0"},"canonical_sha256":"9b13b82812b0147550b3f5ce9b7ed45d4ab1a45d1c97227a89dee8595d134faa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:46.063996Z","signature_b64":"CljMCNxw/G8JJoqHlmde0B/ZK8/P7ivFAyUfM8tbvWTFy4K1Y0dsuHyU8iCXlkzu3jcH0yYszukDSSY6ShgTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b13b82812b0147550b3f5ce9b7ed45d4ab1a45d1c97227a89dee8595d134faa","last_reissued_at":"2026-05-18T00:18:46.063449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:46.063449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05619","source_version":2,"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:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHdSueiG0j5qNAEg+OkCUlDX9l6u6fbiOj7L1yj0h23zR4XigN97Tas6rLubHFLee5a5ydd5RcgGgqJuD510CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:10:00.317022Z"},"content_sha256":"0c598a9f3e64d5d8c30927c8c58e95e2f16a1225aaa91290ef59f9ba8955e821","schema_version":"1.0","event_id":"sha256:0c598a9f3e64d5d8c30927c8c58e95e2f16a1225aaa91290ef59f9ba8955e821"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TMJ3QKASWAKHKUFT6XHJW7WULV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improved lower bound for the maximal length of a multivector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.RA","authors_text":"Patrick Cassam-Chena\\\"i (JAD)","submitted_at":"2017-11-15T15:14:47Z","abstract_excerpt":"A new lower bound for the maximal length of a multivector is obtained. It is much closer to the best known upper bound than previously reported lower bound estimates. The maximal length appears to be unexpectedly large for $n$-vectors,  with n>2,  since the few exactly known values seem to grow linearly with vector space dimension, whereas the new lower bound has a polynomial order equal to n-1 like the best known upper bound. This result has implications for quantum chemistry."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05619","kind":"arxiv","version":2},"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:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4Tw12Ha7mMXAjRk/LEKCYbxRLi9iopPVJyaarwrbbBWqKruPFhkSrPGZEfGzbD7v4+amNW00HAEDhrgX4+iDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:10:00.317380Z"},"content_sha256":"f13f3c5e482b1bcf024ff134e8113c78db31d3381c91114b80f31116bbbe9363","schema_version":"1.0","event_id":"sha256:f13f3c5e482b1bcf024ff134e8113c78db31d3381c91114b80f31116bbbe9363"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMJ3QKASWAKHKUFT6XHJW7WULV/bundle.json","state_url":"https://pith.science/pith/TMJ3QKASWAKHKUFT6XHJW7WULV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMJ3QKASWAKHKUFT6XHJW7WULV/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-23T19:10:00Z","links":{"resolver":"https://pith.science/pith/TMJ3QKASWAKHKUFT6XHJW7WULV","bundle":"https://pith.science/pith/TMJ3QKASWAKHKUFT6XHJW7WULV/bundle.json","state":"https://pith.science/pith/TMJ3QKASWAKHKUFT6XHJW7WULV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMJ3QKASWAKHKUFT6XHJW7WULV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TMJ3QKASWAKHKUFT6XHJW7WULV","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":"30add5ce05e1ee3ac440ddeeceecaa4ff209b0bf9209c34e257f7d7b299bdb48","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-11-15T15:14:47Z","title_canon_sha256":"c3c87d7b43346c23281e57e7012e63b00e6e33eaa84ca937bfbf9df400d4db31"},"schema_version":"1.0","source":{"id":"1711.05619","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05619","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05619v2","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05619","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"TMJ3QKASWAKH","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TMJ3QKASWAKHKUFT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TMJ3QKAS","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:f13f3c5e482b1bcf024ff134e8113c78db31d3381c91114b80f31116bbbe9363","target":"graph","created_at":"2026-05-18T00:18:46Z","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":"A new lower bound for the maximal length of a multivector is obtained. It is much closer to the best known upper bound than previously reported lower bound estimates. The maximal length appears to be unexpectedly large for $n$-vectors,  with n>2,  since the few exactly known values seem to grow linearly with vector space dimension, whereas the new lower bound has a polynomial order equal to n-1 like the best known upper bound. This result has implications for quantum chemistry.","authors_text":"Patrick Cassam-Chena\\\"i (JAD)","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-11-15T15:14:47Z","title":"An improved lower bound for the maximal length of a multivector"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05619","kind":"arxiv","version":2},"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:0c598a9f3e64d5d8c30927c8c58e95e2f16a1225aaa91290ef59f9ba8955e821","target":"record","created_at":"2026-05-18T00:18:46Z","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":"30add5ce05e1ee3ac440ddeeceecaa4ff209b0bf9209c34e257f7d7b299bdb48","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2017-11-15T15:14:47Z","title_canon_sha256":"c3c87d7b43346c23281e57e7012e63b00e6e33eaa84ca937bfbf9df400d4db31"},"schema_version":"1.0","source":{"id":"1711.05619","kind":"arxiv","version":2}},"canonical_sha256":"9b13b82812b0147550b3f5ce9b7ed45d4ab1a45d1c97227a89dee8595d134faa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b13b82812b0147550b3f5ce9b7ed45d4ab1a45d1c97227a89dee8595d134faa","first_computed_at":"2026-05-18T00:18:46.063449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:46.063449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CljMCNxw/G8JJoqHlmde0B/ZK8/P7ivFAyUfM8tbvWTFy4K1Y0dsuHyU8iCXlkzu3jcH0yYszukDSSY6ShgTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:46.063996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05619","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c598a9f3e64d5d8c30927c8c58e95e2f16a1225aaa91290ef59f9ba8955e821","sha256:f13f3c5e482b1bcf024ff134e8113c78db31d3381c91114b80f31116bbbe9363"],"state_sha256":"bfe3582911d8c1b00fbdbebd36ec3be111315766e3cb7d3ceef413c0fc6fe456"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8aiHxKlk26l6lHsJeuosiMDITSc80+BQwaecKYegfUwrMzbLCf/IGvXNZBdKZWi7Ajeg43MIuTdMefg4U1OBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:10:00.319492Z","bundle_sha256":"77cc4c6f94fdd10f364e0909b3f8524c9b9d3d3c1d7d0525326695601e4017c4"}}