{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:U6BBIU2F3HAPGUCMEMDB55EYMF","short_pith_number":"pith:U6BBIU2F","schema_version":"1.0","canonical_sha256":"a782145345d9c0f3504c23061ef498617f9631235b5bdb515fa14ca9d5263827","source":{"kind":"arxiv","id":"2504.00711","version":2},"attestation_state":"computed","paper":{"title":"GraphMaster: Automated Graph Synthesis via LLM Agents in Data-Limited Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Enjun Du, Guoren Wang, Rong-Hua Li, Tian Jin, Xunkai Li, Zhihan Zhang","submitted_at":"2025-04-01T12:21:50Z","abstract_excerpt":"The era of foundation models has revolutionized AI research, yet Graph Foundation Models (GFMs) remain constrained by the scarcity of large-scale graph corpora. Traditional graph data synthesis techniques primarily focus on simplistic structural operations, lacking the capacity to generate semantically rich nodes with meaningful textual attributes: a critical limitation for real-world applications. While large language models (LLMs) demonstrate exceptional text generation capabilities, their direct application to graph synthesis is impeded by context window limitations, hallucination phenomena"},"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":"2504.00711","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-01T12:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"96caa6cc8dfcb1a4ae7a30ffa0431c1f76c7b0cd3acfb44ff9ed7c8afe9e1d6b","abstract_canon_sha256":"4478e2468d6b6d70b8661949a3b6d2bdd3c2dcb6603cc8cc41d74dc08e336ed0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:25.162203Z","signature_b64":"SQH33LQz5D6qzIXPGAspjSL9CMX9W0xEPVp4yY9TlZA+ORHbYOHQNs3yhOco1DHc+TJArUG51aPOJm0V4EFyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a782145345d9c0f3504c23061ef498617f9631235b5bdb515fa14ca9d5263827","last_reissued_at":"2026-07-05T10:58:25.161687Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:25.161687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphMaster: Automated Graph Synthesis via LLM Agents in Data-Limited Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Enjun Du, Guoren Wang, Rong-Hua Li, Tian Jin, Xunkai Li, Zhihan Zhang","submitted_at":"2025-04-01T12:21:50Z","abstract_excerpt":"The era of foundation models has revolutionized AI research, yet Graph Foundation Models (GFMs) remain constrained by the scarcity of large-scale graph corpora. Traditional graph data synthesis techniques primarily focus on simplistic structural operations, lacking the capacity to generate semantically rich nodes with meaningful textual attributes: a critical limitation for real-world applications. While large language models (LLMs) demonstrate exceptional text generation capabilities, their direct application to graph synthesis is impeded by context window limitations, hallucination phenomena"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00711","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.00711/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":"2504.00711","created_at":"2026-07-05T10:58:25.161750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.00711v2","created_at":"2026-07-05T10:58:25.161750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00711","created_at":"2026-07-05T10:58:25.161750+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6BBIU2F3HAP","created_at":"2026-07-05T10:58:25.161750+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6BBIU2F3HAPGUCM","created_at":"2026-07-05T10:58:25.161750+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6BBIU2F","created_at":"2026-07-05T10:58:25.161750+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.08952","citing_title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2510.24251","citing_title":"GRAPHIA: Harnessing Social Graph Data to Enhance LLM-Based Social Simulation","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6BBIU2F3HAPGUCMEMDB55EYMF","json":"https://pith.science/pith/U6BBIU2F3HAPGUCMEMDB55EYMF.json","graph_json":"https://pith.science/api/pith-number/U6BBIU2F3HAPGUCMEMDB55EYMF/graph.json","events_json":"https://pith.science/api/pith-number/U6BBIU2F3HAPGUCMEMDB55EYMF/events.json","paper":"https://pith.science/paper/U6BBIU2F"},"agent_actions":{"view_html":"https://pith.science/pith/U6BBIU2F3HAPGUCMEMDB55EYMF","download_json":"https://pith.science/pith/U6BBIU2F3HAPGUCMEMDB55EYMF.json","view_paper":"https://pith.science/paper/U6BBIU2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.00711&json=true","fetch_graph":"https://pith.science/api/pith-number/U6BBIU2F3HAPGUCMEMDB55EYMF/graph.json","fetch_events":"https://pith.science/api/pith-number/U6BBIU2F3HAPGUCMEMDB55EYMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6BBIU2F3HAPGUCMEMDB55EYMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6BBIU2F3HAPGUCMEMDB55EYMF/action/storage_attestation","attest_author":"https://pith.science/pith/U6BBIU2F3HAPGUCMEMDB55EYMF/action/author_attestation","sign_citation":"https://pith.science/pith/U6BBIU2F3HAPGUCMEMDB55EYMF/action/citation_signature","submit_replication":"https://pith.science/pith/U6BBIU2F3HAPGUCMEMDB55EYMF/action/replication_record"}},"created_at":"2026-07-05T10:58:25.161750+00:00","updated_at":"2026-07-05T10:58:25.161750+00:00"}