{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BH2CNHI3TSRVOIIVCUE6U5PYDQ","short_pith_number":"pith:BH2CNHI3","schema_version":"1.0","canonical_sha256":"09f4269d1b9ca35721151509ea75f81c37de0a5d3ff927d5709b6d6e8322e793","source":{"kind":"arxiv","id":"2406.05346","version":2},"attestation_state":"computed","paper":{"title":"ProG: A Graph Prompt Learning Benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenyi Zi, Haihong Zhao, Hong Cheng, Jia Li, Xiangguo Sun, Yiqing Lin","submitted_at":"2024-06-08T04:17:48Z","abstract_excerpt":"Artificial general intelligence on graphs has shown significant advancements across various applications, yet the traditional 'Pre-train & Fine-tune' paradigm faces inefficiencies and negative transfer issues, particularly in complex and few-shot settings. Graph prompt learning emerges as a promising alternative, leveraging lightweight prompts to manipulate data and fill the task gap by reformulating downstream tasks to the pretext. However, several critical challenges still remain: how to unify diverse graph prompt models, how to evaluate the quality of graph prompts, and to improve their usa"},"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":"2406.05346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-08T04:17:48Z","cross_cats_sorted":[],"title_canon_sha256":"4c2fbf4efb0c23572db76d1c20c00534c08278f9914d9e776ea3be123f86935b","abstract_canon_sha256":"fcf2cf5141126cab2ba6aef80bc1e400974985e7b8ffc7b6bb007a979e633453"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:20.389629Z","signature_b64":"IEi4Yhl+nt4oLT94C6dI/7gd1uU0CIyDwRoSeYLZ/BEzxu02UFSZQ+AhMa7rfgYFwTzW1KQgowKrKL+xq8qoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09f4269d1b9ca35721151509ea75f81c37de0a5d3ff927d5709b6d6e8322e793","last_reissued_at":"2026-07-05T08:34:20.389148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:20.389148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ProG: A Graph Prompt Learning Benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenyi Zi, Haihong Zhao, Hong Cheng, Jia Li, Xiangguo Sun, Yiqing Lin","submitted_at":"2024-06-08T04:17:48Z","abstract_excerpt":"Artificial general intelligence on graphs has shown significant advancements across various applications, yet the traditional 'Pre-train & Fine-tune' paradigm faces inefficiencies and negative transfer issues, particularly in complex and few-shot settings. Graph prompt learning emerges as a promising alternative, leveraging lightweight prompts to manipulate data and fill the task gap by reformulating downstream tasks to the pretext. However, several critical challenges still remain: how to unify diverse graph prompt models, how to evaluate the quality of graph prompts, and to improve their usa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05346","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/2406.05346/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":"2406.05346","created_at":"2026-07-05T08:34:20.389205+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.05346v2","created_at":"2026-07-05T08:34:20.389205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05346","created_at":"2026-07-05T08:34:20.389205+00:00"},{"alias_kind":"pith_short_12","alias_value":"BH2CNHI3TSRV","created_at":"2026-07-05T08:34:20.389205+00:00"},{"alias_kind":"pith_short_16","alias_value":"BH2CNHI3TSRVOIIV","created_at":"2026-07-05T08:34:20.389205+00:00"},{"alias_kind":"pith_short_8","alias_value":"BH2CNHI3","created_at":"2026-07-05T08:34:20.389205+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06975","citing_title":"GSTBench: A Benchmark Study on the Transferability of Graph Self-Supervised Learning","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BH2CNHI3TSRVOIIVCUE6U5PYDQ","json":"https://pith.science/pith/BH2CNHI3TSRVOIIVCUE6U5PYDQ.json","graph_json":"https://pith.science/api/pith-number/BH2CNHI3TSRVOIIVCUE6U5PYDQ/graph.json","events_json":"https://pith.science/api/pith-number/BH2CNHI3TSRVOIIVCUE6U5PYDQ/events.json","paper":"https://pith.science/paper/BH2CNHI3"},"agent_actions":{"view_html":"https://pith.science/pith/BH2CNHI3TSRVOIIVCUE6U5PYDQ","download_json":"https://pith.science/pith/BH2CNHI3TSRVOIIVCUE6U5PYDQ.json","view_paper":"https://pith.science/paper/BH2CNHI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.05346&json=true","fetch_graph":"https://pith.science/api/pith-number/BH2CNHI3TSRVOIIVCUE6U5PYDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BH2CNHI3TSRVOIIVCUE6U5PYDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BH2CNHI3TSRVOIIVCUE6U5PYDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BH2CNHI3TSRVOIIVCUE6U5PYDQ/action/storage_attestation","attest_author":"https://pith.science/pith/BH2CNHI3TSRVOIIVCUE6U5PYDQ/action/author_attestation","sign_citation":"https://pith.science/pith/BH2CNHI3TSRVOIIVCUE6U5PYDQ/action/citation_signature","submit_replication":"https://pith.science/pith/BH2CNHI3TSRVOIIVCUE6U5PYDQ/action/replication_record"}},"created_at":"2026-07-05T08:34:20.389205+00:00","updated_at":"2026-07-05T08:34:20.389205+00:00"}