{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KCG54JKZM7TFLLO4SZTDAUIGA4","short_pith_number":"pith:KCG54JKZ","canonical_record":{"source":{"id":"1709.06673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-19T23:09:15Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"c278e4a2f671d2d2f8de0d0b433a3666f825d5c3a93d42570de44539b620642a","abstract_canon_sha256":"b28caeaa369aead67390560cecf6726b8fa58afafb9b3b94601829527c1036e5"},"schema_version":"1.0"},"canonical_sha256":"508dde255967e655addc96663051060736902848c905e65693d16ded8b51ebc1","source":{"kind":"arxiv","id":"1709.06673","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06673","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06673v2","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06673","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"KCG54JKZM7TF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KCG54JKZM7TFLLO4","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KCG54JKZ","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KCG54JKZM7TFLLO4SZTDAUIGA4","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-19T23:09:15Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"c278e4a2f671d2d2f8de0d0b433a3666f825d5c3a93d42570de44539b620642a","abstract_canon_sha256":"b28caeaa369aead67390560cecf6726b8fa58afafb9b3b94601829527c1036e5"},"schema_version":"1.0"},"canonical_sha256":"508dde255967e655addc96663051060736902848c905e65693d16ded8b51ebc1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:56.993011Z","signature_b64":"mD4e1GsN8r0iL2zmNfDrvbkMNlVvW+nvSjVZDddcimaZlPrCEbbcBj2DRoba80tMvSkzEfri3/caQ3GUPZOgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"508dde255967e655addc96663051060736902848c905e65693d16ded8b51ebc1","last_reissued_at":"2026-05-18T00:27:56.992383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:56.992383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06673","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-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xW0gN8qp8jZKry/3Z8RRK+O8YIylBN7H4dKN0FFC22UOPoZ4L2zkIa1qow7AWK3PLBypjJ9NValV0qSGCIbCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:50:53.811306Z"},"content_sha256":"f5fa2fdde63262ba09fda2b04838c52428c4ff1a72701471f6d26d2ae57bd84a","schema_version":"1.0","event_id":"sha256:f5fa2fdde63262ba09fda2b04838c52428c4ff1a72701471f6d26d2ae57bd84a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KCG54JKZM7TFLLO4SZTDAUIGA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Why PairDiff works? -- A Mathematical Analysis of Bilinear Relational Compositional Operators for Analogy Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Danushka Bollegala, Hayashi Kohei, Huda Hakami","submitted_at":"2017-09-19T23:09:15Z","abstract_excerpt":"Representing the semantic relations that exist between two given words (or entities) is an important first step in a wide-range of NLP applications such as analogical reasoning, knowledge base completion and relational information retrieval. A simple, yet surprisingly accurate method for representing a relation between two words is to compute the vector offset (\\PairDiff) between their corresponding word embeddings. Despite the empirical success, it remains unclear as to whether \\PairDiff is the best operator for obtaining a relational representation from word embeddings. We conduct a theoreti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06673","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-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6RDznBEYVhi/i/wujv+rBarSHPjdoM3p7bjtaKAQnQzo+zWf21SqUJVY3DnpW0XiGqP1I8PE1j7/I7F3NWpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:50:53.812145Z"},"content_sha256":"4057482df718346ae53bff5c4643ccf2c6c9185bf78a7148d919047a6cb3eca0","schema_version":"1.0","event_id":"sha256:4057482df718346ae53bff5c4643ccf2c6c9185bf78a7148d919047a6cb3eca0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCG54JKZM7TFLLO4SZTDAUIGA4/bundle.json","state_url":"https://pith.science/pith/KCG54JKZM7TFLLO4SZTDAUIGA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCG54JKZM7TFLLO4SZTDAUIGA4/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-11T19:50:53Z","links":{"resolver":"https://pith.science/pith/KCG54JKZM7TFLLO4SZTDAUIGA4","bundle":"https://pith.science/pith/KCG54JKZM7TFLLO4SZTDAUIGA4/bundle.json","state":"https://pith.science/pith/KCG54JKZM7TFLLO4SZTDAUIGA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCG54JKZM7TFLLO4SZTDAUIGA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KCG54JKZM7TFLLO4SZTDAUIGA4","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":"b28caeaa369aead67390560cecf6726b8fa58afafb9b3b94601829527c1036e5","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-19T23:09:15Z","title_canon_sha256":"c278e4a2f671d2d2f8de0d0b433a3666f825d5c3a93d42570de44539b620642a"},"schema_version":"1.0","source":{"id":"1709.06673","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06673","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06673v2","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06673","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"KCG54JKZM7TF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KCG54JKZM7TFLLO4","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KCG54JKZ","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:4057482df718346ae53bff5c4643ccf2c6c9185bf78a7148d919047a6cb3eca0","target":"graph","created_at":"2026-05-18T00:27:56Z","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":"Representing the semantic relations that exist between two given words (or entities) is an important first step in a wide-range of NLP applications such as analogical reasoning, knowledge base completion and relational information retrieval. A simple, yet surprisingly accurate method for representing a relation between two words is to compute the vector offset (\\PairDiff) between their corresponding word embeddings. Despite the empirical success, it remains unclear as to whether \\PairDiff is the best operator for obtaining a relational representation from word embeddings. We conduct a theoreti","authors_text":"Danushka Bollegala, Hayashi Kohei, Huda Hakami","cross_cats":["cs.AI","cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-19T23:09:15Z","title":"Why PairDiff works? -- A Mathematical Analysis of Bilinear Relational Compositional Operators for Analogy Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06673","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:f5fa2fdde63262ba09fda2b04838c52428c4ff1a72701471f6d26d2ae57bd84a","target":"record","created_at":"2026-05-18T00:27:56Z","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":"b28caeaa369aead67390560cecf6726b8fa58afafb9b3b94601829527c1036e5","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-09-19T23:09:15Z","title_canon_sha256":"c278e4a2f671d2d2f8de0d0b433a3666f825d5c3a93d42570de44539b620642a"},"schema_version":"1.0","source":{"id":"1709.06673","kind":"arxiv","version":2}},"canonical_sha256":"508dde255967e655addc96663051060736902848c905e65693d16ded8b51ebc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"508dde255967e655addc96663051060736902848c905e65693d16ded8b51ebc1","first_computed_at":"2026-05-18T00:27:56.992383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:56.992383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mD4e1GsN8r0iL2zmNfDrvbkMNlVvW+nvSjVZDddcimaZlPrCEbbcBj2DRoba80tMvSkzEfri3/caQ3GUPZOgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:56.993011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06673","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5fa2fdde63262ba09fda2b04838c52428c4ff1a72701471f6d26d2ae57bd84a","sha256:4057482df718346ae53bff5c4643ccf2c6c9185bf78a7148d919047a6cb3eca0"],"state_sha256":"a248ac8b039c253bbed49fc6ea1db7cffd7a75e46ee3618904e7de06026f23d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpiSgeYpNaMYBDEY0yH+oZzsT7bBBnfsvAOgAZM4JohjLgDdu+QEXx6i+lCsV+JoOu5/n4wZ5NfTqDUnDYYdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:50:53.815918Z","bundle_sha256":"766f962018796a463b81092fb5405af1d82dcf20eb29ce04f67ad77cc5cd221a"}}