{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J7YRM4TMEDACYUVVRVDIVGTTO7","short_pith_number":"pith:J7YRM4TM","schema_version":"1.0","canonical_sha256":"4ff116726c20c02c52b58d468a9a7377f40d576c6157c9557ddd3c890f395e07","source":{"kind":"arxiv","id":"2403.04780","version":3},"attestation_state":"computed","paper":{"title":"Graph-oriented Instruction Tuning of Large Language Models for Generic Graph Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Carl Yang, Hang Lv, Pengxiang Zhan, Shiping Wang, Yanchao Tan","submitted_at":"2024-03-02T09:27:32Z","abstract_excerpt":"Graphs with abundant attributes are essential in modeling interconnected entities and enhancing predictions across various real-world applications. Traditional Graph Neural Networks (GNNs) often require re-training for different graph tasks and datasets. Although the emergence of Large Language Models (LLMs) has introduced new paradigms in natural language processing, their potential for generic graph mining, training a single model to simultaneously handle diverse tasks and datasets, remains under-explored. To this end, our novel framework MuseGraph, seamlessly integrates the strengths of GNN"},"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":"2403.04780","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-03-02T09:27:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3950650da55ce2600c1fa400b9f6b48a16bcd568d96e6425172115d38dd4c562","abstract_canon_sha256":"0cc3bef1c2f5ff2c2c433b622d4623effe9e267e6b66ba642bd31048fbc2d794"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:08.228119Z","signature_b64":"aeR5W3EzRCqP5Ahx3T554tqujizCQH8qWKu4zq14qrrIV4dizT2CRkKb9quZ98gYGJl/HfAHpbg/s9z5pciYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ff116726c20c02c52b58d468a9a7377f40d576c6157c9557ddd3c890f395e07","last_reissued_at":"2026-05-26T01:03:08.227424Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:08.227424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-oriented Instruction Tuning of Large Language Models for Generic Graph Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Carl Yang, Hang Lv, Pengxiang Zhan, Shiping Wang, Yanchao Tan","submitted_at":"2024-03-02T09:27:32Z","abstract_excerpt":"Graphs with abundant attributes are essential in modeling interconnected entities and enhancing predictions across various real-world applications. Traditional Graph Neural Networks (GNNs) often require re-training for different graph tasks and datasets. Although the emergence of Large Language Models (LLMs) has introduced new paradigms in natural language processing, their potential for generic graph mining, training a single model to simultaneously handle diverse tasks and datasets, remains under-explored. To this end, our novel framework MuseGraph, seamlessly integrates the strengths of GNN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.04780","kind":"arxiv","version":3},"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/2403.04780/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":"2403.04780","created_at":"2026-05-26T01:03:08.227534+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.04780v3","created_at":"2026-05-26T01:03:08.227534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.04780","created_at":"2026-05-26T01:03:08.227534+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7YRM4TMEDAC","created_at":"2026-05-26T01:03:08.227534+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7YRM4TMEDACYUVV","created_at":"2026-05-26T01:03:08.227534+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7YRM4TM","created_at":"2026-05-26T01:03:08.227534+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.03514","citing_title":"Revisiting Graph-Tokenizing Large Language Models: A Systematic Evaluation of Graph Token Understanding","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J7YRM4TMEDACYUVVRVDIVGTTO7","json":"https://pith.science/pith/J7YRM4TMEDACYUVVRVDIVGTTO7.json","graph_json":"https://pith.science/api/pith-number/J7YRM4TMEDACYUVVRVDIVGTTO7/graph.json","events_json":"https://pith.science/api/pith-number/J7YRM4TMEDACYUVVRVDIVGTTO7/events.json","paper":"https://pith.science/paper/J7YRM4TM"},"agent_actions":{"view_html":"https://pith.science/pith/J7YRM4TMEDACYUVVRVDIVGTTO7","download_json":"https://pith.science/pith/J7YRM4TMEDACYUVVRVDIVGTTO7.json","view_paper":"https://pith.science/paper/J7YRM4TM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.04780&json=true","fetch_graph":"https://pith.science/api/pith-number/J7YRM4TMEDACYUVVRVDIVGTTO7/graph.json","fetch_events":"https://pith.science/api/pith-number/J7YRM4TMEDACYUVVRVDIVGTTO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7YRM4TMEDACYUVVRVDIVGTTO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7YRM4TMEDACYUVVRVDIVGTTO7/action/storage_attestation","attest_author":"https://pith.science/pith/J7YRM4TMEDACYUVVRVDIVGTTO7/action/author_attestation","sign_citation":"https://pith.science/pith/J7YRM4TMEDACYUVVRVDIVGTTO7/action/citation_signature","submit_replication":"https://pith.science/pith/J7YRM4TMEDACYUVVRVDIVGTTO7/action/replication_record"}},"created_at":"2026-05-26T01:03:08.227534+00:00","updated_at":"2026-05-26T01:03:08.227534+00:00"}