{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZIOZ3JBA6OWLEJZSKYZLHWU7V3","short_pith_number":"pith:ZIOZ3JBA","schema_version":"1.0","canonical_sha256":"ca1d9da420f3acb227325632b3da9faecc01dbf9d2d27ddfe6dc0dc1fc2542ae","source":{"kind":"arxiv","id":"1505.02348","version":4},"attestation_state":"computed","paper":{"title":"The Topology of Biological Networks from a Complexity Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","q-bio.MN"],"primary_cat":"cs.SI","authors_text":"Ali Atiia, Fran\\c{c}ois Major, J\\'er\\^ome Waldisp\\\"uhl","submitted_at":"2015-05-10T07:06:20Z","abstract_excerpt":"A complexity-theoretic approach to studying biological networks is proposed. A simple graph representation is used where molecules (DNA, RNA, proteins and chemicals) are vertices and relations between them are directed and signed (promotional (+) or inhibitory (-)) edges. Based on this model, the problem of network evolution (NE) is defined formally as an optimization problem and subsequently proven to be fundamentally hard (NP-hard) by means of reduction from the Knapsack problem (KP). Second, for empirical validation, various biological networks of experimentally-validated interactions are c"},"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":"1505.02348","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-05-10T07:06:20Z","cross_cats_sorted":["physics.soc-ph","q-bio.MN"],"title_canon_sha256":"7c83dac74bf0c27efe2ed8d9069c22289c75798cd4c7de272069c827384de4bb","abstract_canon_sha256":"1a05d0c3b1d4df1c6d37e3a38c2074b68f9e870b7c02554d8a0012f05a84d653"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:46.641469Z","signature_b64":"locY3aFUeG733aKPqLT0GS/2MWweIlNU3+sce90j6dT7wLpwJqCuMLFzrQBWzQy1Z58+TDWeghtmqfYkui5AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca1d9da420f3acb227325632b3da9faecc01dbf9d2d27ddfe6dc0dc1fc2542ae","last_reissued_at":"2026-05-18T00:17:46.641027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:46.641027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Topology of Biological Networks from a Complexity Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","q-bio.MN"],"primary_cat":"cs.SI","authors_text":"Ali Atiia, Fran\\c{c}ois Major, J\\'er\\^ome Waldisp\\\"uhl","submitted_at":"2015-05-10T07:06:20Z","abstract_excerpt":"A complexity-theoretic approach to studying biological networks is proposed. A simple graph representation is used where molecules (DNA, RNA, proteins and chemicals) are vertices and relations between them are directed and signed (promotional (+) or inhibitory (-)) edges. Based on this model, the problem of network evolution (NE) is defined formally as an optimization problem and subsequently proven to be fundamentally hard (NP-hard) by means of reduction from the Knapsack problem (KP). Second, for empirical validation, various biological networks of experimentally-validated interactions are c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02348","kind":"arxiv","version":4},"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":"1505.02348","created_at":"2026-05-18T00:17:46.641101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02348v4","created_at":"2026-05-18T00:17:46.641101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02348","created_at":"2026-05-18T00:17:46.641101+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIOZ3JBA6OWL","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIOZ3JBA6OWLEJZS","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIOZ3JBA","created_at":"2026-05-18T12:29:52.810259+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/ZIOZ3JBA6OWLEJZSKYZLHWU7V3","json":"https://pith.science/pith/ZIOZ3JBA6OWLEJZSKYZLHWU7V3.json","graph_json":"https://pith.science/api/pith-number/ZIOZ3JBA6OWLEJZSKYZLHWU7V3/graph.json","events_json":"https://pith.science/api/pith-number/ZIOZ3JBA6OWLEJZSKYZLHWU7V3/events.json","paper":"https://pith.science/paper/ZIOZ3JBA"},"agent_actions":{"view_html":"https://pith.science/pith/ZIOZ3JBA6OWLEJZSKYZLHWU7V3","download_json":"https://pith.science/pith/ZIOZ3JBA6OWLEJZSKYZLHWU7V3.json","view_paper":"https://pith.science/paper/ZIOZ3JBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02348&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIOZ3JBA6OWLEJZSKYZLHWU7V3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIOZ3JBA6OWLEJZSKYZLHWU7V3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIOZ3JBA6OWLEJZSKYZLHWU7V3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIOZ3JBA6OWLEJZSKYZLHWU7V3/action/storage_attestation","attest_author":"https://pith.science/pith/ZIOZ3JBA6OWLEJZSKYZLHWU7V3/action/author_attestation","sign_citation":"https://pith.science/pith/ZIOZ3JBA6OWLEJZSKYZLHWU7V3/action/citation_signature","submit_replication":"https://pith.science/pith/ZIOZ3JBA6OWLEJZSKYZLHWU7V3/action/replication_record"}},"created_at":"2026-05-18T00:17:46.641101+00:00","updated_at":"2026-05-18T00:17:46.641101+00:00"}