{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MFVUEWRNJLMX3SWCJ5OTAFO42T","short_pith_number":"pith:MFVUEWRN","schema_version":"1.0","canonical_sha256":"616b425a2d4ad97dcac24f5d3015dcd4dcd21a14b4b0fb0f43f3ad24969acc81","source":{"kind":"arxiv","id":"1707.07623","version":1},"attestation_state":"computed","paper":{"title":"eLinda: Explorer for Linked Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Benny Kimelfeld, Oren Kalinsky, Oren Mishali, Tal Yahav","submitted_at":"2017-07-24T16:03:06Z","abstract_excerpt":"To realize the premise of the Semantic Web towards knowledgeable machines, one might often integrate an application with emerging RDF graphs. Nevertheless, capturing the content of a rich and open RDF graph by existing tools requires both time and expertise. We demonstrate eLinda - an explorer for Linked Data. The challenge addressed by eLinda is that of understanding the rich content of a given RDF graph. The core functionality is an exploration path, where each step produces a bar chart (histogram) that visualizes the distribution of classes in a set of nodes (URIs). In turn, each bar repres"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1707.07623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-07-24T16:03:06Z","cross_cats_sorted":[],"title_canon_sha256":"2ca46401ddbe8a903b16df5c96486b5eeea0da1901a40088cd8789f8783d69a3","abstract_canon_sha256":"d71d5cb77bdb4ee0775bb8b25357c6c54f4f2a866825e3154d9a77596aaacab7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:41.607978Z","signature_b64":"+70pPWMnLWqq0B+HElRp9/PHd/7OuY+0e79pthG0KJYyvImd3vwQM/B37W2Sb2rdJP0Pawkhe0rOec9wBAaxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"616b425a2d4ad97dcac24f5d3015dcd4dcd21a14b4b0fb0f43f3ad24969acc81","last_reissued_at":"2026-05-18T00:39:41.607564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:41.607564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"eLinda: Explorer for Linked Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Benny Kimelfeld, Oren Kalinsky, Oren Mishali, Tal Yahav","submitted_at":"2017-07-24T16:03:06Z","abstract_excerpt":"To realize the premise of the Semantic Web towards knowledgeable machines, one might often integrate an application with emerging RDF graphs. Nevertheless, capturing the content of a rich and open RDF graph by existing tools requires both time and expertise. We demonstrate eLinda - an explorer for Linked Data. The challenge addressed by eLinda is that of understanding the rich content of a given RDF graph. The core functionality is an exploration path, where each step produces a bar chart (histogram) that visualizes the distribution of classes in a set of nodes (URIs). In turn, each bar repres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07623","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.07623","created_at":"2026-05-18T00:39:41.607624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07623v1","created_at":"2026-05-18T00:39:41.607624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07623","created_at":"2026-05-18T00:39:41.607624+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFVUEWRNJLMX","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFVUEWRNJLMX3SWC","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFVUEWRN","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MFVUEWRNJLMX3SWCJ5OTAFO42T","json":"https://pith.science/pith/MFVUEWRNJLMX3SWCJ5OTAFO42T.json","graph_json":"https://pith.science/api/pith-number/MFVUEWRNJLMX3SWCJ5OTAFO42T/graph.json","events_json":"https://pith.science/api/pith-number/MFVUEWRNJLMX3SWCJ5OTAFO42T/events.json","paper":"https://pith.science/paper/MFVUEWRN"},"agent_actions":{"view_html":"https://pith.science/pith/MFVUEWRNJLMX3SWCJ5OTAFO42T","download_json":"https://pith.science/pith/MFVUEWRNJLMX3SWCJ5OTAFO42T.json","view_paper":"https://pith.science/paper/MFVUEWRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07623&json=true","fetch_graph":"https://pith.science/api/pith-number/MFVUEWRNJLMX3SWCJ5OTAFO42T/graph.json","fetch_events":"https://pith.science/api/pith-number/MFVUEWRNJLMX3SWCJ5OTAFO42T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFVUEWRNJLMX3SWCJ5OTAFO42T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFVUEWRNJLMX3SWCJ5OTAFO42T/action/storage_attestation","attest_author":"https://pith.science/pith/MFVUEWRNJLMX3SWCJ5OTAFO42T/action/author_attestation","sign_citation":"https://pith.science/pith/MFVUEWRNJLMX3SWCJ5OTAFO42T/action/citation_signature","submit_replication":"https://pith.science/pith/MFVUEWRNJLMX3SWCJ5OTAFO42T/action/replication_record"}},"created_at":"2026-05-18T00:39:41.607624+00:00","updated_at":"2026-05-18T00:39:41.607624+00:00"}