{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AIROOD52Q3H4SFL5NFJUC6MFN3","short_pith_number":"pith:AIROOD52","canonical_record":{"source":{"id":"1703.00757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T12:28:12Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"91df16ae818949cdc8816b0ba04cb04c244653f6a92e0e9642a8dee835912d08","abstract_canon_sha256":"9875febe4db33777cfa63b340da73962e1ae6796b76d2a7ea9d9cd472866697a"},"schema_version":"1.0"},"canonical_sha256":"0222e70fba86cfc9157d69534179856efc782cca401dcf9ffd5fa4ada1e044de","source":{"kind":"arxiv","id":"1703.00757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00757","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00757v1","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00757","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"AIROOD52Q3H4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIROOD52Q3H4SFL5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIROOD52","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AIROOD52Q3H4SFL5NFJUC6MFN3","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T12:28:12Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"91df16ae818949cdc8816b0ba04cb04c244653f6a92e0e9642a8dee835912d08","abstract_canon_sha256":"9875febe4db33777cfa63b340da73962e1ae6796b76d2a7ea9d9cd472866697a"},"schema_version":"1.0"},"canonical_sha256":"0222e70fba86cfc9157d69534179856efc782cca401dcf9ffd5fa4ada1e044de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:40.854490Z","signature_b64":"aIF5Suud/5A8+JQ7luBRSKceGzCMjMGweOi/Lpl60OGb7c03Ufvnub8K86x8GEb3T/+Eorm93W64BoJVNPigAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0222e70fba86cfc9157d69534179856efc782cca401dcf9ffd5fa4ada1e044de","last_reissued_at":"2026-05-18T00:49:40.853967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:40.853967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00757","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-18T00:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwOoKLsoD2QmI3rjHKT/rnwEuIlPLmPS4pY6AM3c3jI+IxdYyAx1RyOoitPzeL1jD6Esk9qTN/d6p21gJoy2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:00:56.419855Z"},"content_sha256":"eee57b1af3eeddd91d7ae443aff88ce536d000c20764beb388ccc11771d98f18","schema_version":"1.0","event_id":"sha256:eee57b1af3eeddd91d7ae443aff88ce536d000c20764beb388ccc11771d98f18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AIROOD52Q3H4SFL5NFJUC6MFN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Predicting Rankings of Software Verification Competitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LG","authors_text":"Eyke H\\\"ullermeier, Heike Wehrheim, Marie-Christine Jakobs, Mike Czech","submitted_at":"2017-03-02T12:28:12Z","abstract_excerpt":"Software verification competitions, such as the annual SV-COMP, evaluate software verification tools with respect to their effectivity and efficiency. Typically, the outcome of a competition is a (possibly category-specific) ranking of the tools. For many applications, such as building portfolio solvers, it would be desirable to have an idea of the (relative) performance of verification tools on a given verification task beforehand, i.e., prior to actually running all tools on the task.\n  In this paper, we present a machine learning approach to predicting rankings of tools on verification task"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00757","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":""},"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-18T00:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jESoyNxQmSoj97ufgGIMBGVz6hNUm9ToaxA5MQWjEgzZGlWdARPujwJHcFMwn/VB+rvy1x6+nw0GyHSLwyuuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:00:56.420241Z"},"content_sha256":"958a51afb50a13e213aea69880be4a726629c94c8ccd1ffb3d5bd05a9568d292","schema_version":"1.0","event_id":"sha256:958a51afb50a13e213aea69880be4a726629c94c8ccd1ffb3d5bd05a9568d292"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIROOD52Q3H4SFL5NFJUC6MFN3/bundle.json","state_url":"https://pith.science/pith/AIROOD52Q3H4SFL5NFJUC6MFN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIROOD52Q3H4SFL5NFJUC6MFN3/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-07-09T06:00:56Z","links":{"resolver":"https://pith.science/pith/AIROOD52Q3H4SFL5NFJUC6MFN3","bundle":"https://pith.science/pith/AIROOD52Q3H4SFL5NFJUC6MFN3/bundle.json","state":"https://pith.science/pith/AIROOD52Q3H4SFL5NFJUC6MFN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIROOD52Q3H4SFL5NFJUC6MFN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AIROOD52Q3H4SFL5NFJUC6MFN3","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":"9875febe4db33777cfa63b340da73962e1ae6796b76d2a7ea9d9cd472866697a","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T12:28:12Z","title_canon_sha256":"91df16ae818949cdc8816b0ba04cb04c244653f6a92e0e9642a8dee835912d08"},"schema_version":"1.0","source":{"id":"1703.00757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00757","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00757v1","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00757","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"AIROOD52Q3H4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIROOD52Q3H4SFL5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIROOD52","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:958a51afb50a13e213aea69880be4a726629c94c8ccd1ffb3d5bd05a9568d292","target":"graph","created_at":"2026-05-18T00:49:40Z","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"},"paper":{"abstract_excerpt":"Software verification competitions, such as the annual SV-COMP, evaluate software verification tools with respect to their effectivity and efficiency. Typically, the outcome of a competition is a (possibly category-specific) ranking of the tools. For many applications, such as building portfolio solvers, it would be desirable to have an idea of the (relative) performance of verification tools on a given verification task beforehand, i.e., prior to actually running all tools on the task.\n  In this paper, we present a machine learning approach to predicting rankings of tools on verification task","authors_text":"Eyke H\\\"ullermeier, Heike Wehrheim, Marie-Christine Jakobs, Mike Czech","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T12:28:12Z","title":"Predicting Rankings of Software Verification Competitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00757","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:eee57b1af3eeddd91d7ae443aff88ce536d000c20764beb388ccc11771d98f18","target":"record","created_at":"2026-05-18T00:49:40Z","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":"9875febe4db33777cfa63b340da73962e1ae6796b76d2a7ea9d9cd472866697a","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T12:28:12Z","title_canon_sha256":"91df16ae818949cdc8816b0ba04cb04c244653f6a92e0e9642a8dee835912d08"},"schema_version":"1.0","source":{"id":"1703.00757","kind":"arxiv","version":1}},"canonical_sha256":"0222e70fba86cfc9157d69534179856efc782cca401dcf9ffd5fa4ada1e044de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0222e70fba86cfc9157d69534179856efc782cca401dcf9ffd5fa4ada1e044de","first_computed_at":"2026-05-18T00:49:40.853967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:40.853967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aIF5Suud/5A8+JQ7luBRSKceGzCMjMGweOi/Lpl60OGb7c03Ufvnub8K86x8GEb3T/+Eorm93W64BoJVNPigAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:40.854490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eee57b1af3eeddd91d7ae443aff88ce536d000c20764beb388ccc11771d98f18","sha256:958a51afb50a13e213aea69880be4a726629c94c8ccd1ffb3d5bd05a9568d292"],"state_sha256":"503888b87c674d594580b0a48f8e9e1c2336e50b5e1d194c516979a3034f35b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzDpnJMJlRa4YEYgmRE4KrGKxJqRZ39fihQqYokSYK3Cd4C3VDbrga1B7E1js58jJJwlO0G616AZllJosrx3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:00:56.422445Z","bundle_sha256":"f750d38dca60114852165990adf8fad996a3db0184dc3550f4626a06c42cb79a"}}