{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6MCMYNNOB6UQOTPLYE3EOMXN4R","short_pith_number":"pith:6MCMYNNO","schema_version":"1.0","canonical_sha256":"f304cc35ae0fa9074debc1364732ede4567202de81a3ce768f373985531d53ad","source":{"kind":"arxiv","id":"2409.01336","version":1},"attestation_state":"computed","paper":{"title":"Finding Large Independent Sets in Networks Using Competitive Dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"physics.soc-ph","authors_text":"Ivan Kryven, Niek Mooij","submitted_at":"2024-09-02T15:43:54Z","abstract_excerpt":"Many decision-making algorithms draw inspiration from the inner workings of individual biological systems. However, it remains unclear whether collective behavior among biological species can also lead to solutions for computational tasks. By studying the coexistence of species that interact through simple rules on a network, we demonstrate that the underlying dynamical system can recover near-optimal solutions to the maximum independent set problem -- a fundamental, computationally hard problem in graph theory. Furthermore, we observe that the optimality of these solutions is improved when th"},"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":"2409.01336","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"physics.soc-ph","submitted_at":"2024-09-02T15:43:54Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"682d79e21104cbfe07e7a8186bc07172bc6ea556415f3d8cae039c173c357ede","abstract_canon_sha256":"51e3eb483ec27ce1affcf436fba619b4bf711832bc1ca3a99fedfd5c05cddfe0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:27.852608Z","signature_b64":"adnUKOo4UGlxbASI2EzAFZaB3Kd1bzk+yCPp3/4tWRnpdWMUPgkwzFako0byodqJ+pEpFWWuZggmqqV6Ltf0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f304cc35ae0fa9074debc1364732ede4567202de81a3ce768f373985531d53ad","last_reissued_at":"2026-07-05T09:02:27.852206Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:27.852206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Large Independent Sets in Networks Using Competitive Dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"physics.soc-ph","authors_text":"Ivan Kryven, Niek Mooij","submitted_at":"2024-09-02T15:43:54Z","abstract_excerpt":"Many decision-making algorithms draw inspiration from the inner workings of individual biological systems. However, it remains unclear whether collective behavior among biological species can also lead to solutions for computational tasks. By studying the coexistence of species that interact through simple rules on a network, we demonstrate that the underlying dynamical system can recover near-optimal solutions to the maximum independent set problem -- a fundamental, computationally hard problem in graph theory. Furthermore, we observe that the optimality of these solutions is improved when th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01336","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/2409.01336/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":"2409.01336","created_at":"2026-07-05T09:02:27.852269+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.01336v1","created_at":"2026-07-05T09:02:27.852269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01336","created_at":"2026-07-05T09:02:27.852269+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MCMYNNOB6UQ","created_at":"2026-07-05T09:02:27.852269+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MCMYNNOB6UQOTPL","created_at":"2026-07-05T09:02:27.852269+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MCMYNNO","created_at":"2026-07-05T09:02:27.852269+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/6MCMYNNOB6UQOTPLYE3EOMXN4R","json":"https://pith.science/pith/6MCMYNNOB6UQOTPLYE3EOMXN4R.json","graph_json":"https://pith.science/api/pith-number/6MCMYNNOB6UQOTPLYE3EOMXN4R/graph.json","events_json":"https://pith.science/api/pith-number/6MCMYNNOB6UQOTPLYE3EOMXN4R/events.json","paper":"https://pith.science/paper/6MCMYNNO"},"agent_actions":{"view_html":"https://pith.science/pith/6MCMYNNOB6UQOTPLYE3EOMXN4R","download_json":"https://pith.science/pith/6MCMYNNOB6UQOTPLYE3EOMXN4R.json","view_paper":"https://pith.science/paper/6MCMYNNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.01336&json=true","fetch_graph":"https://pith.science/api/pith-number/6MCMYNNOB6UQOTPLYE3EOMXN4R/graph.json","fetch_events":"https://pith.science/api/pith-number/6MCMYNNOB6UQOTPLYE3EOMXN4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MCMYNNOB6UQOTPLYE3EOMXN4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MCMYNNOB6UQOTPLYE3EOMXN4R/action/storage_attestation","attest_author":"https://pith.science/pith/6MCMYNNOB6UQOTPLYE3EOMXN4R/action/author_attestation","sign_citation":"https://pith.science/pith/6MCMYNNOB6UQOTPLYE3EOMXN4R/action/citation_signature","submit_replication":"https://pith.science/pith/6MCMYNNOB6UQOTPLYE3EOMXN4R/action/replication_record"}},"created_at":"2026-07-05T09:02:27.852269+00:00","updated_at":"2026-07-05T09:02:27.852269+00:00"}