{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EQZWHGRNHYYIADOHJIFS7REUJQ","short_pith_number":"pith:EQZWHGRN","schema_version":"1.0","canonical_sha256":"2433639a2d3e30800dc74a0b2fc4944c2f4c0f64922eebcfad73d78ef022a1c7","source":{"kind":"arxiv","id":"2306.00479","version":1},"attestation_state":"computed","paper":{"title":"Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ana Nikolikj, Carola Doerr, Mario Andr\\'es Mu\\~noz, Peter Koro\\v{s}ec, Sa\\v{s}o D\\v{z}eroski, Tome Eftimov","submitted_at":"2023-06-01T09:28:06Z","abstract_excerpt":"In black-box optimization, it is essential to understand why an algorithm instance works on a set of problem instances while failing on others and provide explanations of its behavior. We propose a methodology for formulating an algorithm instance footprint that consists of a set of problem instances that are easy to be solved and a set of problem instances that are difficult to be solved, for an algorithm instance. This behavior of the algorithm instance is further linked to the landscape properties of the problem instances to provide explanations of which properties make some problem instanc"},"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":"2306.00479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-06-01T09:28:06Z","cross_cats_sorted":[],"title_canon_sha256":"02c0344c56added899b61a2e6dc5a376ee6d9cb50eadb280daad4e353fc0f4c0","abstract_canon_sha256":"a88449947e8aecb76f4816ea82fedd98b537505f58cee794255bd95ae661d05d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:53.179107Z","signature_b64":"0RRz2w5v94eCB+ljXx8Gh63L/WSCEBA9k6qDhPwdQ+gVYdo8WPm5e59drO/piZvA5y0ARrTFhUvI136lTRP4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2433639a2d3e30800dc74a0b2fc4944c2f4c0f64922eebcfad73d78ef022a1c7","last_reissued_at":"2026-07-05T07:43:53.178683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:53.178683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ana Nikolikj, Carola Doerr, Mario Andr\\'es Mu\\~noz, Peter Koro\\v{s}ec, Sa\\v{s}o D\\v{z}eroski, Tome Eftimov","submitted_at":"2023-06-01T09:28:06Z","abstract_excerpt":"In black-box optimization, it is essential to understand why an algorithm instance works on a set of problem instances while failing on others and provide explanations of its behavior. We propose a methodology for formulating an algorithm instance footprint that consists of a set of problem instances that are easy to be solved and a set of problem instances that are difficult to be solved, for an algorithm instance. This behavior of the algorithm instance is further linked to the landscape properties of the problem instances to provide explanations of which properties make some problem instanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.00479","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/2306.00479/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":"2306.00479","created_at":"2026-07-05T07:43:53.178739+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.00479v1","created_at":"2026-07-05T07:43:53.178739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.00479","created_at":"2026-07-05T07:43:53.178739+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQZWHGRNHYYI","created_at":"2026-07-05T07:43:53.178739+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQZWHGRNHYYIADOH","created_at":"2026-07-05T07:43:53.178739+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQZWHGRN","created_at":"2026-07-05T07:43:53.178739+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/EQZWHGRNHYYIADOHJIFS7REUJQ","json":"https://pith.science/pith/EQZWHGRNHYYIADOHJIFS7REUJQ.json","graph_json":"https://pith.science/api/pith-number/EQZWHGRNHYYIADOHJIFS7REUJQ/graph.json","events_json":"https://pith.science/api/pith-number/EQZWHGRNHYYIADOHJIFS7REUJQ/events.json","paper":"https://pith.science/paper/EQZWHGRN"},"agent_actions":{"view_html":"https://pith.science/pith/EQZWHGRNHYYIADOHJIFS7REUJQ","download_json":"https://pith.science/pith/EQZWHGRNHYYIADOHJIFS7REUJQ.json","view_paper":"https://pith.science/paper/EQZWHGRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.00479&json=true","fetch_graph":"https://pith.science/api/pith-number/EQZWHGRNHYYIADOHJIFS7REUJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EQZWHGRNHYYIADOHJIFS7REUJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQZWHGRNHYYIADOHJIFS7REUJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQZWHGRNHYYIADOHJIFS7REUJQ/action/storage_attestation","attest_author":"https://pith.science/pith/EQZWHGRNHYYIADOHJIFS7REUJQ/action/author_attestation","sign_citation":"https://pith.science/pith/EQZWHGRNHYYIADOHJIFS7REUJQ/action/citation_signature","submit_replication":"https://pith.science/pith/EQZWHGRNHYYIADOHJIFS7REUJQ/action/replication_record"}},"created_at":"2026-07-05T07:43:53.178739+00:00","updated_at":"2026-07-05T07:43:53.178739+00:00"}