{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SQRFPSKEL5N66RKW7GEV2U5VOP","short_pith_number":"pith:SQRFPSKE","schema_version":"1.0","canonical_sha256":"942257c9445f5bef4556f9895d53b573d754a6fdad16e4a3ead41d057c841d03","source":{"kind":"arxiv","id":"1506.04333","version":2},"attestation_state":"computed","paper":{"title":"Towards Scalable Visual Exploration of Very Large RDF Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.HC","authors_text":"George Papastefanatos, John Liagouris, Maria Krommyda, Nikos Bikakis, Timos Sellis","submitted_at":"2015-06-13T23:23:21Z","abstract_excerpt":"In this paper, we outline our work on developing a disk-based infrastructure for efficient visualization and graph exploration operations over very large graphs. The proposed platform, called graphVizdb, is based on a novel technique for indexing and storing the graph. Particularly, the graph layout is indexed with a spatial data structure, i.e., an R-tree, and stored in a database. In runtime, user operations are translated into efficient spatial operations (i.e., window queries) in the backend."},"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":"1506.04333","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2015-06-13T23:23:21Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"daa289da2b2d719c2f3407ee999fa64f7002d829caee1fc1b808f1bf6adf81a5","abstract_canon_sha256":"503b628f9dd5d6c865a33cdc3b6a2a5d159bde12f32d84099661b961ee8562ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:13.077836Z","signature_b64":"mQBNz6hzue0e3vbr6YkZ9wQBwVAsAiHId6GvOE3mdpXvMg7u3ecG6Msl6z90A6lzcCzvumeFN9DBAuP35Y0NBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"942257c9445f5bef4556f9895d53b573d754a6fdad16e4a3ead41d057c841d03","last_reissued_at":"2026-05-18T01:46:13.077155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:13.077155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Scalable Visual Exploration of Very Large RDF Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.HC","authors_text":"George Papastefanatos, John Liagouris, Maria Krommyda, Nikos Bikakis, Timos Sellis","submitted_at":"2015-06-13T23:23:21Z","abstract_excerpt":"In this paper, we outline our work on developing a disk-based infrastructure for efficient visualization and graph exploration operations over very large graphs. The proposed platform, called graphVizdb, is based on a novel technique for indexing and storing the graph. Particularly, the graph layout is indexed with a spatial data structure, i.e., an R-tree, and stored in a database. In runtime, user operations are translated into efficient spatial operations (i.e., window queries) in the backend."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04333","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.04333","created_at":"2026-05-18T01:46:13.077249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04333v2","created_at":"2026-05-18T01:46:13.077249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04333","created_at":"2026-05-18T01:46:13.077249+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQRFPSKEL5N6","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQRFPSKEL5N66RKW","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQRFPSKE","created_at":"2026-05-18T12:29:42.218222+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/SQRFPSKEL5N66RKW7GEV2U5VOP","json":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP.json","graph_json":"https://pith.science/api/pith-number/SQRFPSKEL5N66RKW7GEV2U5VOP/graph.json","events_json":"https://pith.science/api/pith-number/SQRFPSKEL5N66RKW7GEV2U5VOP/events.json","paper":"https://pith.science/paper/SQRFPSKE"},"agent_actions":{"view_html":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP","download_json":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP.json","view_paper":"https://pith.science/paper/SQRFPSKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04333&json=true","fetch_graph":"https://pith.science/api/pith-number/SQRFPSKEL5N66RKW7GEV2U5VOP/graph.json","fetch_events":"https://pith.science/api/pith-number/SQRFPSKEL5N66RKW7GEV2U5VOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/action/storage_attestation","attest_author":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/action/author_attestation","sign_citation":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/action/citation_signature","submit_replication":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/action/replication_record"}},"created_at":"2026-05-18T01:46:13.077249+00:00","updated_at":"2026-05-18T01:46:13.077249+00:00"}