{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:T2T5TCH4JQ6KHSYM3SONDCV3D4","short_pith_number":"pith:T2T5TCH4","canonical_record":{"source":{"id":"2606.01400","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T18:45:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6fee4da468983e011e55efa0c2181be6b6284eeb06c9ddb94fd276fd202dce3e","abstract_canon_sha256":"cc9be42e7bcf29f6ea723c8630561931f487a628da77f9d32cc0534d2da7f48a"},"schema_version":"1.0"},"canonical_sha256":"9ea7d988fc4c3ca3cb0cdc9cd18abb1f0eab78a4aa5959a79ed190014b386536","source":{"kind":"arxiv","id":"2606.01400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01400","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01400v1","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01400","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"T2T5TCH4JQ6K","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"pith_short_16","alias_value":"T2T5TCH4JQ6KHSYM","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"pith_short_8","alias_value":"T2T5TCH4","created_at":"2026-06-02T02:04:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:T2T5TCH4JQ6KHSYM3SONDCV3D4","target":"record","payload":{"canonical_record":{"source":{"id":"2606.01400","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T18:45:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6fee4da468983e011e55efa0c2181be6b6284eeb06c9ddb94fd276fd202dce3e","abstract_canon_sha256":"cc9be42e7bcf29f6ea723c8630561931f487a628da77f9d32cc0534d2da7f48a"},"schema_version":"1.0"},"canonical_sha256":"9ea7d988fc4c3ca3cb0cdc9cd18abb1f0eab78a4aa5959a79ed190014b386536","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:32.382274Z","signature_b64":"YKtleTmnHYExF06FllD57qu1AJyCTGH+aRBFP9hkCC/YRmUwoDb7HQcvMTCFo20kKcF9jsKfFL0dbhyk6Ac0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ea7d988fc4c3ca3cb0cdc9cd18abb1f0eab78a4aa5959a79ed190014b386536","last_reissued_at":"2026-06-02T02:04:32.381835Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:32.381835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.01400","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-06-02T02:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEfmLxpdWOVa7M29e7MmXUsCnlIysZSIoMYSATiXzpy2qU9jBPnpJXPwMTVc2ZY1By2g0L1jUbKmvauzRmNvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:10:20.385443Z"},"content_sha256":"b7f554fb91df28d179fc257efe50deab378d0acdfbd1d98c81b9ec3ecad8aefc","schema_version":"1.0","event_id":"sha256:b7f554fb91df28d179fc257efe50deab378d0acdfbd1d98c81b9ec3ecad8aefc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:T2T5TCH4JQ6KHSYM3SONDCV3D4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consistent and Distinctive: LLM Benchmark Efficiency via Maximum Independent Set Prompt Selection on Similarity Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ana Gjorgjevikj, Denica Kjorvezir, Gjorgjina Cenikj, Marko Djukanovi\\'c, Tome Eftimov","submitted_at":"2026-05-31T18:45:12Z","abstract_excerpt":"Evaluating large language models (LLMs) across comprehensive benchmarks is expensive and time-consuming. We propose a graph-based prompt selection framework that models each benchmark as a similarity graph -- nodes are prompts connected if their embedding-space distance falls above a configurable threshold -- and applies Maximum Independent Set (MIS) algorithms to select a maximally diverse, non-redundant subset. We evaluate four MIS solvers (CPLEX, GREEDY, Online-MIS, ReduMIS) across six embedding models, three distance measures, six percentile thresholds, and four benchmarks (GPQA, IFEval, M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01400","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/2606.01400/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"},"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-06-02T02:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5yNLvnv1kkKf+u7XQcVfoxSngt4b16xngKOrtK3p0Svi/Nf3RdXXpotTSVJmqUtcaUVGzgb0OUNbxJArIveCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:10:20.385836Z"},"content_sha256":"282fa7c68abbb2b46f2f77dea944f1e2b00b6e232b62aeb59a358fe01656a17a","schema_version":"1.0","event_id":"sha256:282fa7c68abbb2b46f2f77dea944f1e2b00b6e232b62aeb59a358fe01656a17a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2T5TCH4JQ6KHSYM3SONDCV3D4/bundle.json","state_url":"https://pith.science/pith/T2T5TCH4JQ6KHSYM3SONDCV3D4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2T5TCH4JQ6KHSYM3SONDCV3D4/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-06-24T09:10:20Z","links":{"resolver":"https://pith.science/pith/T2T5TCH4JQ6KHSYM3SONDCV3D4","bundle":"https://pith.science/pith/T2T5TCH4JQ6KHSYM3SONDCV3D4/bundle.json","state":"https://pith.science/pith/T2T5TCH4JQ6KHSYM3SONDCV3D4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2T5TCH4JQ6KHSYM3SONDCV3D4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:T2T5TCH4JQ6KHSYM3SONDCV3D4","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":"cc9be42e7bcf29f6ea723c8630561931f487a628da77f9d32cc0534d2da7f48a","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T18:45:12Z","title_canon_sha256":"6fee4da468983e011e55efa0c2181be6b6284eeb06c9ddb94fd276fd202dce3e"},"schema_version":"1.0","source":{"id":"2606.01400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01400","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01400v1","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01400","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"T2T5TCH4JQ6K","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"pith_short_16","alias_value":"T2T5TCH4JQ6KHSYM","created_at":"2026-06-02T02:04:32Z"},{"alias_kind":"pith_short_8","alias_value":"T2T5TCH4","created_at":"2026-06-02T02:04:32Z"}],"graph_snapshots":[{"event_id":"sha256:282fa7c68abbb2b46f2f77dea944f1e2b00b6e232b62aeb59a358fe01656a17a","target":"graph","created_at":"2026-06-02T02:04:32Z","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":[],"endpoint":"/pith/2606.01400/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Evaluating large language models (LLMs) across comprehensive benchmarks is expensive and time-consuming. We propose a graph-based prompt selection framework that models each benchmark as a similarity graph -- nodes are prompts connected if their embedding-space distance falls above a configurable threshold -- and applies Maximum Independent Set (MIS) algorithms to select a maximally diverse, non-redundant subset. We evaluate four MIS solvers (CPLEX, GREEDY, Online-MIS, ReduMIS) across six embedding models, three distance measures, six percentile thresholds, and four benchmarks (GPQA, IFEval, M","authors_text":"Ana Gjorgjevikj, Denica Kjorvezir, Gjorgjina Cenikj, Marko Djukanovi\\'c, Tome Eftimov","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T18:45:12Z","title":"Consistent and Distinctive: LLM Benchmark Efficiency via Maximum Independent Set Prompt Selection on Similarity Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01400","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:b7f554fb91df28d179fc257efe50deab378d0acdfbd1d98c81b9ec3ecad8aefc","target":"record","created_at":"2026-06-02T02:04:32Z","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":"cc9be42e7bcf29f6ea723c8630561931f487a628da77f9d32cc0534d2da7f48a","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-31T18:45:12Z","title_canon_sha256":"6fee4da468983e011e55efa0c2181be6b6284eeb06c9ddb94fd276fd202dce3e"},"schema_version":"1.0","source":{"id":"2606.01400","kind":"arxiv","version":1}},"canonical_sha256":"9ea7d988fc4c3ca3cb0cdc9cd18abb1f0eab78a4aa5959a79ed190014b386536","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ea7d988fc4c3ca3cb0cdc9cd18abb1f0eab78a4aa5959a79ed190014b386536","first_computed_at":"2026-06-02T02:04:32.381835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:32.381835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YKtleTmnHYExF06FllD57qu1AJyCTGH+aRBFP9hkCC/YRmUwoDb7HQcvMTCFo20kKcF9jsKfFL0dbhyk6Ac0Cg==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:32.382274Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7f554fb91df28d179fc257efe50deab378d0acdfbd1d98c81b9ec3ecad8aefc","sha256:282fa7c68abbb2b46f2f77dea944f1e2b00b6e232b62aeb59a358fe01656a17a"],"state_sha256":"2bc15800c4df32079b51f02798e90f35687a412ec4c66f3e7e12130799c9a28a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ut4L1wFD1W8pa5vcRsXUOsihEmE43/A1yxyW7RgBVqEaaFmwtBotbj5lRtdHM5/nICbyPS1/JF2cn2nEA7B1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:10:20.387966Z","bundle_sha256":"3eb0072d786e4db22f295742ae07e8a40e3fde0206d7d3fb5f247215006644ad"}}