{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PXGQPCO2C7YPN7OCSY7FZ5Y357","short_pith_number":"pith:PXGQPCO2","schema_version":"1.0","canonical_sha256":"7dcd0789da17f0f6fdc2963e5cf71beff48812013b83c0e096bc7083b353523c","source":{"kind":"arxiv","id":"2605.18623","version":1},"attestation_state":"computed","paper":{"title":"An Approximation Algorithm for Graph Label Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Josia John, Maximilian Probst Gutenberg, Simon Meierhans","submitted_at":"2026-05-18T16:32:40Z","abstract_excerpt":"In the graph label selection problem, one is given an $n$-vertex graph and a budget $k$, and seeks to select $k$ vertices whose labels enable accurate prediction of the labels on the remaining vertices. This problem formalizes distilling a small representative set from the whole graph. We present the first $\\tilde{O}(\\log^{1.5} n)$-approximation algorithm for graph label selection under the standard budget constraint. Prior work either relies on resource augmentation, allowing substantially more than $k$ labeled vertices, or consists primarily of heuristics without provable guarantees. Finally"},"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":"2605.18623","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-18T16:32:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9e0903e5a596e7ae876dc42afbc29a29109ab81b206ed785ba971ebc6b0388e8","abstract_canon_sha256":"9310e96563495a21ed9f71325de3bbb44635d85a5c4839d05d475b674dd00189"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:06:11.321795Z","signature_b64":"Lo5PB6nB8fcH0sQuKcUtusHVbSpHO5+CDGN+O/Kl4Q6ABLij29gC4KYwnvDoWWu5N5U+VRfQYd45DtMXIhMCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dcd0789da17f0f6fdc2963e5cf71beff48812013b83c0e096bc7083b353523c","last_reissued_at":"2026-05-20T00:06:11.320967Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:06:11.320967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Approximation Algorithm for Graph Label Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Josia John, Maximilian Probst Gutenberg, Simon Meierhans","submitted_at":"2026-05-18T16:32:40Z","abstract_excerpt":"In the graph label selection problem, one is given an $n$-vertex graph and a budget $k$, and seeks to select $k$ vertices whose labels enable accurate prediction of the labels on the remaining vertices. This problem formalizes distilling a small representative set from the whole graph. We present the first $\\tilde{O}(\\log^{1.5} n)$-approximation algorithm for graph label selection under the standard budget constraint. Prior work either relies on resource augmentation, allowing substantially more than $k$ labeled vertices, or consists primarily of heuristics without provable guarantees. Finally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18623","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/2605.18623/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T00:01:59.217288Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"764a5076978f599532c6e6bdbb6546b3d7f1dad3a8ddfd4ee60d2315cbfd3642"},"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":"2605.18623","created_at":"2026-05-20T00:06:11.321100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18623v1","created_at":"2026-05-20T00:06:11.321100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18623","created_at":"2026-05-20T00:06:11.321100+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXGQPCO2C7YP","created_at":"2026-05-20T00:06:11.321100+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXGQPCO2C7YPN7OC","created_at":"2026-05-20T00:06:11.321100+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXGQPCO2","created_at":"2026-05-20T00:06:11.321100+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/PXGQPCO2C7YPN7OCSY7FZ5Y357","json":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357.json","graph_json":"https://pith.science/api/pith-number/PXGQPCO2C7YPN7OCSY7FZ5Y357/graph.json","events_json":"https://pith.science/api/pith-number/PXGQPCO2C7YPN7OCSY7FZ5Y357/events.json","paper":"https://pith.science/paper/PXGQPCO2"},"agent_actions":{"view_html":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357","download_json":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357.json","view_paper":"https://pith.science/paper/PXGQPCO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18623&json=true","fetch_graph":"https://pith.science/api/pith-number/PXGQPCO2C7YPN7OCSY7FZ5Y357/graph.json","fetch_events":"https://pith.science/api/pith-number/PXGQPCO2C7YPN7OCSY7FZ5Y357/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/action/storage_attestation","attest_author":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/action/author_attestation","sign_citation":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/action/citation_signature","submit_replication":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/action/replication_record"}},"created_at":"2026-05-20T00:06:11.321100+00:00","updated_at":"2026-05-20T00:06:11.321100+00:00"}