{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7B43UVKVEBE53RVTVLHCK5YLIO","short_pith_number":"pith:7B43UVKV","schema_version":"1.0","canonical_sha256":"f879ba55552049ddc6b3aace25770b43a829d6855337c170f8000cb4bd4db8bb","source":{"kind":"arxiv","id":"1907.01885","version":1},"attestation_state":"computed","paper":{"title":"A Software Framework and Datasets for the Analysis of Graph Measures on RDF Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daniel Hienert, Maribel Acosta, Matth\\\"aus Zloch, Stefan Conrad, Stefan Dietze","submitted_at":"2019-07-03T12:32:50Z","abstract_excerpt":"As the availability and the inter-connectivity of RDF datasets grow, so does the necessity to understand the structure of the data. Understanding the topology of RDF graphs can guide and inform the development of, e.g. synthetic dataset generators, sampling methods, index structures, or query optimizers. In this work, we propose two resources: (i) a software framework able to acquire, prepare, and perform a graph-based analysis on the topology of large RDF graphs, and (ii) results on a graph-based analysis of 280 datasets from the LOD Cloud with values for 28 graph measures computed with the f"},"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":"1907.01885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-07-03T12:32:50Z","cross_cats_sorted":[],"title_canon_sha256":"acb8f25b535ec06efb87932d9f309add2eb00c0aa47ea582fb7339362f707911","abstract_canon_sha256":"5261c3a71a95929d03a455673adc1f0151393a24e357cd169fc54392d08df2e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:34.669791Z","signature_b64":"QQf6fb72YBnERaAVOhWFOdSnbmjErSASP44ZUSLsoXI1HaAlyMO2t2XONV2DTY9P1ejKoloU6mPZc/w3/xKgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f879ba55552049ddc6b3aace25770b43a829d6855337c170f8000cb4bd4db8bb","last_reissued_at":"2026-05-17T23:41:34.669238Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:34.669238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Software Framework and Datasets for the Analysis of Graph Measures on RDF Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daniel Hienert, Maribel Acosta, Matth\\\"aus Zloch, Stefan Conrad, Stefan Dietze","submitted_at":"2019-07-03T12:32:50Z","abstract_excerpt":"As the availability and the inter-connectivity of RDF datasets grow, so does the necessity to understand the structure of the data. Understanding the topology of RDF graphs can guide and inform the development of, e.g. synthetic dataset generators, sampling methods, index structures, or query optimizers. In this work, we propose two resources: (i) a software framework able to acquire, prepare, and perform a graph-based analysis on the topology of large RDF graphs, and (ii) results on a graph-based analysis of 280 datasets from the LOD Cloud with values for 28 graph measures computed with the f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01885","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":"1907.01885","created_at":"2026-05-17T23:41:34.669329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01885v1","created_at":"2026-05-17T23:41:34.669329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01885","created_at":"2026-05-17T23:41:34.669329+00:00"},{"alias_kind":"pith_short_12","alias_value":"7B43UVKVEBE5","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7B43UVKVEBE53RVT","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7B43UVKV","created_at":"2026-05-18T12:33:12.712433+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/7B43UVKVEBE53RVTVLHCK5YLIO","json":"https://pith.science/pith/7B43UVKVEBE53RVTVLHCK5YLIO.json","graph_json":"https://pith.science/api/pith-number/7B43UVKVEBE53RVTVLHCK5YLIO/graph.json","events_json":"https://pith.science/api/pith-number/7B43UVKVEBE53RVTVLHCK5YLIO/events.json","paper":"https://pith.science/paper/7B43UVKV"},"agent_actions":{"view_html":"https://pith.science/pith/7B43UVKVEBE53RVTVLHCK5YLIO","download_json":"https://pith.science/pith/7B43UVKVEBE53RVTVLHCK5YLIO.json","view_paper":"https://pith.science/paper/7B43UVKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01885&json=true","fetch_graph":"https://pith.science/api/pith-number/7B43UVKVEBE53RVTVLHCK5YLIO/graph.json","fetch_events":"https://pith.science/api/pith-number/7B43UVKVEBE53RVTVLHCK5YLIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7B43UVKVEBE53RVTVLHCK5YLIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7B43UVKVEBE53RVTVLHCK5YLIO/action/storage_attestation","attest_author":"https://pith.science/pith/7B43UVKVEBE53RVTVLHCK5YLIO/action/author_attestation","sign_citation":"https://pith.science/pith/7B43UVKVEBE53RVTVLHCK5YLIO/action/citation_signature","submit_replication":"https://pith.science/pith/7B43UVKVEBE53RVTVLHCK5YLIO/action/replication_record"}},"created_at":"2026-05-17T23:41:34.669329+00:00","updated_at":"2026-05-17T23:41:34.669329+00:00"}