{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:KQKJHTIT2C3OO32FS4BLSCE5CE","short_pith_number":"pith:KQKJHTIT","canonical_record":{"source":{"id":"2201.02715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-01-08T00:47:50Z","cross_cats_sorted":[],"title_canon_sha256":"da33c0670769fd3d918f30bbf967f071e20ff71d4465a0815d8cbbcefcd1598b","abstract_canon_sha256":"d540b6231727d54105a55e180cb7e7b9c9381a719c47c740a4d05a1675fdc3a2"},"schema_version":"1.0"},"canonical_sha256":"541493cd13d0b6e76f459702b9089d110e400161cbe0ebd1baec7aba3b54ab3e","source":{"kind":"arxiv","id":"2201.02715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.02715","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"arxiv_version","alias_value":"2201.02715v1","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.02715","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"pith_short_12","alias_value":"KQKJHTIT2C3O","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"pith_short_16","alias_value":"KQKJHTIT2C3OO32F","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"pith_short_8","alias_value":"KQKJHTIT","created_at":"2026-07-05T03:46:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:KQKJHTIT2C3OO32FS4BLSCE5CE","target":"record","payload":{"canonical_record":{"source":{"id":"2201.02715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-01-08T00:47:50Z","cross_cats_sorted":[],"title_canon_sha256":"da33c0670769fd3d918f30bbf967f071e20ff71d4465a0815d8cbbcefcd1598b","abstract_canon_sha256":"d540b6231727d54105a55e180cb7e7b9c9381a719c47c740a4d05a1675fdc3a2"},"schema_version":"1.0"},"canonical_sha256":"541493cd13d0b6e76f459702b9089d110e400161cbe0ebd1baec7aba3b54ab3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:46:47.567047Z","signature_b64":"JdDAFAKsF38c0ji0YyleFL3SekmyauLIvYbgA/aUh2eZ0FdQO+Y30Iva/uwxmEmEUPUccPgo1QS823AcDoiZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"541493cd13d0b6e76f459702b9089d110e400161cbe0ebd1baec7aba3b54ab3e","last_reissued_at":"2026-07-05T03:46:47.566686Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:46:47.566686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.02715","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-05T03:46:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ztPdemr7+P/jQntMwtvfp26e09n3bibHRrgv+13JGGvgprFj/s/ssITEL1WgbEGjOe5uhK60v1WBhZ/byPRJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:16:01.942178Z"},"content_sha256":"4d51c5ff5b2d1b153bfd1180e462648c7afc01940dc6e7573ab0e60c31d8b8c0","schema_version":"1.0","event_id":"sha256:4d51c5ff5b2d1b153bfd1180e462648c7afc01940dc6e7573ab0e60c31d8b8c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:KQKJHTIT2C3OO32FS4BLSCE5CE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Rank Constraints for Fast Inference in Structured Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander M. Rush, Justin T. Chiu, Yuntian Deng","submitted_at":"2022-01-08T00:47:50Z","abstract_excerpt":"Structured distributions, i.e. distributions over combinatorial spaces, are commonly used to learn latent probabilistic representations from observed data. However, scaling these models is bottlenecked by the high computational and memory complexity with respect to the size of the latent representations. Common models such as Hidden Markov Models (HMMs) and Probabilistic Context-Free Grammars (PCFGs) require time and space quadratic and cubic in the number of hidden states respectively. This work demonstrates a simple approach to reduce the computational and memory complexity of a large class "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.02715","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/2201.02715/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-05T03:46:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+OC1DUwpF+W8t7xDFNwDwNF1+fgg/XykKRrih+ctfNz9lfUTAZw9In2Dm3ERkc+bZSz46SMyeSP9DI0mtomDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:16:01.942700Z"},"content_sha256":"4a55c066403e788b4f7b275acf8d928f86914833f49c7081f4a4bd716cfd84b6","schema_version":"1.0","event_id":"sha256:4a55c066403e788b4f7b275acf8d928f86914833f49c7081f4a4bd716cfd84b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQKJHTIT2C3OO32FS4BLSCE5CE/bundle.json","state_url":"https://pith.science/pith/KQKJHTIT2C3OO32FS4BLSCE5CE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQKJHTIT2C3OO32FS4BLSCE5CE/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-08-07T03:16:01Z","links":{"resolver":"https://pith.science/pith/KQKJHTIT2C3OO32FS4BLSCE5CE","bundle":"https://pith.science/pith/KQKJHTIT2C3OO32FS4BLSCE5CE/bundle.json","state":"https://pith.science/pith/KQKJHTIT2C3OO32FS4BLSCE5CE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQKJHTIT2C3OO32FS4BLSCE5CE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KQKJHTIT2C3OO32FS4BLSCE5CE","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":"d540b6231727d54105a55e180cb7e7b9c9381a719c47c740a4d05a1675fdc3a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-01-08T00:47:50Z","title_canon_sha256":"da33c0670769fd3d918f30bbf967f071e20ff71d4465a0815d8cbbcefcd1598b"},"schema_version":"1.0","source":{"id":"2201.02715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.02715","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"arxiv_version","alias_value":"2201.02715v1","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.02715","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"pith_short_12","alias_value":"KQKJHTIT2C3O","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"pith_short_16","alias_value":"KQKJHTIT2C3OO32F","created_at":"2026-07-05T03:46:47Z"},{"alias_kind":"pith_short_8","alias_value":"KQKJHTIT","created_at":"2026-07-05T03:46:47Z"}],"graph_snapshots":[{"event_id":"sha256:4a55c066403e788b4f7b275acf8d928f86914833f49c7081f4a4bd716cfd84b6","target":"graph","created_at":"2026-07-05T03:46:47Z","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/2201.02715/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Structured distributions, i.e. distributions over combinatorial spaces, are commonly used to learn latent probabilistic representations from observed data. However, scaling these models is bottlenecked by the high computational and memory complexity with respect to the size of the latent representations. Common models such as Hidden Markov Models (HMMs) and Probabilistic Context-Free Grammars (PCFGs) require time and space quadratic and cubic in the number of hidden states respectively. This work demonstrates a simple approach to reduce the computational and memory complexity of a large class ","authors_text":"Alexander M. Rush, Justin T. Chiu, Yuntian Deng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-01-08T00:47:50Z","title":"Low-Rank Constraints for Fast Inference in Structured Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.02715","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:4d51c5ff5b2d1b153bfd1180e462648c7afc01940dc6e7573ab0e60c31d8b8c0","target":"record","created_at":"2026-07-05T03:46:47Z","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":"d540b6231727d54105a55e180cb7e7b9c9381a719c47c740a4d05a1675fdc3a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-01-08T00:47:50Z","title_canon_sha256":"da33c0670769fd3d918f30bbf967f071e20ff71d4465a0815d8cbbcefcd1598b"},"schema_version":"1.0","source":{"id":"2201.02715","kind":"arxiv","version":1}},"canonical_sha256":"541493cd13d0b6e76f459702b9089d110e400161cbe0ebd1baec7aba3b54ab3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"541493cd13d0b6e76f459702b9089d110e400161cbe0ebd1baec7aba3b54ab3e","first_computed_at":"2026-07-05T03:46:47.566686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:46:47.566686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JdDAFAKsF38c0ji0YyleFL3SekmyauLIvYbgA/aUh2eZ0FdQO+Y30Iva/uwxmEmEUPUccPgo1QS823AcDoiZAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:46:47.567047Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.02715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d51c5ff5b2d1b153bfd1180e462648c7afc01940dc6e7573ab0e60c31d8b8c0","sha256:4a55c066403e788b4f7b275acf8d928f86914833f49c7081f4a4bd716cfd84b6"],"state_sha256":"2c12803ee3556c796375702aa1ff2369c491eb1f4d055248975263bd7b4edb89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IyK4ibzrzdHRQv2qlrl8qD7++oGDawSwUrBZALNMpM5wreOy/e/H0aLnSG9fT8drm2Zl6LVXGDJoAHL1osMJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T03:16:01.946719Z","bundle_sha256":"55b327997b1f294f61971c5b3339fa88b0c407b135c518a8e7e1cb1b91fc1597"}}