{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PXGQPCO2C7YPN7OCSY7FZ5Y357","short_pith_number":"pith:PXGQPCO2","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"},"canonical_sha256":"7dcd0789da17f0f6fdc2963e5cf71beff48812013b83c0e096bc7083b353523c","source":{"kind":"arxiv","id":"2605.18623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18623","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18623v1","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18623","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"PXGQPCO2C7YP","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"pith_short_16","alias_value":"PXGQPCO2C7YPN7OC","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"pith_short_8","alias_value":"PXGQPCO2","created_at":"2026-05-20T00:06:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PXGQPCO2C7YPN7OCSY7FZ5Y357","target":"record","payload":{"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"},"canonical_sha256":"7dcd0789da17f0f6fdc2963e5cf71beff48812013b83c0e096bc7083b353523c","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"},"source_kind":"arxiv","source_id":"2605.18623","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fefQR1kcGidwiVViT87zw3xTLfsAGNYcsT3PiwC6s5eRfzYUfsVM6/MiaUXXcbcd0TpebpEX6dW+CNZSBnemBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:49:29.224477Z"},"content_sha256":"661b9ea9f1c2411e57625f3c789e6b7fdf144ed286201e221a4968bc2c731724","schema_version":"1.0","event_id":"sha256:661b9ea9f1c2411e57625f3c789e6b7fdf144ed286201e221a4968bc2c731724"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PXGQPCO2C7YPN7OCSY7FZ5Y357","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LxxVhtFT2BZjbJh3trZWPzt30ZI/ERDWtSrdce8jhcJ0IcVEkqc3lS6U7o6NTJM4SMF3vGftUCD0SFhL7C5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:49:29.224873Z"},"content_sha256":"c83ded9fafda8270fa35629f1924579142a54b94eae40de50e77ae7b4e2f7825","schema_version":"1.0","event_id":"sha256:c83ded9fafda8270fa35629f1924579142a54b94eae40de50e77ae7b4e2f7825"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/bundle.json","state_url":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T07:49:29Z","links":{"resolver":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357","bundle":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/bundle.json","state":"https://pith.science/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXGQPCO2C7YPN7OCSY7FZ5Y357/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PXGQPCO2C7YPN7OCSY7FZ5Y357","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9310e96563495a21ed9f71325de3bbb44635d85a5c4839d05d475b674dd00189","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-18T16:32:40Z","title_canon_sha256":"9e0903e5a596e7ae876dc42afbc29a29109ab81b206ed785ba971ebc6b0388e8"},"schema_version":"1.0","source":{"id":"2605.18623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18623","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18623v1","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18623","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"PXGQPCO2C7YP","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"pith_short_16","alias_value":"PXGQPCO2C7YPN7OC","created_at":"2026-05-20T00:06:11Z"},{"alias_kind":"pith_short_8","alias_value":"PXGQPCO2","created_at":"2026-05-20T00:06:11Z"}],"graph_snapshots":[{"event_id":"sha256:c83ded9fafda8270fa35629f1924579142a54b94eae40de50e77ae7b4e2f7825","target":"graph","created_at":"2026-05-20T00:06:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T00:01:59.217288Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.18623/integrity.json","findings":[],"snapshot_sha256":"764a5076978f599532c6e6bdbb6546b3d7f1dad3a8ddfd4ee60d2315cbfd3642","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Josia John, Maximilian Probst Gutenberg, Simon Meierhans","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-18T16:32:40Z","title":"An Approximation Algorithm for Graph Label Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18623","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:661b9ea9f1c2411e57625f3c789e6b7fdf144ed286201e221a4968bc2c731724","target":"record","created_at":"2026-05-20T00:06:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9310e96563495a21ed9f71325de3bbb44635d85a5c4839d05d475b674dd00189","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-18T16:32:40Z","title_canon_sha256":"9e0903e5a596e7ae876dc42afbc29a29109ab81b206ed785ba971ebc6b0388e8"},"schema_version":"1.0","source":{"id":"2605.18623","kind":"arxiv","version":1}},"canonical_sha256":"7dcd0789da17f0f6fdc2963e5cf71beff48812013b83c0e096bc7083b353523c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dcd0789da17f0f6fdc2963e5cf71beff48812013b83c0e096bc7083b353523c","first_computed_at":"2026-05-20T00:06:11.320967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:06:11.320967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lo5PB6nB8fcH0sQuKcUtusHVbSpHO5+CDGN+O/Kl4Q6ABLij29gC4KYwnvDoWWu5N5U+VRfQYd45DtMXIhMCDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:06:11.321795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:661b9ea9f1c2411e57625f3c789e6b7fdf144ed286201e221a4968bc2c731724","sha256:c83ded9fafda8270fa35629f1924579142a54b94eae40de50e77ae7b4e2f7825"],"state_sha256":"3bfe458716ffcabdebcb201470c6ab8ea01f22350b8c6115cb7ed6045f3fdae3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGWY97Fn39UIJzaRxDl8Suzur20LNRg62XU3Q4GGI59xHUPK9DroJd/pAHMF3+0f7soL0DSjAnCFWpeb0rQ5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:49:29.226950Z","bundle_sha256":"3d357174c8f26222388040682f425edf55c996327abc93fee515d04e53f3821c"}}