{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MUGLGSJ23L7PL7R6WC4H6WWH5O","short_pith_number":"pith:MUGLGSJ2","canonical_record":{"source":{"id":"1506.01245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T13:53:05Z","cross_cats_sorted":[],"title_canon_sha256":"ceba433ceeb07ff276e91e5c2a5d96681e47a334fdc411eeb3f733d48420f183","abstract_canon_sha256":"f287f900bc976913f783d39261f7f0546e2fe553cb2f491a78bf29f59cf51e15"},"schema_version":"1.0"},"canonical_sha256":"650cb3493adafef5fe3eb0b87f5ac7eb856f1bf7b9051bc29252e5d711c39ce3","source":{"kind":"arxiv","id":"1506.01245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01245","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01245v1","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01245","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"MUGLGSJ23L7P","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MUGLGSJ23L7PL7R6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MUGLGSJ2","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MUGLGSJ23L7PL7R6WC4H6WWH5O","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T13:53:05Z","cross_cats_sorted":[],"title_canon_sha256":"ceba433ceeb07ff276e91e5c2a5d96681e47a334fdc411eeb3f733d48420f183","abstract_canon_sha256":"f287f900bc976913f783d39261f7f0546e2fe553cb2f491a78bf29f59cf51e15"},"schema_version":"1.0"},"canonical_sha256":"650cb3493adafef5fe3eb0b87f5ac7eb856f1bf7b9051bc29252e5d711c39ce3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:52.274101Z","signature_b64":"kCeOsS+3fo9y3rednXcOoyDGFTD8nY6TomZnkWTJsa4BZ1kpEUqWHug0F8q50QaAylF1Yo8n+VoSXTZRUeKCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650cb3493adafef5fe3eb0b87f5ac7eb856f1bf7b9051bc29252e5d711c39ce3","last_reissued_at":"2026-05-18T01:55:52.273714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:52.273714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01245","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-18T01:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hoIvApYOhnqDSScs8D18a0d6nUrLCDuSet+Bi/b/vBGct5/Cy7OGypZJGPn1Q7k/5AN9YX75iH6WEJACI6ouCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:00:51.918673Z"},"content_sha256":"411dd90212fd2eda0eb96bea64c4b4ba5c31fa83f91052c7f5469eb4bbf927b6","schema_version":"1.0","event_id":"sha256:411dd90212fd2eda0eb96bea64c4b4ba5c31fa83f91052c7f5469eb4bbf927b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MUGLGSJ23L7PL7R6WC4H6WWH5O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A density compensation-based path computing model for measuring semantic similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fei Li, Hongchao Chen, Qi Peng, Xinhua Zhu","submitted_at":"2015-06-03T13:53:05Z","abstract_excerpt":"The shortest path between two concepts in a taxonomic ontology is commonly used to represent the semantic distance between concepts in the edge-based semantic similarity measures. In the past, the edge counting is considered to be the default method for the path computation, which is simple, intuitive and has low computational complexity. However, a large lexical taxonomy of such as WordNet has the irregular densities of links between concepts due to its broad domain but. The edge counting-based path computation is powerless for this non-uniformity problem. In this paper, we advocate that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01245","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-18T01:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a4pYXTlTInofUdSjQiFuuqygAsAOcRk3I4le3BVfMiGOYr5wA5Zb3wVWAPC7sljfj2d1ks3vGekmMuF79b0vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:00:51.919336Z"},"content_sha256":"552b7d41b0dcdf3f8888de3375230e70a44a7b11cca7f1d5648eb9c98f0ba363","schema_version":"1.0","event_id":"sha256:552b7d41b0dcdf3f8888de3375230e70a44a7b11cca7f1d5648eb9c98f0ba363"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUGLGSJ23L7PL7R6WC4H6WWH5O/bundle.json","state_url":"https://pith.science/pith/MUGLGSJ23L7PL7R6WC4H6WWH5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUGLGSJ23L7PL7R6WC4H6WWH5O/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-05-30T05:00:51Z","links":{"resolver":"https://pith.science/pith/MUGLGSJ23L7PL7R6WC4H6WWH5O","bundle":"https://pith.science/pith/MUGLGSJ23L7PL7R6WC4H6WWH5O/bundle.json","state":"https://pith.science/pith/MUGLGSJ23L7PL7R6WC4H6WWH5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUGLGSJ23L7PL7R6WC4H6WWH5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MUGLGSJ23L7PL7R6WC4H6WWH5O","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":"f287f900bc976913f783d39261f7f0546e2fe553cb2f491a78bf29f59cf51e15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T13:53:05Z","title_canon_sha256":"ceba433ceeb07ff276e91e5c2a5d96681e47a334fdc411eeb3f733d48420f183"},"schema_version":"1.0","source":{"id":"1506.01245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01245","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01245v1","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01245","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"MUGLGSJ23L7P","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MUGLGSJ23L7PL7R6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MUGLGSJ2","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:552b7d41b0dcdf3f8888de3375230e70a44a7b11cca7f1d5648eb9c98f0ba363","target":"graph","created_at":"2026-05-18T01:55:52Z","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 shortest path between two concepts in a taxonomic ontology is commonly used to represent the semantic distance between concepts in the edge-based semantic similarity measures. In the past, the edge counting is considered to be the default method for the path computation, which is simple, intuitive and has low computational complexity. However, a large lexical taxonomy of such as WordNet has the irregular densities of links between concepts due to its broad domain but. The edge counting-based path computation is powerless for this non-uniformity problem. In this paper, we advocate that the ","authors_text":"Fei Li, Hongchao Chen, Qi Peng, Xinhua Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T13:53:05Z","title":"A density compensation-based path computing model for measuring semantic similarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01245","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:411dd90212fd2eda0eb96bea64c4b4ba5c31fa83f91052c7f5469eb4bbf927b6","target":"record","created_at":"2026-05-18T01:55:52Z","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":"f287f900bc976913f783d39261f7f0546e2fe553cb2f491a78bf29f59cf51e15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T13:53:05Z","title_canon_sha256":"ceba433ceeb07ff276e91e5c2a5d96681e47a334fdc411eeb3f733d48420f183"},"schema_version":"1.0","source":{"id":"1506.01245","kind":"arxiv","version":1}},"canonical_sha256":"650cb3493adafef5fe3eb0b87f5ac7eb856f1bf7b9051bc29252e5d711c39ce3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"650cb3493adafef5fe3eb0b87f5ac7eb856f1bf7b9051bc29252e5d711c39ce3","first_computed_at":"2026-05-18T01:55:52.273714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:52.273714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kCeOsS+3fo9y3rednXcOoyDGFTD8nY6TomZnkWTJsa4BZ1kpEUqWHug0F8q50QaAylF1Yo8n+VoSXTZRUeKCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:52.274101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:411dd90212fd2eda0eb96bea64c4b4ba5c31fa83f91052c7f5469eb4bbf927b6","sha256:552b7d41b0dcdf3f8888de3375230e70a44a7b11cca7f1d5648eb9c98f0ba363"],"state_sha256":"8acb3d3f82c6e761a6df56e84e77a5e420e88bbc0d078b8f3c9f8eb23cecca19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JftXzr8SJ2xOkLUj8mi0g0kFlk8XI2L72AE1JIoC1r4sInerB/fDVwxziPYcjjjXQuTI0RKGcyYjyDpMGd9cBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:00:51.922786Z","bundle_sha256":"6d0bf069bec3bccd1a68919b8368a9aba0e867734eb2692ffe6d6e1a5ba81484"}}