{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PGABCTMKVWSFKCD625UBILFMAO","short_pith_number":"pith:PGABCTMK","canonical_record":{"source":{"id":"1302.1572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-02-06T15:59:24Z","cross_cats_sorted":[],"title_canon_sha256":"c5671363cc078a2733d8d642d59b2e4d69c4b186349561be7d300085af11f699","abstract_canon_sha256":"2a3ea4b4a8e3e897c32c0c250ef0678e58daf9aa873ffeebf1c51fb5a8e6206e"},"schema_version":"1.0"},"canonical_sha256":"7980114d8aada455087ed768142cac03927b8aa3fdd5813f2730adce1eca0ff5","source":{"kind":"arxiv","id":"1302.1572","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1572","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1572v1","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1572","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"PGABCTMKVWSF","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PGABCTMKVWSFKCD6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PGABCTMK","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PGABCTMKVWSFKCD625UBILFMAO","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-02-06T15:59:24Z","cross_cats_sorted":[],"title_canon_sha256":"c5671363cc078a2733d8d642d59b2e4d69c4b186349561be7d300085af11f699","abstract_canon_sha256":"2a3ea4b4a8e3e897c32c0c250ef0678e58daf9aa873ffeebf1c51fb5a8e6206e"},"schema_version":"1.0"},"canonical_sha256":"7980114d8aada455087ed768142cac03927b8aa3fdd5813f2730adce1eca0ff5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:15.392445Z","signature_b64":"nniyWd8WKuZMh9JnPrFGXOqYG/Sw94PLR0cCtezWavd3o2hVC+dHaVpjIJIMeY9e3pcLQPkLOvRr2tL50Lp5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7980114d8aada455087ed768142cac03927b8aa3fdd5813f2730adce1eca0ff5","last_reissued_at":"2026-05-18T03:34:15.391813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:15.391813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1572","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-18T03:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZdOC/9QR1qgT8mfRXh3K0DpPD4Dkgs933ZPv53tn/Vp2PqS10oQDbsylO0Ob7An2RaPZFqo6ViE8vwmOe1SAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:37:08.130701Z"},"content_sha256":"ad6af618c27c5df6daf34d3a27960a287db62781e37533a3054ad67a622e4d8b","schema_version":"1.0","event_id":"sha256:ad6af618c27c5df6daf34d3a27960a287db62781e37533a3054ad67a622e4d8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PGABCTMKVWSFKCD625UBILFMAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lexical Access for Speech Understanding using Minimum Message Length Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bhavani Raskutti, David Albrecht, Ian Thomas, Ingrid Zukerman, Jonathan Oliver","submitted_at":"2013-02-06T15:59:24Z","abstract_excerpt":"The Lexical Access Problem consists of determining the intended sequence of words corresponding to an input sequence of phonemes (basic speech sounds) that come from a low-level phoneme recognizer.  In this paper we present an information-theoretic approach  based on the Minimum Message Length Criterion for solving the Lexical Access Problem.  We model sentences using phoneme realizations seen in training, and word and part-of-speech information obtained from text corpora. We show results on multiple-speaker, continuous, read speech and discuss a heuristic using equivalence classes of similar "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1572","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-18T03:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXaK8JTgLWzVPG82H2TFHdCWnlVzZD8C1cTWUsArwCrENiPX+QIS3/ulXmvfz4tDqBvHxsucARVQsM+8qcrZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:37:08.131040Z"},"content_sha256":"ff2c356e1d2c115e237d54b6d2cf5624d31d8d642c73c4d90bc9e6db9014ee64","schema_version":"1.0","event_id":"sha256:ff2c356e1d2c115e237d54b6d2cf5624d31d8d642c73c4d90bc9e6db9014ee64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO/bundle.json","state_url":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGABCTMKVWSFKCD625UBILFMAO/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-03T18:37:08Z","links":{"resolver":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO","bundle":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO/bundle.json","state":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGABCTMKVWSFKCD625UBILFMAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PGABCTMKVWSFKCD625UBILFMAO","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":"2a3ea4b4a8e3e897c32c0c250ef0678e58daf9aa873ffeebf1c51fb5a8e6206e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-02-06T15:59:24Z","title_canon_sha256":"c5671363cc078a2733d8d642d59b2e4d69c4b186349561be7d300085af11f699"},"schema_version":"1.0","source":{"id":"1302.1572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1572","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1572v1","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1572","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"PGABCTMKVWSF","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PGABCTMKVWSFKCD6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PGABCTMK","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:ff2c356e1d2c115e237d54b6d2cf5624d31d8d642c73c4d90bc9e6db9014ee64","target":"graph","created_at":"2026-05-18T03:34:15Z","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":"The Lexical Access Problem consists of determining the intended sequence of words corresponding to an input sequence of phonemes (basic speech sounds) that come from a low-level phoneme recognizer.  In this paper we present an information-theoretic approach  based on the Minimum Message Length Criterion for solving the Lexical Access Problem.  We model sentences using phoneme realizations seen in training, and word and part-of-speech information obtained from text corpora. We show results on multiple-speaker, continuous, read speech and discuss a heuristic using equivalence classes of similar ","authors_text":"Bhavani Raskutti, David Albrecht, Ian Thomas, Ingrid Zukerman, Jonathan Oliver","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-02-06T15:59:24Z","title":"Lexical Access for Speech Understanding using Minimum Message Length Encoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1572","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:ad6af618c27c5df6daf34d3a27960a287db62781e37533a3054ad67a622e4d8b","target":"record","created_at":"2026-05-18T03:34:15Z","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":"2a3ea4b4a8e3e897c32c0c250ef0678e58daf9aa873ffeebf1c51fb5a8e6206e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-02-06T15:59:24Z","title_canon_sha256":"c5671363cc078a2733d8d642d59b2e4d69c4b186349561be7d300085af11f699"},"schema_version":"1.0","source":{"id":"1302.1572","kind":"arxiv","version":1}},"canonical_sha256":"7980114d8aada455087ed768142cac03927b8aa3fdd5813f2730adce1eca0ff5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7980114d8aada455087ed768142cac03927b8aa3fdd5813f2730adce1eca0ff5","first_computed_at":"2026-05-18T03:34:15.391813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:15.391813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nniyWd8WKuZMh9JnPrFGXOqYG/Sw94PLR0cCtezWavd3o2hVC+dHaVpjIJIMeY9e3pcLQPkLOvRr2tL50Lp5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:15.392445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad6af618c27c5df6daf34d3a27960a287db62781e37533a3054ad67a622e4d8b","sha256:ff2c356e1d2c115e237d54b6d2cf5624d31d8d642c73c4d90bc9e6db9014ee64"],"state_sha256":"3a86f8cb0d6068dd0ad688e744778b954101f68149fa133c0e58c6203c58bbe4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWuTIrbHnl4ofCZxzImWTKquEi6jKxeQKVTxOkl+dp4l/RQxDL471CxbzIjBwJER4X6pLnF7wnv8L8OjgdxPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:37:08.133219Z","bundle_sha256":"105d78de84c0552f6232d3d8b49c7633d76bad2b1434a836ab96b35d99d4ee8b"}}