{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H4OOI74HEJO2EFWEXRRJVCH6QL","short_pith_number":"pith:H4OOI74H","schema_version":"1.0","canonical_sha256":"3f1ce47f87225da216c4bc629a88fe82da84d4a1559f308084c02924cbb7bf0c","source":{"kind":"arxiv","id":"1704.00630","version":1},"attestation_state":"computed","paper":{"title":"Towards a property graph generator for benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DB","authors_text":"Arnau Prat-P\\'erez, Davide Basilio Bartolini, Joan Guisado-G\\'amez, Petr Koupy, Siegfried Depner, Xavier Fern\\'andez Salas","submitted_at":"2017-04-03T15:04:01Z","abstract_excerpt":"The use of synthetic graph generators is a common practice among graph-oriented benchmark designers, as it allows obtaining graphs with the required scale and characteristics. However, finding a graph generator that accurately fits the needs of a given benchmark is very difficult, thus practitioners end up creating ad-hoc ones. Such a task is usually time-consuming, and often leads to reinventing the wheel. In this paper, we introduce the conceptual design of DataSynth, a framework for property graphs generation with customizable schemas and characteristics. The goal of DataSynth is to assist "},"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":"1704.00630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-04-03T15:04:01Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"ed22fe4febf60b55578ddbac433c515145508a92543fa7cfb4c65dcbc0842bf6","abstract_canon_sha256":"58a8931125bbb478476dd2aedc8f06dae4d2ff3e20a55551c921eba749ad274c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:21.793548Z","signature_b64":"kBD2as4+FqnDbMdgJVjrb4q2pVA9MIMvRqrALmDMiRt9tJYCIY7KRUC9qa99KQ+2u3lPp6OruN3kfct/nG4YCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f1ce47f87225da216c4bc629a88fe82da84d4a1559f308084c02924cbb7bf0c","last_reissued_at":"2026-05-18T00:47:21.792844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:21.792844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a property graph generator for benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DB","authors_text":"Arnau Prat-P\\'erez, Davide Basilio Bartolini, Joan Guisado-G\\'amez, Petr Koupy, Siegfried Depner, Xavier Fern\\'andez Salas","submitted_at":"2017-04-03T15:04:01Z","abstract_excerpt":"The use of synthetic graph generators is a common practice among graph-oriented benchmark designers, as it allows obtaining graphs with the required scale and characteristics. However, finding a graph generator that accurately fits the needs of a given benchmark is very difficult, thus practitioners end up creating ad-hoc ones. Such a task is usually time-consuming, and often leads to reinventing the wheel. In this paper, we introduce the conceptual design of DataSynth, a framework for property graphs generation with customizable schemas and characteristics. The goal of DataSynth is to assist "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00630","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":"1704.00630","created_at":"2026-05-18T00:47:21.792970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00630v1","created_at":"2026-05-18T00:47:21.792970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00630","created_at":"2026-05-18T00:47:21.792970+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4OOI74HEJO2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4OOI74HEJO2EFWE","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4OOI74H","created_at":"2026-05-18T12:31:18.294218+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/H4OOI74HEJO2EFWEXRRJVCH6QL","json":"https://pith.science/pith/H4OOI74HEJO2EFWEXRRJVCH6QL.json","graph_json":"https://pith.science/api/pith-number/H4OOI74HEJO2EFWEXRRJVCH6QL/graph.json","events_json":"https://pith.science/api/pith-number/H4OOI74HEJO2EFWEXRRJVCH6QL/events.json","paper":"https://pith.science/paper/H4OOI74H"},"agent_actions":{"view_html":"https://pith.science/pith/H4OOI74HEJO2EFWEXRRJVCH6QL","download_json":"https://pith.science/pith/H4OOI74HEJO2EFWEXRRJVCH6QL.json","view_paper":"https://pith.science/paper/H4OOI74H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00630&json=true","fetch_graph":"https://pith.science/api/pith-number/H4OOI74HEJO2EFWEXRRJVCH6QL/graph.json","fetch_events":"https://pith.science/api/pith-number/H4OOI74HEJO2EFWEXRRJVCH6QL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4OOI74HEJO2EFWEXRRJVCH6QL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4OOI74HEJO2EFWEXRRJVCH6QL/action/storage_attestation","attest_author":"https://pith.science/pith/H4OOI74HEJO2EFWEXRRJVCH6QL/action/author_attestation","sign_citation":"https://pith.science/pith/H4OOI74HEJO2EFWEXRRJVCH6QL/action/citation_signature","submit_replication":"https://pith.science/pith/H4OOI74HEJO2EFWEXRRJVCH6QL/action/replication_record"}},"created_at":"2026-05-18T00:47:21.792970+00:00","updated_at":"2026-05-18T00:47:21.792970+00:00"}