{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:INGYYN3HRPWMB4HJZXWW5YJX7S","short_pith_number":"pith:INGYYN3H","canonical_record":{"source":{"id":"2310.12379","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-18T23:13:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"608c8e54939b05a267270338a70707272e6f7b0fd3e351445cdb1abad389080a","abstract_canon_sha256":"19a870c5bb1c94d117936dae9bf12ec491366b06e5f79d2c93cfad3f753aefe2"},"schema_version":"1.0"},"canonical_sha256":"434d8c37678becc0f0e9cded6ee137fc8431f49d51333874ba16e05b58634073","source":{"kind":"arxiv","id":"2310.12379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.12379","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"2310.12379v1","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12379","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"INGYYN3HRPWM","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"pith_short_16","alias_value":"INGYYN3HRPWMB4HJ","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"pith_short_8","alias_value":"INGYYN3H","created_at":"2026-07-05T07:02:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:INGYYN3HRPWMB4HJZXWW5YJX7S","target":"record","payload":{"canonical_record":{"source":{"id":"2310.12379","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-18T23:13:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"608c8e54939b05a267270338a70707272e6f7b0fd3e351445cdb1abad389080a","abstract_canon_sha256":"19a870c5bb1c94d117936dae9bf12ec491366b06e5f79d2c93cfad3f753aefe2"},"schema_version":"1.0"},"canonical_sha256":"434d8c37678becc0f0e9cded6ee137fc8431f49d51333874ba16e05b58634073","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:37.251578Z","signature_b64":"Alr7uev1ifJGnKfAJhLoZxlaOevhFpo/TnEnz8vxvsVJqD0+aUg9p4SOAipt94O0e1hy3aZ3cGvQoQefd0IBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"434d8c37678becc0f0e9cded6ee137fc8431f49d51333874ba16e05b58634073","last_reissued_at":"2026-07-05T07:02:37.250942Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:37.250942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.12379","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-05T07:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4hL+EK0QYeMoyMSd4LCo6zxB5RgmGiXOhl0oR+eCH+8BUuNEkYMiho2Hp2ap2TkDhyxy+n4IStHf/sIsOEsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:59:09.021427Z"},"content_sha256":"3eca93e58dd11ede807c49aaf706b97d1157c8a1545640d03de9f95e32ba1b96","schema_version":"1.0","event_id":"sha256:3eca93e58dd11ede807c49aaf706b97d1157c8a1545640d03de9f95e32ba1b96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:INGYYN3HRPWMB4HJZXWW5YJX7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Hard Analogy Questions with Relation Embedding Chains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Nitesh Kumar, Steven Schockaert","submitted_at":"2023-10-18T23:13:22Z","abstract_excerpt":"Modelling how concepts are related is a central topic in Lexical Semantics. A common strategy is to rely on knowledge graphs (KGs) such as ConceptNet, and to model the relation between two concepts as a set of paths. However, KGs are limited to a fixed set of relation types, and they are incomplete and often noisy. Another strategy is to distill relation embeddings from a fine-tuned language model. However, this is less suitable for words that are only indirectly related and it does not readily allow us to incorporate structured domain knowledge. In this paper, we aim to combine the best of bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12379","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/2310.12379/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-05T07:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alTs6WQkzqkrahUEOXWy58jpcKCHfmVYUurRUBTwKxjOW6wC9MQqeIv2AB0zBiIM7nwrY720VwuxpbYI7exvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:59:09.021967Z"},"content_sha256":"ee113cf040c00a7e6f43cc576ea14c21370bc3e51bad2af8d7f3c4a760dde2cb","schema_version":"1.0","event_id":"sha256:ee113cf040c00a7e6f43cc576ea14c21370bc3e51bad2af8d7f3c4a760dde2cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INGYYN3HRPWMB4HJZXWW5YJX7S/bundle.json","state_url":"https://pith.science/pith/INGYYN3HRPWMB4HJZXWW5YJX7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INGYYN3HRPWMB4HJZXWW5YJX7S/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-04T19:59:09Z","links":{"resolver":"https://pith.science/pith/INGYYN3HRPWMB4HJZXWW5YJX7S","bundle":"https://pith.science/pith/INGYYN3HRPWMB4HJZXWW5YJX7S/bundle.json","state":"https://pith.science/pith/INGYYN3HRPWMB4HJZXWW5YJX7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INGYYN3HRPWMB4HJZXWW5YJX7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:INGYYN3HRPWMB4HJZXWW5YJX7S","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":"19a870c5bb1c94d117936dae9bf12ec491366b06e5f79d2c93cfad3f753aefe2","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-18T23:13:22Z","title_canon_sha256":"608c8e54939b05a267270338a70707272e6f7b0fd3e351445cdb1abad389080a"},"schema_version":"1.0","source":{"id":"2310.12379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.12379","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"2310.12379v1","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12379","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"INGYYN3HRPWM","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"pith_short_16","alias_value":"INGYYN3HRPWMB4HJ","created_at":"2026-07-05T07:02:37Z"},{"alias_kind":"pith_short_8","alias_value":"INGYYN3H","created_at":"2026-07-05T07:02:37Z"}],"graph_snapshots":[{"event_id":"sha256:ee113cf040c00a7e6f43cc576ea14c21370bc3e51bad2af8d7f3c4a760dde2cb","target":"graph","created_at":"2026-07-05T07:02:37Z","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/2310.12379/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Modelling how concepts are related is a central topic in Lexical Semantics. A common strategy is to rely on knowledge graphs (KGs) such as ConceptNet, and to model the relation between two concepts as a set of paths. However, KGs are limited to a fixed set of relation types, and they are incomplete and often noisy. Another strategy is to distill relation embeddings from a fine-tuned language model. However, this is less suitable for words that are only indirectly related and it does not readily allow us to incorporate structured domain knowledge. In this paper, we aim to combine the best of bo","authors_text":"Nitesh Kumar, Steven Schockaert","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-18T23:13:22Z","title":"Solving Hard Analogy Questions with Relation Embedding Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12379","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:3eca93e58dd11ede807c49aaf706b97d1157c8a1545640d03de9f95e32ba1b96","target":"record","created_at":"2026-07-05T07:02:37Z","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":"19a870c5bb1c94d117936dae9bf12ec491366b06e5f79d2c93cfad3f753aefe2","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-18T23:13:22Z","title_canon_sha256":"608c8e54939b05a267270338a70707272e6f7b0fd3e351445cdb1abad389080a"},"schema_version":"1.0","source":{"id":"2310.12379","kind":"arxiv","version":1}},"canonical_sha256":"434d8c37678becc0f0e9cded6ee137fc8431f49d51333874ba16e05b58634073","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"434d8c37678becc0f0e9cded6ee137fc8431f49d51333874ba16e05b58634073","first_computed_at":"2026-07-05T07:02:37.250942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:02:37.250942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Alr7uev1ifJGnKfAJhLoZxlaOevhFpo/TnEnz8vxvsVJqD0+aUg9p4SOAipt94O0e1hy3aZ3cGvQoQefd0IBAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:02:37.251578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.12379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eca93e58dd11ede807c49aaf706b97d1157c8a1545640d03de9f95e32ba1b96","sha256:ee113cf040c00a7e6f43cc576ea14c21370bc3e51bad2af8d7f3c4a760dde2cb"],"state_sha256":"df9833867d83537231f8271d5ec7a5780d344408fd368918a1b86d15799a7aa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dFfmW/qCXVy5I0r0svKz5uKjvCNL3rA978vj228tWiTYYd+dhhUtxvGp0I2ADGHxqmXXgU3cAYXJZLnAEAoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T19:59:09.027995Z","bundle_sha256":"e17364c0f7e617e1c5e80d3afe6383b3692356820e4ee634abac75e2769985cc"}}