{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VWC5IF6DPMERBLNM74UBN7ENPI","short_pith_number":"pith:VWC5IF6D","schema_version":"1.0","canonical_sha256":"ad85d417c37b0910adacff2816fc8d7a379aacde9c002d943cc121cd9577295d","source":{"kind":"arxiv","id":"2412.08810","version":1},"attestation_state":"computed","paper":{"title":"Efficient Dynamic Attributed Graph Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Cong Chen, Dawei Cheng, Fan Li, Xiaoyang Wang, Xuemin Lin, Ying Zhang","submitted_at":"2024-12-11T22:53:27Z","abstract_excerpt":"Data generation is a fundamental research problem in data management due to its diverse use cases, ranging from testing database engines to data-specific applications. However, real-world entities often involve complex interactions that cannot be effectively modeled by traditional tabular data. Therefore, graph data generation has attracted increasing attention recently. Although various graph generators have been proposed in the literature, there are three limitations: i) They cannot capture the co-evolution pattern of graph structure and node attributes. ii) Few of them consider edge directi"},"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":"2412.08810","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-12-11T22:53:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4802eba60ec61176d3980b8103284e4fe43879d4e2fd1a8d8413e9d8717c4313","abstract_canon_sha256":"7bfd9e5b55e1774c9a9379c199cc40e08d6aa763d9bf47a6cb28f8120f72fe7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:02.010211Z","signature_b64":"nfGsabHChRfxXaXfNEnX3gseomZk8HotToA6N0WqUXRGndn3Lm8TGuPdeJFMpDRY1G1L/GkbzKl/AqIK3yxaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad85d417c37b0910adacff2816fc8d7a379aacde9c002d943cc121cd9577295d","last_reissued_at":"2026-07-05T09:48:02.009694Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:02.009694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Dynamic Attributed Graph Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Cong Chen, Dawei Cheng, Fan Li, Xiaoyang Wang, Xuemin Lin, Ying Zhang","submitted_at":"2024-12-11T22:53:27Z","abstract_excerpt":"Data generation is a fundamental research problem in data management due to its diverse use cases, ranging from testing database engines to data-specific applications. However, real-world entities often involve complex interactions that cannot be effectively modeled by traditional tabular data. Therefore, graph data generation has attracted increasing attention recently. Although various graph generators have been proposed in the literature, there are three limitations: i) They cannot capture the co-evolution pattern of graph structure and node attributes. ii) Few of them consider edge directi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08810","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.08810/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.08810","created_at":"2026-07-05T09:48:02.009762+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08810v1","created_at":"2026-07-05T09:48:02.009762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08810","created_at":"2026-07-05T09:48:02.009762+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWC5IF6DPMER","created_at":"2026-07-05T09:48:02.009762+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWC5IF6DPMERBLNM","created_at":"2026-07-05T09:48:02.009762+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWC5IF6D","created_at":"2026-07-05T09:48:02.009762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20967","citing_title":"PROVCREATOR: Synthesizing Complex Heterogenous Graphs with Node and Edge Attributes","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VWC5IF6DPMERBLNM74UBN7ENPI","json":"https://pith.science/pith/VWC5IF6DPMERBLNM74UBN7ENPI.json","graph_json":"https://pith.science/api/pith-number/VWC5IF6DPMERBLNM74UBN7ENPI/graph.json","events_json":"https://pith.science/api/pith-number/VWC5IF6DPMERBLNM74UBN7ENPI/events.json","paper":"https://pith.science/paper/VWC5IF6D"},"agent_actions":{"view_html":"https://pith.science/pith/VWC5IF6DPMERBLNM74UBN7ENPI","download_json":"https://pith.science/pith/VWC5IF6DPMERBLNM74UBN7ENPI.json","view_paper":"https://pith.science/paper/VWC5IF6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08810&json=true","fetch_graph":"https://pith.science/api/pith-number/VWC5IF6DPMERBLNM74UBN7ENPI/graph.json","fetch_events":"https://pith.science/api/pith-number/VWC5IF6DPMERBLNM74UBN7ENPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWC5IF6DPMERBLNM74UBN7ENPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWC5IF6DPMERBLNM74UBN7ENPI/action/storage_attestation","attest_author":"https://pith.science/pith/VWC5IF6DPMERBLNM74UBN7ENPI/action/author_attestation","sign_citation":"https://pith.science/pith/VWC5IF6DPMERBLNM74UBN7ENPI/action/citation_signature","submit_replication":"https://pith.science/pith/VWC5IF6DPMERBLNM74UBN7ENPI/action/replication_record"}},"created_at":"2026-07-05T09:48:02.009762+00:00","updated_at":"2026-07-05T09:48:02.009762+00:00"}