{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:AOMXZAAQRQOVZFKSAZIC4CJ7C3","short_pith_number":"pith:AOMXZAAQ","canonical_record":{"source":{"id":"cs/0702037","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"2007-02-07T05:29:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"32b2386aba2632451d098398fb4f267b6f4eb5e3d4c7aa7b4fb86ac0328a5d40","abstract_canon_sha256":"45e85c43c8a25532ad92a0a231b1b1d377311826309b7c06150d94d15026c7e5"},"schema_version":"1.0"},"canonical_sha256":"03997c80108c1d5c955206502e093f16e1d555afe0b65967fe92123db930fdd1","source":{"kind":"arxiv","id":"cs/0702037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702037","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702037v1","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702037","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"AOMXZAAQRQOV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"AOMXZAAQRQOVZFKS","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"AOMXZAAQ","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:AOMXZAAQRQOVZFKSAZIC4CJ7C3","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0702037","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"2007-02-07T05:29:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"32b2386aba2632451d098398fb4f267b6f4eb5e3d4c7aa7b4fb86ac0328a5d40","abstract_canon_sha256":"45e85c43c8a25532ad92a0a231b1b1d377311826309b7c06150d94d15026c7e5"},"schema_version":"1.0"},"canonical_sha256":"03997c80108c1d5c955206502e093f16e1d555afe0b65967fe92123db930fdd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:56.157931Z","signature_b64":"DMe8MTP5YgH7sVE+0VlkR6Wew+OkI8BemGFsPHmTrWYPRxe/Tz6Kq+12pgqOgrbmsIra0ZZigVuvokvqkb+NAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03997c80108c1d5c955206502e093f16e1d555afe0b65967fe92123db930fdd1","last_reissued_at":"2026-05-18T00:58:56.157351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:56.157351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0702037","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kFhJOHYrKipZzoBQH+YRFS1HuF3xjSECK4EyIEkYM1qklbrdpyoHOyxQmurSVdgU3kOAZrUmdmk9RoWy5+zxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:33:25.992785Z"},"content_sha256":"045b9830a0de48b94ecc59cc17f07704b41a798c4a51a2289ac8396e2af9ba44","schema_version":"1.0","event_id":"sha256:045b9830a0de48b94ecc59cc17f07704b41a798c4a51a2289ac8396e2af9ba44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:AOMXZAAQRQOVZFKSAZIC4CJ7C3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evolutionary Approaches to Minimizing Network Coding Resources","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Chang Wook Ahn, Michelle Effros, Minkyu Kim, Muriel Medard, Una-May O'Reilly, Varun Aggarwal, Wonsik Kim","submitted_at":"2007-02-07T05:29:25Z","abstract_excerpt":"We wish to minimize the resources used for network coding while achieving the desired throughput in a multicast scenario. We employ evolutionary approaches, based on a genetic algorithm, that avoid the computational complexity that makes the problem NP-hard. Our experiments show great improvements over the sub-optimal solutions of prior methods. Our new algorithms improve over our previously proposed algorithm in three ways. First, whereas the previous algorithm can be applied only to acyclic networks, our new method works also with networks with cycles. Second, we enrich the set of components"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702037","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2V9dnV2DvuCDOFJWbTw79rE5xS+boZnJdmWuMWDcx3i4gXwNmhxm5TsZWneMUn2XaPuxGSx584VwwkVDuA5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:33:25.993137Z"},"content_sha256":"170697a3245d7a8e4c8626f47ef9b434baa0e31e3c3d19471dcbc1bdc980a13d","schema_version":"1.0","event_id":"sha256:170697a3245d7a8e4c8626f47ef9b434baa0e31e3c3d19471dcbc1bdc980a13d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOMXZAAQRQOVZFKSAZIC4CJ7C3/bundle.json","state_url":"https://pith.science/pith/AOMXZAAQRQOVZFKSAZIC4CJ7C3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOMXZAAQRQOVZFKSAZIC4CJ7C3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T16:33:25Z","links":{"resolver":"https://pith.science/pith/AOMXZAAQRQOVZFKSAZIC4CJ7C3","bundle":"https://pith.science/pith/AOMXZAAQRQOVZFKSAZIC4CJ7C3/bundle.json","state":"https://pith.science/pith/AOMXZAAQRQOVZFKSAZIC4CJ7C3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOMXZAAQRQOVZFKSAZIC4CJ7C3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:AOMXZAAQRQOVZFKSAZIC4CJ7C3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"45e85c43c8a25532ad92a0a231b1b1d377311826309b7c06150d94d15026c7e5","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.NI","submitted_at":"2007-02-07T05:29:25Z","title_canon_sha256":"32b2386aba2632451d098398fb4f267b6f4eb5e3d4c7aa7b4fb86ac0328a5d40"},"schema_version":"1.0","source":{"id":"cs/0702037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702037","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702037v1","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702037","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"AOMXZAAQRQOV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"AOMXZAAQRQOVZFKS","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"AOMXZAAQ","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:170697a3245d7a8e4c8626f47ef9b434baa0e31e3c3d19471dcbc1bdc980a13d","target":"graph","created_at":"2026-05-18T00:58:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We wish to minimize the resources used for network coding while achieving the desired throughput in a multicast scenario. We employ evolutionary approaches, based on a genetic algorithm, that avoid the computational complexity that makes the problem NP-hard. Our experiments show great improvements over the sub-optimal solutions of prior methods. Our new algorithms improve over our previously proposed algorithm in three ways. First, whereas the previous algorithm can be applied only to acyclic networks, our new method works also with networks with cycles. Second, we enrich the set of components","authors_text":"Chang Wook Ahn, Michelle Effros, Minkyu Kim, Muriel Medard, Una-May O'Reilly, Varun Aggarwal, Wonsik Kim","cross_cats":["cs.IT","math.IT"],"headline":"","license":"","primary_cat":"cs.NI","submitted_at":"2007-02-07T05:29:25Z","title":"Evolutionary Approaches to Minimizing Network Coding Resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702037","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:045b9830a0de48b94ecc59cc17f07704b41a798c4a51a2289ac8396e2af9ba44","target":"record","created_at":"2026-05-18T00:58:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"45e85c43c8a25532ad92a0a231b1b1d377311826309b7c06150d94d15026c7e5","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.NI","submitted_at":"2007-02-07T05:29:25Z","title_canon_sha256":"32b2386aba2632451d098398fb4f267b6f4eb5e3d4c7aa7b4fb86ac0328a5d40"},"schema_version":"1.0","source":{"id":"cs/0702037","kind":"arxiv","version":1}},"canonical_sha256":"03997c80108c1d5c955206502e093f16e1d555afe0b65967fe92123db930fdd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03997c80108c1d5c955206502e093f16e1d555afe0b65967fe92123db930fdd1","first_computed_at":"2026-05-18T00:58:56.157351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:56.157351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DMe8MTP5YgH7sVE+0VlkR6Wew+OkI8BemGFsPHmTrWYPRxe/Tz6Kq+12pgqOgrbmsIra0ZZigVuvokvqkb+NAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:56.157931Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0702037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:045b9830a0de48b94ecc59cc17f07704b41a798c4a51a2289ac8396e2af9ba44","sha256:170697a3245d7a8e4c8626f47ef9b434baa0e31e3c3d19471dcbc1bdc980a13d"],"state_sha256":"53661861e7c0391286524d25a98f6eebb610c940016ed2f0183a5ab2f99d68d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z0HGVdKUME5hwO4yjxBK0iS/a5TSD+aubPynm+k4gLYdXZnoOWdAFrXbvc8UKAG9ZS6oFUCoP6Sf7ZJM+qRgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:33:25.995164Z","bundle_sha256":"02af094612c9bc67f0f49f8c52a93301795e3af4522d3e38c45fe1fc46fdb0af"}}