{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:R62YWZXO45PI2E4PXWR7QLQJXG","short_pith_number":"pith:R62YWZXO","schema_version":"1.0","canonical_sha256":"8fb58b66eee75e8d138fbda3f82e09b993deb8e46b229488a1793980311bdf4e","source":{"kind":"arxiv","id":"cs/0702038","version":1},"attestation_state":"computed","paper":{"title":"Genetic Representations for Evolutionary Minimization of Network Coding Resources","license":"","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.NE","authors_text":"Minkyu Kim, Muriel Medard, Una-May O'Reilly, Varun Aggarwal, Wonsik Kim","submitted_at":"2007-02-07T05:54:00Z","abstract_excerpt":"We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario. A genetic algorithm avoids the computational complexity that makes the problem NP-hard and, for our experiments, greatly improves on sub-optimal solutions of established methods. We compare two different genotype encodings, which tradeoff search space size with fitness landscape, as well as the associated genetic operators. Our finding favors a smaller encoding despite its fewer intermediate solutions and demonstrates the im"},"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":"cs/0702038","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NE","submitted_at":"2007-02-07T05:54:00Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"acd572f9e721f21c74d0d91f2eff8081ad276d13f5bcb51ad62dd66db14d4ce5","abstract_canon_sha256":"1a4a74844520990ca0d1612d52d4296d7e3332d8a8d07f2856d5de59275df83c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:59:17.848136Z","signature_b64":"E0+socpTTwv5+SxtSDT7cST0ut1mMN+DbFfcbRor0aBsbInSW6qXXt65FMUoxRAfji4udJod9VOGZ74sKoUJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb58b66eee75e8d138fbda3f82e09b993deb8e46b229488a1793980311bdf4e","last_reissued_at":"2026-07-04T14:59:17.847787Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:59:17.847787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genetic Representations for Evolutionary Minimization of Network Coding Resources","license":"","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.NE","authors_text":"Minkyu Kim, Muriel Medard, Una-May O'Reilly, Varun Aggarwal, Wonsik Kim","submitted_at":"2007-02-07T05:54:00Z","abstract_excerpt":"We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario. A genetic algorithm avoids the computational complexity that makes the problem NP-hard and, for our experiments, greatly improves on sub-optimal solutions of established methods. We compare two different genotype encodings, which tradeoff search space size with fitness landscape, as well as the associated genetic operators. Our finding favors a smaller encoding despite its fewer intermediate solutions and demonstrates the im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702038","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/cs/0702038/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":"cs/0702038","created_at":"2026-07-04T14:59:17.847849+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0702038v1","created_at":"2026-07-04T14:59:17.847849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702038","created_at":"2026-07-04T14:59:17.847849+00:00"},{"alias_kind":"pith_short_12","alias_value":"R62YWZXO45PI","created_at":"2026-07-04T14:59:17.847849+00:00"},{"alias_kind":"pith_short_16","alias_value":"R62YWZXO45PI2E4P","created_at":"2026-07-04T14:59:17.847849+00:00"},{"alias_kind":"pith_short_8","alias_value":"R62YWZXO","created_at":"2026-07-04T14:59:17.847849+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/R62YWZXO45PI2E4PXWR7QLQJXG","json":"https://pith.science/pith/R62YWZXO45PI2E4PXWR7QLQJXG.json","graph_json":"https://pith.science/api/pith-number/R62YWZXO45PI2E4PXWR7QLQJXG/graph.json","events_json":"https://pith.science/api/pith-number/R62YWZXO45PI2E4PXWR7QLQJXG/events.json","paper":"https://pith.science/paper/R62YWZXO"},"agent_actions":{"view_html":"https://pith.science/pith/R62YWZXO45PI2E4PXWR7QLQJXG","download_json":"https://pith.science/pith/R62YWZXO45PI2E4PXWR7QLQJXG.json","view_paper":"https://pith.science/paper/R62YWZXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0702038&json=true","fetch_graph":"https://pith.science/api/pith-number/R62YWZXO45PI2E4PXWR7QLQJXG/graph.json","fetch_events":"https://pith.science/api/pith-number/R62YWZXO45PI2E4PXWR7QLQJXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R62YWZXO45PI2E4PXWR7QLQJXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R62YWZXO45PI2E4PXWR7QLQJXG/action/storage_attestation","attest_author":"https://pith.science/pith/R62YWZXO45PI2E4PXWR7QLQJXG/action/author_attestation","sign_citation":"https://pith.science/pith/R62YWZXO45PI2E4PXWR7QLQJXG/action/citation_signature","submit_replication":"https://pith.science/pith/R62YWZXO45PI2E4PXWR7QLQJXG/action/replication_record"}},"created_at":"2026-07-04T14:59:17.847849+00:00","updated_at":"2026-07-04T14:59:17.847849+00:00"}