{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:PIFBYF2GBBIDL2AKA7HDNTGAOU","short_pith_number":"pith:PIFBYF2G","canonical_record":{"source":{"id":"cs/0508103","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2005-08-23T20:21:56Z","cross_cats_sorted":["cs.CL","cs.IR"],"title_canon_sha256":"3e143f9f4e085c5314a1bc2e84cadd0fa3d72de56201c457a25e90d7704d380d","abstract_canon_sha256":"f9f9a2cd65f32464d0e49db729347c45965911ebd3cf1e41fb1ccec02cb0540e"},"schema_version":"1.0"},"canonical_sha256":"7a0a1c1746085035e80a07ce36ccc0751313557933cf4348ced5fa99b3c40efa","source":{"kind":"arxiv","id":"cs/0508103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508103","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508103v1","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508103","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"PIFBYF2GBBID","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"pith_short_16","alias_value":"PIFBYF2GBBIDL2AK","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"pith_short_8","alias_value":"PIFBYF2G","created_at":"2026-07-04T14:25:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:PIFBYF2GBBIDL2AKA7HDNTGAOU","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0508103","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2005-08-23T20:21:56Z","cross_cats_sorted":["cs.CL","cs.IR"],"title_canon_sha256":"3e143f9f4e085c5314a1bc2e84cadd0fa3d72de56201c457a25e90d7704d380d","abstract_canon_sha256":"f9f9a2cd65f32464d0e49db729347c45965911ebd3cf1e41fb1ccec02cb0540e"},"schema_version":"1.0"},"canonical_sha256":"7a0a1c1746085035e80a07ce36ccc0751313557933cf4348ced5fa99b3c40efa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:25:04.898060Z","signature_b64":"v5to30xWxIvxXsT6vQLJC5n4NpS/EOA8XPxNbMYRLFc45Buiv05kKNb9L8MQqzgMrCNqTjiiR+SO/yjM4IQkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a0a1c1746085035e80a07ce36ccc0751313557933cf4348ced5fa99b3c40efa","last_reissued_at":"2026-07-04T14:25:04.897662Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:25:04.897662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0508103","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-04T14:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"isA2T7J3gwbYin/HVUwlGJAJRwsLUh6tCa77kBwqv4DpcJa1z519+BdqNw0LtY3S0Q80uTOq+xiXt8WuoBQeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:26:17.940586Z"},"content_sha256":"d49cad5ad0057bd0925eda3acc802007e22e520f0403aba4916fc3b279c60ced","schema_version":"1.0","event_id":"sha256:d49cad5ad0057bd0925eda3acc802007e22e520f0403aba4916fc3b279c60ced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:PIFBYF2GBBIDL2AKA7HDNTGAOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Corpus-based Learning of Analogies and Semantic Relations","license":"","headline":"","cross_cats":["cs.CL","cs.IR"],"primary_cat":"cs.LG","authors_text":"Michael L. Littman (Rutgers University), Peter D. Turney (National Research Council of Canada)","submitted_at":"2005-08-23T20:21:56Z","abstract_excerpt":"We present an algorithm for learning from unlabeled text, based on the Vector Space Model (VSM) of information retrieval, that can solve verbal analogy questions of the kind found in the SAT college entrance exam. A verbal analogy has the form A:B::C:D, meaning \"A is to B as C is to D\"; for example, mason:stone::carpenter:wood. SAT analogy questions provide a word pair, A:B, and the problem is to select the most analogous word pair, C:D, from a set of five choices. The VSM algorithm correctly answers 47% of a collection of 374 college-level analogy questions (random guessing would yield 20% co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508103","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/cs/0508103/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-04T14:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPzRqQlQf6OqHhS4Z51tiedQbOQp/57s3f2atjY5jtxZqnE4VcH/Wwx6s1AToMYSOCznbLufDTv2rIedkqfxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:26:17.941049Z"},"content_sha256":"4eaff8f82fe3174ad5a89970ff6d9ce513a4731e8964d4c0b1c399534c3cba9c","schema_version":"1.0","event_id":"sha256:4eaff8f82fe3174ad5a89970ff6d9ce513a4731e8964d4c0b1c399534c3cba9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIFBYF2GBBIDL2AKA7HDNTGAOU/bundle.json","state_url":"https://pith.science/pith/PIFBYF2GBBIDL2AKA7HDNTGAOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIFBYF2GBBIDL2AKA7HDNTGAOU/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-04T20:26:17Z","links":{"resolver":"https://pith.science/pith/PIFBYF2GBBIDL2AKA7HDNTGAOU","bundle":"https://pith.science/pith/PIFBYF2GBBIDL2AKA7HDNTGAOU/bundle.json","state":"https://pith.science/pith/PIFBYF2GBBIDL2AKA7HDNTGAOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIFBYF2GBBIDL2AKA7HDNTGAOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:PIFBYF2GBBIDL2AKA7HDNTGAOU","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":"f9f9a2cd65f32464d0e49db729347c45965911ebd3cf1e41fb1ccec02cb0540e","cross_cats_sorted":["cs.CL","cs.IR"],"license":"","primary_cat":"cs.LG","submitted_at":"2005-08-23T20:21:56Z","title_canon_sha256":"3e143f9f4e085c5314a1bc2e84cadd0fa3d72de56201c457a25e90d7704d380d"},"schema_version":"1.0","source":{"id":"cs/0508103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508103","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508103v1","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508103","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"PIFBYF2GBBID","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"pith_short_16","alias_value":"PIFBYF2GBBIDL2AK","created_at":"2026-07-04T14:25:04Z"},{"alias_kind":"pith_short_8","alias_value":"PIFBYF2G","created_at":"2026-07-04T14:25:04Z"}],"graph_snapshots":[{"event_id":"sha256:4eaff8f82fe3174ad5a89970ff6d9ce513a4731e8964d4c0b1c399534c3cba9c","target":"graph","created_at":"2026-07-04T14:25:04Z","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/cs/0508103/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an algorithm for learning from unlabeled text, based on the Vector Space Model (VSM) of information retrieval, that can solve verbal analogy questions of the kind found in the SAT college entrance exam. A verbal analogy has the form A:B::C:D, meaning \"A is to B as C is to D\"; for example, mason:stone::carpenter:wood. SAT analogy questions provide a word pair, A:B, and the problem is to select the most analogous word pair, C:D, from a set of five choices. The VSM algorithm correctly answers 47% of a collection of 374 college-level analogy questions (random guessing would yield 20% co","authors_text":"Michael L. Littman (Rutgers University), Peter D. Turney (National Research Council of Canada)","cross_cats":["cs.CL","cs.IR"],"headline":"","license":"","primary_cat":"cs.LG","submitted_at":"2005-08-23T20:21:56Z","title":"Corpus-based Learning of Analogies and Semantic Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508103","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:d49cad5ad0057bd0925eda3acc802007e22e520f0403aba4916fc3b279c60ced","target":"record","created_at":"2026-07-04T14:25:04Z","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":"f9f9a2cd65f32464d0e49db729347c45965911ebd3cf1e41fb1ccec02cb0540e","cross_cats_sorted":["cs.CL","cs.IR"],"license":"","primary_cat":"cs.LG","submitted_at":"2005-08-23T20:21:56Z","title_canon_sha256":"3e143f9f4e085c5314a1bc2e84cadd0fa3d72de56201c457a25e90d7704d380d"},"schema_version":"1.0","source":{"id":"cs/0508103","kind":"arxiv","version":1}},"canonical_sha256":"7a0a1c1746085035e80a07ce36ccc0751313557933cf4348ced5fa99b3c40efa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a0a1c1746085035e80a07ce36ccc0751313557933cf4348ced5fa99b3c40efa","first_computed_at":"2026-07-04T14:25:04.897662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:25:04.897662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v5to30xWxIvxXsT6vQLJC5n4NpS/EOA8XPxNbMYRLFc45Buiv05kKNb9L8MQqzgMrCNqTjiiR+SO/yjM4IQkCg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:25:04.898060Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0508103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d49cad5ad0057bd0925eda3acc802007e22e520f0403aba4916fc3b279c60ced","sha256:4eaff8f82fe3174ad5a89970ff6d9ce513a4731e8964d4c0b1c399534c3cba9c"],"state_sha256":"504f7f3f5072f3e4247bce11b42c4a02c86782af269c0f5c5153b234b382a03c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+lfFsmzVc4OjrgRmd8JtdeiUTNLjDQyyrxDPf+7GyIMXOgzyyxIx/UNbWyQvUNCjr2uyzdL5h3k+pR3B4LjSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T20:26:17.943245Z","bundle_sha256":"530da01ec0fcbe714d36d540006b8b42b98f16e1cf415826d897427af236918c"}}