{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SQRFPSKEL5N66RKW7GEV2U5VOP","short_pith_number":"pith:SQRFPSKE","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"},"canonical_sha256":"942257c9445f5bef4556f9895d53b573d754a6fdad16e4a3ead41d057c841d03","source":{"kind":"arxiv","id":"1506.04333","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04333","created_at":"2026-05-18T01:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04333v2","created_at":"2026-05-18T01:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04333","created_at":"2026-05-18T01:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"SQRFPSKEL5N6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SQRFPSKEL5N66RKW","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SQRFPSKE","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SQRFPSKEL5N66RKW7GEV2U5VOP","target":"record","payload":{"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"},"canonical_sha256":"942257c9445f5bef4556f9895d53b573d754a6fdad16e4a3ead41d057c841d03","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"},"source_kind":"arxiv","source_id":"1506.04333","source_version":2,"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:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FiMRDndS1OP7cFhmQXMTmDaIC2Qwu7FRRU5pTscu+7TVWmJOe2azpCfT6j4tQIZMap7ylqpfrQZ/zL5OjXlFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:16:57.826029Z"},"content_sha256":"72476418749488b6ede9e882def9208d35b4bf0eab29f46f26c58b3a76556c8a","schema_version":"1.0","event_id":"sha256:72476418749488b6ede9e882def9208d35b4bf0eab29f46f26c58b3a76556c8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SQRFPSKEL5N66RKW7GEV2U5VOP","target":"graph","payload":{"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"},"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:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0sDlGMAvKkV/j3PtOau6Q+QDj0myK2sIQ73YDFm105vl583LMNglHMb9/lVxolXhZnAgvzLePJlifIBdSrcMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:16:57.826386Z"},"content_sha256":"2ec69eb27dd29c06bcd6f02ca30f6e06bd3c09bf71d14a0e56f2504c9560e8a5","schema_version":"1.0","event_id":"sha256:2ec69eb27dd29c06bcd6f02ca30f6e06bd3c09bf71d14a0e56f2504c9560e8a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/bundle.json","state_url":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/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-31T01:16:57Z","links":{"resolver":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP","bundle":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/bundle.json","state":"https://pith.science/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQRFPSKEL5N66RKW7GEV2U5VOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SQRFPSKEL5N66RKW7GEV2U5VOP","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":"503b628f9dd5d6c865a33cdc3b6a2a5d159bde12f32d84099661b961ee8562ce","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2015-06-13T23:23:21Z","title_canon_sha256":"daa289da2b2d719c2f3407ee999fa64f7002d829caee1fc1b808f1bf6adf81a5"},"schema_version":"1.0","source":{"id":"1506.04333","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04333","created_at":"2026-05-18T01:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04333v2","created_at":"2026-05-18T01:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04333","created_at":"2026-05-18T01:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"SQRFPSKEL5N6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SQRFPSKEL5N66RKW","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SQRFPSKE","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:2ec69eb27dd29c06bcd6f02ca30f6e06bd3c09bf71d14a0e56f2504c9560e8a5","target":"graph","created_at":"2026-05-18T01:46:13Z","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 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.","authors_text":"George Papastefanatos, John Liagouris, Maria Krommyda, Nikos Bikakis, Timos Sellis","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2015-06-13T23:23:21Z","title":"Towards Scalable Visual Exploration of Very Large RDF Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04333","kind":"arxiv","version":2},"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:72476418749488b6ede9e882def9208d35b4bf0eab29f46f26c58b3a76556c8a","target":"record","created_at":"2026-05-18T01:46:13Z","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":"503b628f9dd5d6c865a33cdc3b6a2a5d159bde12f32d84099661b961ee8562ce","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2015-06-13T23:23:21Z","title_canon_sha256":"daa289da2b2d719c2f3407ee999fa64f7002d829caee1fc1b808f1bf6adf81a5"},"schema_version":"1.0","source":{"id":"1506.04333","kind":"arxiv","version":2}},"canonical_sha256":"942257c9445f5bef4556f9895d53b573d754a6fdad16e4a3ead41d057c841d03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"942257c9445f5bef4556f9895d53b573d754a6fdad16e4a3ead41d057c841d03","first_computed_at":"2026-05-18T01:46:13.077155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:46:13.077155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mQBNz6hzue0e3vbr6YkZ9wQBwVAsAiHId6GvOE3mdpXvMg7u3ecG6Msl6z90A6lzcCzvumeFN9DBAuP35Y0NBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:46:13.077836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04333","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72476418749488b6ede9e882def9208d35b4bf0eab29f46f26c58b3a76556c8a","sha256:2ec69eb27dd29c06bcd6f02ca30f6e06bd3c09bf71d14a0e56f2504c9560e8a5"],"state_sha256":"bbacdb7bd1f34065db028c438c6ad8644cdb49bb9539670f18128d61cbfcb262"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uX4GR6pyrPmeIgn65RcCEu9+62+nDet5iWzzOGe8NjymGmSzWalaAcZ1TfuFA91K6zhIcxAR/t3TSotsXuVqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:16:57.828266Z","bundle_sha256":"1cd81fa2aff21c01caf970dd1304a2bca6a8481e6ee347a55212b1c8eac42d5b"}}