{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:C2O5SNDOTBS5VLU6EMKITGCD6E","short_pith_number":"pith:C2O5SNDO","canonical_record":{"source":{"id":"1205.5407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-05-24T11:53:41Z","cross_cats_sorted":[],"title_canon_sha256":"87c3b12b0eca676115e6a00943a1e285f2bd76b811bbf5e2b83252be50776141","abstract_canon_sha256":"7844fb4dbe8cd86ed6deb09bd257f4c84a99c2341a48e413f1de931654dc4902"},"schema_version":"1.0"},"canonical_sha256":"169dd9346e9865daae9e2314899843f10bac881f09c9cb95eabf2bcebbe26c66","source":{"kind":"arxiv","id":"1205.5407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5407","created_at":"2026-05-18T03:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5407v2","created_at":"2026-05-18T03:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5407","created_at":"2026-05-18T03:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"C2O5SNDOTBS5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C2O5SNDOTBS5VLU6","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C2O5SNDO","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:C2O5SNDOTBS5VLU6EMKITGCD6E","target":"record","payload":{"canonical_record":{"source":{"id":"1205.5407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-05-24T11:53:41Z","cross_cats_sorted":[],"title_canon_sha256":"87c3b12b0eca676115e6a00943a1e285f2bd76b811bbf5e2b83252be50776141","abstract_canon_sha256":"7844fb4dbe8cd86ed6deb09bd257f4c84a99c2341a48e413f1de931654dc4902"},"schema_version":"1.0"},"canonical_sha256":"169dd9346e9865daae9e2314899843f10bac881f09c9cb95eabf2bcebbe26c66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:30.974792Z","signature_b64":"NX/YTKn1POaDc5iEggGqj8etr3/4ib/tFQ7NWJ/2WfPMta/wlkI6wpj1eJKpzloqUIbvQ6Igzg+oXc2xmHQADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"169dd9346e9865daae9e2314899843f10bac881f09c9cb95eabf2bcebbe26c66","last_reissued_at":"2026-05-18T03:46:30.973950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:30.973950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.5407","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-18T03:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"za34ctdLwci53QfeWggIlQNEfX30J0mO/6bY8mOvhLgVGawaY8ZhQKgXp9fNiYvvZwhofqmsJ7FM3HsgIJD3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:51.792422Z"},"content_sha256":"8b9952880604f8a379c49d2d22fe329119d5df1e0accf2306b7e010ec5e88fcf","schema_version":"1.0","event_id":"sha256:8b9952880604f8a379c49d2d22fe329119d5df1e0accf2306b7e010ec5e88fcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:C2O5SNDOTBS5VLU6EMKITGCD6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FASTSUBS: An Efficient and Exact Procedure for Finding the Most Likely Lexical Substitutes Based on an N-gram Language Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Deniz Yuret","submitted_at":"2012-05-24T11:53:41Z","abstract_excerpt":"Lexical substitutes have found use in areas such as paraphrasing, text simplification, machine translation, word sense disambiguation, and part of speech induction. However the computational complexity of accurately identifying the most likely substitutes for a word has made large scale experiments difficult. In this paper I introduce a new search algorithm, FASTSUBS, that is guaranteed to find the K most likely lexical substitutes for a given word in a sentence based on an n-gram language model. The computation is sub-linear in both K and the vocabulary size V. An implementation of the algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5407","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-18T03:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyUrvOpuNank4ZABgW9STS5EC0rzSx3vyq3894l8PUNWTekR7AonIfi8RfPtvqIVj36zpucWpscRhm+PloNZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:51.793070Z"},"content_sha256":"e7221285d23f7265719ba4821973fdadd097d8ad068d76f1924cb5e10dd219d6","schema_version":"1.0","event_id":"sha256:e7221285d23f7265719ba4821973fdadd097d8ad068d76f1924cb5e10dd219d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2O5SNDOTBS5VLU6EMKITGCD6E/bundle.json","state_url":"https://pith.science/pith/C2O5SNDOTBS5VLU6EMKITGCD6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2O5SNDOTBS5VLU6EMKITGCD6E/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-09T06:13:51Z","links":{"resolver":"https://pith.science/pith/C2O5SNDOTBS5VLU6EMKITGCD6E","bundle":"https://pith.science/pith/C2O5SNDOTBS5VLU6EMKITGCD6E/bundle.json","state":"https://pith.science/pith/C2O5SNDOTBS5VLU6EMKITGCD6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2O5SNDOTBS5VLU6EMKITGCD6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C2O5SNDOTBS5VLU6EMKITGCD6E","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":"7844fb4dbe8cd86ed6deb09bd257f4c84a99c2341a48e413f1de931654dc4902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-05-24T11:53:41Z","title_canon_sha256":"87c3b12b0eca676115e6a00943a1e285f2bd76b811bbf5e2b83252be50776141"},"schema_version":"1.0","source":{"id":"1205.5407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5407","created_at":"2026-05-18T03:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5407v2","created_at":"2026-05-18T03:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5407","created_at":"2026-05-18T03:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"C2O5SNDOTBS5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C2O5SNDOTBS5VLU6","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C2O5SNDO","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:e7221285d23f7265719ba4821973fdadd097d8ad068d76f1924cb5e10dd219d6","target":"graph","created_at":"2026-05-18T03:46:30Z","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":"Lexical substitutes have found use in areas such as paraphrasing, text simplification, machine translation, word sense disambiguation, and part of speech induction. However the computational complexity of accurately identifying the most likely substitutes for a word has made large scale experiments difficult. In this paper I introduce a new search algorithm, FASTSUBS, that is guaranteed to find the K most likely lexical substitutes for a given word in a sentence based on an n-gram language model. The computation is sub-linear in both K and the vocabulary size V. An implementation of the algori","authors_text":"Deniz Yuret","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-05-24T11:53:41Z","title":"FASTSUBS: An Efficient and Exact Procedure for Finding the Most Likely Lexical Substitutes Based on an N-gram Language Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5407","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:8b9952880604f8a379c49d2d22fe329119d5df1e0accf2306b7e010ec5e88fcf","target":"record","created_at":"2026-05-18T03:46:30Z","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":"7844fb4dbe8cd86ed6deb09bd257f4c84a99c2341a48e413f1de931654dc4902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-05-24T11:53:41Z","title_canon_sha256":"87c3b12b0eca676115e6a00943a1e285f2bd76b811bbf5e2b83252be50776141"},"schema_version":"1.0","source":{"id":"1205.5407","kind":"arxiv","version":2}},"canonical_sha256":"169dd9346e9865daae9e2314899843f10bac881f09c9cb95eabf2bcebbe26c66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"169dd9346e9865daae9e2314899843f10bac881f09c9cb95eabf2bcebbe26c66","first_computed_at":"2026-05-18T03:46:30.973950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:30.973950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NX/YTKn1POaDc5iEggGqj8etr3/4ib/tFQ7NWJ/2WfPMta/wlkI6wpj1eJKpzloqUIbvQ6Igzg+oXc2xmHQADw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:30.974792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.5407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b9952880604f8a379c49d2d22fe329119d5df1e0accf2306b7e010ec5e88fcf","sha256:e7221285d23f7265719ba4821973fdadd097d8ad068d76f1924cb5e10dd219d6"],"state_sha256":"1932de640ad6683d507f792fe09641e06c4d8cd1736c75014487ec4663c21ec0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m4k2x9k0g5cJvq0UKZQAc0sPgLhkymktN2m+qu/IJ9S6UUSXlP07sRSWH6+oLDIqrLJB+tIeH7ogulYLhcRiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:13:51.796764Z","bundle_sha256":"4519c612e0bfd1c16aecd85a05909b392659fa6d18ab1275ebc2b94a4fecf2bd"}}