{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:EKESYTWUPSKUZK3SEEDFJXTKSF","short_pith_number":"pith:EKESYTWU","canonical_record":{"source":{"id":"cs/0503064","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-03-24T05:02:19Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"f8fe644f729f3a17d1102f5ba454ef87f35d60884b510b86513178124cd7e885","abstract_canon_sha256":"2c921153543dc11d9a6d366ee0c8a8e2f0c52485242ef6c63145d2007f3cf621"},"schema_version":"1.0"},"canonical_sha256":"22892c4ed47c954cab72210654de6a91418cd609472df1d1c427998d848626dc","source":{"kind":"arxiv","id":"cs/0503064","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0503064","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0503064v2","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0503064","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"EKESYTWUPSKU","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"EKESYTWUPSKUZK3S","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"EKESYTWU","created_at":"2026-07-04T15:03:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:EKESYTWUPSKUZK3SEEDFJXTKSF","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0503064","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-03-24T05:02:19Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"f8fe644f729f3a17d1102f5ba454ef87f35d60884b510b86513178124cd7e885","abstract_canon_sha256":"2c921153543dc11d9a6d366ee0c8a8e2f0c52485242ef6c63145d2007f3cf621"},"schema_version":"1.0"},"canonical_sha256":"22892c4ed47c954cab72210654de6a91418cd609472df1d1c427998d848626dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:03:00.026960Z","signature_b64":"N89vre7pshSE45hsl70wCqxEIyk2nsj44drwlNUgFoNF5JajmNtYCKBbG3+f3RgCopfi0C/Qz5P8kzqsb6nmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22892c4ed47c954cab72210654de6a91418cd609472df1d1c427998d848626dc","last_reissued_at":"2026-07-04T15:03:00.026624Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:03:00.026624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0503064","source_version":2,"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-07-04T15:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5nDKEOU2E/RUAGqJwQGegkx9IqS8OlR1nyO0NrVHjPXS2KNK3b008hQ7kPaxnJVbUdRMobBVf8adoIzC6r1xDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:33:14.063767Z"},"content_sha256":"2a14bc4ee2a0c1ac9e7f9b2bd8aa1ac37a023837a1d3624911e0b7881768701c","schema_version":"1.0","event_id":"sha256:2a14bc4ee2a0c1ac9e7f9b2bd8aa1ac37a023837a1d3624911e0b7881768701c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:EKESYTWUPSKUZK3SEEDFJXTKSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum-Cost Multicast over Coded Packet Networks","license":"","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"David R. Karger, Desmond S. Lun, Ebad Ahmed, Fang Zhao, Muriel Medard, Niranjan Ratnakar, Ralf Koetter, Tracey Ho","submitted_at":"2005-03-24T05:02:19Z","abstract_excerpt":"We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e. packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group).\n  For static multicast, we reduce the problem to a polynomial-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0503064","kind":"arxiv","version":2},"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/0503064/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"},"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-07-04T15:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bj5jQaYj71CYSDkA6NHSBN2brK9N/mSofoGk24Or8xyBDINqlPZh1rAImwOtCXRQ64IZGbdmUZJpEykc5GklCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:33:14.064519Z"},"content_sha256":"1f83c165fc3979903159d0c0d0db8f1aa705e53c7d65538e46779ba0c8c88edc","schema_version":"1.0","event_id":"sha256:1f83c165fc3979903159d0c0d0db8f1aa705e53c7d65538e46779ba0c8c88edc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKESYTWUPSKUZK3SEEDFJXTKSF/bundle.json","state_url":"https://pith.science/pith/EKESYTWUPSKUZK3SEEDFJXTKSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKESYTWUPSKUZK3SEEDFJXTKSF/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-08-05T23:33:14Z","links":{"resolver":"https://pith.science/pith/EKESYTWUPSKUZK3SEEDFJXTKSF","bundle":"https://pith.science/pith/EKESYTWUPSKUZK3SEEDFJXTKSF/bundle.json","state":"https://pith.science/pith/EKESYTWUPSKUZK3SEEDFJXTKSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKESYTWUPSKUZK3SEEDFJXTKSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:EKESYTWUPSKUZK3SEEDFJXTKSF","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":"2c921153543dc11d9a6d366ee0c8a8e2f0c52485242ef6c63145d2007f3cf621","cross_cats_sorted":["cs.NI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-03-24T05:02:19Z","title_canon_sha256":"f8fe644f729f3a17d1102f5ba454ef87f35d60884b510b86513178124cd7e885"},"schema_version":"1.0","source":{"id":"cs/0503064","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0503064","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0503064v2","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0503064","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"EKESYTWUPSKU","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"EKESYTWUPSKUZK3S","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"EKESYTWU","created_at":"2026-07-04T15:03:00Z"}],"graph_snapshots":[{"event_id":"sha256:1f83c165fc3979903159d0c0d0db8f1aa705e53c7d65538e46779ba0c8c88edc","target":"graph","created_at":"2026-07-04T15:03:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0503064/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e. packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group).\n  For static multicast, we reduce the problem to a polynomial-t","authors_text":"David R. Karger, Desmond S. Lun, Ebad Ahmed, Fang Zhao, Muriel Medard, Niranjan Ratnakar, Ralf Koetter, Tracey Ho","cross_cats":["cs.NI","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-03-24T05:02:19Z","title":"Minimum-Cost Multicast over Coded Packet Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0503064","kind":"arxiv","version":2},"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:2a14bc4ee2a0c1ac9e7f9b2bd8aa1ac37a023837a1d3624911e0b7881768701c","target":"record","created_at":"2026-07-04T15:03:00Z","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":"2c921153543dc11d9a6d366ee0c8a8e2f0c52485242ef6c63145d2007f3cf621","cross_cats_sorted":["cs.NI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-03-24T05:02:19Z","title_canon_sha256":"f8fe644f729f3a17d1102f5ba454ef87f35d60884b510b86513178124cd7e885"},"schema_version":"1.0","source":{"id":"cs/0503064","kind":"arxiv","version":2}},"canonical_sha256":"22892c4ed47c954cab72210654de6a91418cd609472df1d1c427998d848626dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22892c4ed47c954cab72210654de6a91418cd609472df1d1c427998d848626dc","first_computed_at":"2026-07-04T15:03:00.026624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:03:00.026624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N89vre7pshSE45hsl70wCqxEIyk2nsj44drwlNUgFoNF5JajmNtYCKBbG3+f3RgCopfi0C/Qz5P8kzqsb6nmCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:03:00.026960Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0503064","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a14bc4ee2a0c1ac9e7f9b2bd8aa1ac37a023837a1d3624911e0b7881768701c","sha256:1f83c165fc3979903159d0c0d0db8f1aa705e53c7d65538e46779ba0c8c88edc"],"state_sha256":"266354a25bbc39b71e270f6b40eec8aa872629b500aeade444baf38398fd2cc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEFj+HuGxueu9e6GJ2znJBJnQdLSFQ6tbxe+K0Y5zC5s2m/ukgHcYI4Kr78IHyVU0RYDYSAv9dWXpXkIrVdzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:33:14.070017Z","bundle_sha256":"36bd89a84d2055a4f30639f7d4223569a5d0d35afd76bbddc6117699c7500191"}}