{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C5DYWA4LJRUQJRIYJ3XR6MIKUL","short_pith_number":"pith:C5DYWA4L","canonical_record":{"source":{"id":"1701.05311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-19T06:38:33Z","cross_cats_sorted":["cs.AI","cs.CL","math.PR"],"title_canon_sha256":"4e22488ce9fa84c2f5de5aeb1df476623b07e9490c2f142d3228351b2fb5d415","abstract_canon_sha256":"6eafcc9a0745c40782725b7cac7ab1e2e314fb1a6527346e8da816675f66374c"},"schema_version":"1.0"},"canonical_sha256":"17478b038b4c6904c5184eef1f310aa2d351251cf4f3b7f74b65c5048189b58b","source":{"kind":"arxiv","id":"1701.05311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05311","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05311v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05311","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"C5DYWA4LJRUQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C5DYWA4LJRUQJRIY","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C5DYWA4L","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C5DYWA4LJRUQJRIYJ3XR6MIKUL","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-19T06:38:33Z","cross_cats_sorted":["cs.AI","cs.CL","math.PR"],"title_canon_sha256":"4e22488ce9fa84c2f5de5aeb1df476623b07e9490c2f142d3228351b2fb5d415","abstract_canon_sha256":"6eafcc9a0745c40782725b7cac7ab1e2e314fb1a6527346e8da816675f66374c"},"schema_version":"1.0"},"canonical_sha256":"17478b038b4c6904c5184eef1f310aa2d351251cf4f3b7f74b65c5048189b58b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:30.288892Z","signature_b64":"VmC90Xh1tK5MYgMwXPqksNiJ6CJn9giKZM+Rabs1QZNfROIFlhgSI4bDsHsqa1qZ/JftaFCTWN4/9Z+72Ih6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17478b038b4c6904c5184eef1f310aa2d351251cf4f3b7f74b65c5048189b58b","last_reissued_at":"2026-05-18T00:52:30.288447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:30.288447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05311","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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2HZ3RG6mnOt7Ka+mzUjBS3p4EWrCkXQCr5wr9SBWSg/OdvKKZk5ZwUsdSbNtwtKV3jUmIJeTdLsB+cCxHEZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:13:44.795541Z"},"content_sha256":"c5e234386349cee81c86c5547a26774c5fb537c3e076c21028f94a4cda328c47","schema_version":"1.0","event_id":"sha256:c5e234386349cee81c86c5547a26774c5fb537c3e076c21028f94a4cda328c47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C5DYWA4LJRUQJRIYJ3XR6MIKUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semantic Evolutionary Concept Distances for Effective Information Retrieval in Query Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","math.PR"],"primary_cat":"cs.IR","authors_text":"Alfredo Milani, Clement H.C.Leung, Valentina Franzoni, Yuanxi Li","submitted_at":"2017-01-19T06:38:33Z","abstract_excerpt":"In this work several semantic approaches to concept-based query expansion and reranking schemes are studied and compared with different ontology-based expansion methods in web document search and retrieval. In particular, we focus on concept-based query expansion schemes, where, in order to effectively increase the precision of web document retrieval and to decrease the users browsing time, the main goal is to quickly provide users with the most suitable query expansion. Two key tasks for query expansion in web document retrieval are to find the expansion candidates, as the closest concepts in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05311","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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q0xqzqFUOy22pXO4az4SI/kvJV9b1SvKmlrB7AcYWHFCUpgTeYbd1nDGeMOXT9Yq7Mb4YRIT3qUbMleESp16Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:13:44.796196Z"},"content_sha256":"2faa7d6e8a43bb1ea62e6512fff1d9401a7e7a2c8688976bb28bd6f4421fd78a","schema_version":"1.0","event_id":"sha256:2faa7d6e8a43bb1ea62e6512fff1d9401a7e7a2c8688976bb28bd6f4421fd78a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5DYWA4LJRUQJRIYJ3XR6MIKUL/bundle.json","state_url":"https://pith.science/pith/C5DYWA4LJRUQJRIYJ3XR6MIKUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5DYWA4LJRUQJRIYJ3XR6MIKUL/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-29T13:13:44Z","links":{"resolver":"https://pith.science/pith/C5DYWA4LJRUQJRIYJ3XR6MIKUL","bundle":"https://pith.science/pith/C5DYWA4LJRUQJRIYJ3XR6MIKUL/bundle.json","state":"https://pith.science/pith/C5DYWA4LJRUQJRIYJ3XR6MIKUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5DYWA4LJRUQJRIYJ3XR6MIKUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C5DYWA4LJRUQJRIYJ3XR6MIKUL","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":"6eafcc9a0745c40782725b7cac7ab1e2e314fb1a6527346e8da816675f66374c","cross_cats_sorted":["cs.AI","cs.CL","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-19T06:38:33Z","title_canon_sha256":"4e22488ce9fa84c2f5de5aeb1df476623b07e9490c2f142d3228351b2fb5d415"},"schema_version":"1.0","source":{"id":"1701.05311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05311","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05311v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05311","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"C5DYWA4LJRUQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C5DYWA4LJRUQJRIY","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C5DYWA4L","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:2faa7d6e8a43bb1ea62e6512fff1d9401a7e7a2c8688976bb28bd6f4421fd78a","target":"graph","created_at":"2026-05-18T00:52: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":"In this work several semantic approaches to concept-based query expansion and reranking schemes are studied and compared with different ontology-based expansion methods in web document search and retrieval. In particular, we focus on concept-based query expansion schemes, where, in order to effectively increase the precision of web document retrieval and to decrease the users browsing time, the main goal is to quickly provide users with the most suitable query expansion. Two key tasks for query expansion in web document retrieval are to find the expansion candidates, as the closest concepts in","authors_text":"Alfredo Milani, Clement H.C.Leung, Valentina Franzoni, Yuanxi Li","cross_cats":["cs.AI","cs.CL","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-19T06:38:33Z","title":"Semantic Evolutionary Concept Distances for Effective Information Retrieval in Query Expansion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05311","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:c5e234386349cee81c86c5547a26774c5fb537c3e076c21028f94a4cda328c47","target":"record","created_at":"2026-05-18T00:52: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":"6eafcc9a0745c40782725b7cac7ab1e2e314fb1a6527346e8da816675f66374c","cross_cats_sorted":["cs.AI","cs.CL","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-19T06:38:33Z","title_canon_sha256":"4e22488ce9fa84c2f5de5aeb1df476623b07e9490c2f142d3228351b2fb5d415"},"schema_version":"1.0","source":{"id":"1701.05311","kind":"arxiv","version":1}},"canonical_sha256":"17478b038b4c6904c5184eef1f310aa2d351251cf4f3b7f74b65c5048189b58b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17478b038b4c6904c5184eef1f310aa2d351251cf4f3b7f74b65c5048189b58b","first_computed_at":"2026-05-18T00:52:30.288447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:30.288447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VmC90Xh1tK5MYgMwXPqksNiJ6CJn9giKZM+Rabs1QZNfROIFlhgSI4bDsHsqa1qZ/JftaFCTWN4/9Z+72Ih6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:30.288892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5e234386349cee81c86c5547a26774c5fb537c3e076c21028f94a4cda328c47","sha256:2faa7d6e8a43bb1ea62e6512fff1d9401a7e7a2c8688976bb28bd6f4421fd78a"],"state_sha256":"61ca3ab8ab1f7d6bf39e61c243e5f8d38d165efc3dfb75072b13882f81e10995"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RCviWcWatRvst4vQtm0Hv58UGUmn4xgglm/+l57bOzDgBT46p1Z6iQd+3TE2vcxbfhAl9A07njfujlWP55CBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:13:44.798776Z","bundle_sha256":"947d77433b1d17a50f279954c9d0d728089790e46bef4283cb99c149c3f64923"}}