{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CKCPR2W7E7ZXW3XDIC25SB3WAE","short_pith_number":"pith:CKCPR2W7","canonical_record":{"source":{"id":"1912.04540","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.RA","submitted_at":"2019-12-10T07:01:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d910907099c4e8b050730b89068e1154c5ed8f67de2d519bb7264d0085ead0c2","abstract_canon_sha256":"e1536e05c130c0d961f5e4ed1f1a896051894fb7427179b33288ba90834fbd47"},"schema_version":"1.0"},"canonical_sha256":"1284f8eadf27f37b6ee340b5d90776010cef82a824b977f6d2d35258d6b539a2","source":{"kind":"arxiv","id":"1912.04540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.04540","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"arxiv_version","alias_value":"1912.04540v1","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.04540","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"pith_short_12","alias_value":"CKCPR2W7E7ZX","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"pith_short_16","alias_value":"CKCPR2W7E7ZXW3XD","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"pith_short_8","alias_value":"CKCPR2W7","created_at":"2026-07-05T00:25:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CKCPR2W7E7ZXW3XDIC25SB3WAE","target":"record","payload":{"canonical_record":{"source":{"id":"1912.04540","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.RA","submitted_at":"2019-12-10T07:01:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d910907099c4e8b050730b89068e1154c5ed8f67de2d519bb7264d0085ead0c2","abstract_canon_sha256":"e1536e05c130c0d961f5e4ed1f1a896051894fb7427179b33288ba90834fbd47"},"schema_version":"1.0"},"canonical_sha256":"1284f8eadf27f37b6ee340b5d90776010cef82a824b977f6d2d35258d6b539a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:00.305062Z","signature_b64":"k0Qxr1g0RHQkyx6BdazvomeR78a1ca1Y9l+lquQNq3ta8VNIx40fBs+UAksrM6tnPAlxU2IZU97jHV78lQ9uBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1284f8eadf27f37b6ee340b5d90776010cef82a824b977f6d2d35258d6b539a2","last_reissued_at":"2026-07-05T00:25:00.304672Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:00.304672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.04540","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-07-05T00:25:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygK+azIPgn6PspvThyEfm42Kt6L1AfnRAU4FY/E0d6gsMY+EGtN0hkXYRYwI2YK+wctIbblTp7rM1Uh4tJBLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:01:16.590366Z"},"content_sha256":"b270bbd911a2258f90f2535ceadca4fda520631da20757d0c735ebc69629e32e","schema_version":"1.0","event_id":"sha256:b270bbd911a2258f90f2535ceadca4fda520631da20757d0c735ebc69629e32e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CKCPR2W7E7ZXW3XDIC25SB3WAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An algorithm for computing root multiplicities in Kac-Moody algebras","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.RA","authors_text":"Aidan Backus, Joshua Lin, Peter Connick","submitted_at":"2019-12-10T07:01:14Z","abstract_excerpt":"Root multiplicities encode information about the structure of Kac-Moody algebras, and appear in applications as far-reaching as string theory and the theory of modular functions. We provide an algorithm based on the Peterson recurrence formula to compute multiplicities, and argue that it is more efficient than the naive algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.04540","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.04540/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:25:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EO6ODfSg1QYOSyaUqPyiYyYkdaVxL9b86+jdVtZmFJKsWzGus1zhpP8poB7SdivPbGAl6INFdsDTBZV6dpwTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:01:16.590796Z"},"content_sha256":"25141c6bb6fd3cafe029a83ed50b23a762278650924677704278de07b3765356","schema_version":"1.0","event_id":"sha256:25141c6bb6fd3cafe029a83ed50b23a762278650924677704278de07b3765356"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKCPR2W7E7ZXW3XDIC25SB3WAE/bundle.json","state_url":"https://pith.science/pith/CKCPR2W7E7ZXW3XDIC25SB3WAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKCPR2W7E7ZXW3XDIC25SB3WAE/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-07-06T19:01:16Z","links":{"resolver":"https://pith.science/pith/CKCPR2W7E7ZXW3XDIC25SB3WAE","bundle":"https://pith.science/pith/CKCPR2W7E7ZXW3XDIC25SB3WAE/bundle.json","state":"https://pith.science/pith/CKCPR2W7E7ZXW3XDIC25SB3WAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKCPR2W7E7ZXW3XDIC25SB3WAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CKCPR2W7E7ZXW3XDIC25SB3WAE","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":"e1536e05c130c0d961f5e4ed1f1a896051894fb7427179b33288ba90834fbd47","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.RA","submitted_at":"2019-12-10T07:01:14Z","title_canon_sha256":"d910907099c4e8b050730b89068e1154c5ed8f67de2d519bb7264d0085ead0c2"},"schema_version":"1.0","source":{"id":"1912.04540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.04540","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"arxiv_version","alias_value":"1912.04540v1","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.04540","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"pith_short_12","alias_value":"CKCPR2W7E7ZX","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"pith_short_16","alias_value":"CKCPR2W7E7ZXW3XD","created_at":"2026-07-05T00:25:00Z"},{"alias_kind":"pith_short_8","alias_value":"CKCPR2W7","created_at":"2026-07-05T00:25:00Z"}],"graph_snapshots":[{"event_id":"sha256:25141c6bb6fd3cafe029a83ed50b23a762278650924677704278de07b3765356","target":"graph","created_at":"2026-07-05T00:25:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.04540/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Root multiplicities encode information about the structure of Kac-Moody algebras, and appear in applications as far-reaching as string theory and the theory of modular functions. We provide an algorithm based on the Peterson recurrence formula to compute multiplicities, and argue that it is more efficient than the naive algorithm.","authors_text":"Aidan Backus, Joshua Lin, Peter Connick","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.RA","submitted_at":"2019-12-10T07:01:14Z","title":"An algorithm for computing root multiplicities in Kac-Moody algebras"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.04540","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:b270bbd911a2258f90f2535ceadca4fda520631da20757d0c735ebc69629e32e","target":"record","created_at":"2026-07-05T00:25:00Z","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":"e1536e05c130c0d961f5e4ed1f1a896051894fb7427179b33288ba90834fbd47","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.RA","submitted_at":"2019-12-10T07:01:14Z","title_canon_sha256":"d910907099c4e8b050730b89068e1154c5ed8f67de2d519bb7264d0085ead0c2"},"schema_version":"1.0","source":{"id":"1912.04540","kind":"arxiv","version":1}},"canonical_sha256":"1284f8eadf27f37b6ee340b5d90776010cef82a824b977f6d2d35258d6b539a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1284f8eadf27f37b6ee340b5d90776010cef82a824b977f6d2d35258d6b539a2","first_computed_at":"2026-07-05T00:25:00.304672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:25:00.304672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k0Qxr1g0RHQkyx6BdazvomeR78a1ca1Y9l+lquQNq3ta8VNIx40fBs+UAksrM6tnPAlxU2IZU97jHV78lQ9uBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:25:00.305062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.04540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b270bbd911a2258f90f2535ceadca4fda520631da20757d0c735ebc69629e32e","sha256:25141c6bb6fd3cafe029a83ed50b23a762278650924677704278de07b3765356"],"state_sha256":"aa197243733ce163210e69f3a1607f878e0cc73df336b226a7104320cbff088a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqXoB5eR8NvrKPJj6CberXYxBjAg/y7HlAZS2t52mbhXo4yFcB2k3bDdTypGmF0raslhCB19q7i6hxIlRfGYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:01:16.592848Z","bundle_sha256":"714315a4a8f2ffe7e6ea04ba15af78b7d757a1a1ebb0f929ed06d7c51d20768f"}}