{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CGFUK4DLAPVMTVR63UZ3LCKSBD","short_pith_number":"pith:CGFUK4DL","schema_version":"1.0","canonical_sha256":"118b45706b03eac9d63edd33b5895208e4300731d2460416f7157d4a081be427","source":{"kind":"arxiv","id":"1107.4162","version":1},"attestation_state":"computed","paper":{"title":"Local Optima Networks of NK Landscapes with Neutrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gabriela Ochoa, Marco Tomassini (ISI), S\\'ebastien Verel (INRIA Lille - Nord Europe)","submitted_at":"2011-07-21T05:08:03Z","abstract_excerpt":"In previous work we have introduced a network-based model that abstracts many details of the underlying landscape and compresses the landscape information into a weighted, oriented graph which we call the local optima network. The vertices of this graph are the local optima of the given fitness landscape, while the arcs are transition probabilities between local optima basins. Here we extend this formalism to neutral fitness landscapes, which are common in difficult combinatorial search spaces. By using two known neutral variants of the NK family (i.e. NKp and NKq) in which the amount of neutr"},"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":"1107.4162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-21T05:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"2f73cf0a6d38ee9737e833703a57deb69cdef8ecc5d3be5e13069305dd043765","abstract_canon_sha256":"d852aa01528bff5d6dedaf066242dc9ca93fda82c13e17d4733c6d1d73380d0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:13.107340Z","signature_b64":"WoiPY62QlpA6KL/KlF2uDSkZguKDOqHZRZbjqE8AsMcNlHkb5L1ZO+l/ldb7zX6fa6HuNd70ugDsiWThQQ2KDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"118b45706b03eac9d63edd33b5895208e4300731d2460416f7157d4a081be427","last_reissued_at":"2026-05-18T04:17:13.106691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:13.106691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Optima Networks of NK Landscapes with Neutrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gabriela Ochoa, Marco Tomassini (ISI), S\\'ebastien Verel (INRIA Lille - Nord Europe)","submitted_at":"2011-07-21T05:08:03Z","abstract_excerpt":"In previous work we have introduced a network-based model that abstracts many details of the underlying landscape and compresses the landscape information into a weighted, oriented graph which we call the local optima network. The vertices of this graph are the local optima of the given fitness landscape, while the arcs are transition probabilities between local optima basins. Here we extend this formalism to neutral fitness landscapes, which are common in difficult combinatorial search spaces. By using two known neutral variants of the NK family (i.e. NKp and NKq) in which the amount of neutr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4162","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.4162","created_at":"2026-05-18T04:17:13.106784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4162v1","created_at":"2026-05-18T04:17:13.106784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4162","created_at":"2026-05-18T04:17:13.106784+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGFUK4DLAPVM","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGFUK4DLAPVMTVR6","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGFUK4DL","created_at":"2026-05-18T12:26:26.731475+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/CGFUK4DLAPVMTVR63UZ3LCKSBD","json":"https://pith.science/pith/CGFUK4DLAPVMTVR63UZ3LCKSBD.json","graph_json":"https://pith.science/api/pith-number/CGFUK4DLAPVMTVR63UZ3LCKSBD/graph.json","events_json":"https://pith.science/api/pith-number/CGFUK4DLAPVMTVR63UZ3LCKSBD/events.json","paper":"https://pith.science/paper/CGFUK4DL"},"agent_actions":{"view_html":"https://pith.science/pith/CGFUK4DLAPVMTVR63UZ3LCKSBD","download_json":"https://pith.science/pith/CGFUK4DLAPVMTVR63UZ3LCKSBD.json","view_paper":"https://pith.science/paper/CGFUK4DL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4162&json=true","fetch_graph":"https://pith.science/api/pith-number/CGFUK4DLAPVMTVR63UZ3LCKSBD/graph.json","fetch_events":"https://pith.science/api/pith-number/CGFUK4DLAPVMTVR63UZ3LCKSBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGFUK4DLAPVMTVR63UZ3LCKSBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGFUK4DLAPVMTVR63UZ3LCKSBD/action/storage_attestation","attest_author":"https://pith.science/pith/CGFUK4DLAPVMTVR63UZ3LCKSBD/action/author_attestation","sign_citation":"https://pith.science/pith/CGFUK4DLAPVMTVR63UZ3LCKSBD/action/citation_signature","submit_replication":"https://pith.science/pith/CGFUK4DLAPVMTVR63UZ3LCKSBD/action/replication_record"}},"created_at":"2026-05-18T04:17:13.106784+00:00","updated_at":"2026-05-18T04:17:13.106784+00:00"}