{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:GW64ZWYCC4U3R3SLADRVCJTXAJ","short_pith_number":"pith:GW64ZWYC","canonical_record":{"source":{"id":"0802.2836","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2008-02-20T14:18:24Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"ef8b0dd6dabcc41ba5450524eecf60e20bdd6e540c05602ef66db599947eac2a","abstract_canon_sha256":"c3e41e1a5e9cd1e7bc90aa3c2c8321f257bf824c6c090e7041a9f68275f66806"},"schema_version":"1.0"},"canonical_sha256":"35bdccdb021729b8ee4b00e3512677026f77d8f23fa5c84d9e10c44c6294043a","source":{"kind":"arxiv","id":"0802.2836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.2836","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"0802.2836v1","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.2836","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"GW64ZWYCC4U3","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GW64ZWYCC4U3R3SL","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GW64ZWYC","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:GW64ZWYCC4U3R3SLADRVCJTXAJ","target":"record","payload":{"canonical_record":{"source":{"id":"0802.2836","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2008-02-20T14:18:24Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"ef8b0dd6dabcc41ba5450524eecf60e20bdd6e540c05602ef66db599947eac2a","abstract_canon_sha256":"c3e41e1a5e9cd1e7bc90aa3c2c8321f257bf824c6c090e7041a9f68275f66806"},"schema_version":"1.0"},"canonical_sha256":"35bdccdb021729b8ee4b00e3512677026f77d8f23fa5c84d9e10c44c6294043a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:03.645937Z","signature_b64":"PTwiXaFnZu1Yseu8/NF/Qnv+E0LG5HxqYPhHK60doAxLK3WjLLzr+TX2Z9kshpy6pReNxK2AXFYx8ZR9nW0MDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35bdccdb021729b8ee4b00e3512677026f77d8f23fa5c84d9e10c44c6294043a","last_reissued_at":"2026-05-17T23:42:03.645354Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:03.645354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0802.2836","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-17T23:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMGfxvCOPsZ0zMljHfRqiWiGZo68bg+mqi+Wm+VdRou3URkWbyoSVFg6ig6BkBoW31+h1kpCM+CsawB9Go6QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:04:03.278503Z"},"content_sha256":"5bbf2bfd83bc3ca48eed5791609682d25c01467dc7009a75395671b201214862","schema_version":"1.0","event_id":"sha256:5bbf2bfd83bc3ca48eed5791609682d25c01467dc7009a75395671b201214862"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:GW64ZWYCC4U3R3SLADRVCJTXAJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Flow Time in the Wireless Gathering Problem","license":"","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Alberto Marchetti-Spaccamela, Leen Stougie (CWI), Peter Korteweg, Vincenzo Bonifaci","submitted_at":"2008-02-20T14:18:24Z","abstract_excerpt":"We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this problem can have approximation ratio less than $\\Omega(m^{1/3)$ when $m$ packets have to be transmitted, unless $P = NP$. We then use resource augmentation to assess the performance of a FIFO-like strategy. We prove that this strategy is 5-speed optimal, i.e., its cost remains within the optimal cost if we allow the algorithm to transmit data at a speed 5 time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.2836","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-17T23:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzmJp3W+CEChvYNKP00Ost4p71O/ch83JE4GZetjDtwaPXkdXVgAwMEh3IVJzfhVexNpvqzrn/em5Y7+qetwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:04:03.278983Z"},"content_sha256":"75398d4b654bcc7173041691768f8b5be2ebe0fc82b9666131528d4ef2946c78","schema_version":"1.0","event_id":"sha256:75398d4b654bcc7173041691768f8b5be2ebe0fc82b9666131528d4ef2946c78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/bundle.json","state_url":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/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-22T07:04:03Z","links":{"resolver":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ","bundle":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/bundle.json","state":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:GW64ZWYCC4U3R3SLADRVCJTXAJ","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":"c3e41e1a5e9cd1e7bc90aa3c2c8321f257bf824c6c090e7041a9f68275f66806","cross_cats_sorted":["cs.NI"],"license":"","primary_cat":"cs.DS","submitted_at":"2008-02-20T14:18:24Z","title_canon_sha256":"ef8b0dd6dabcc41ba5450524eecf60e20bdd6e540c05602ef66db599947eac2a"},"schema_version":"1.0","source":{"id":"0802.2836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.2836","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"0802.2836v1","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.2836","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"GW64ZWYCC4U3","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GW64ZWYCC4U3R3SL","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GW64ZWYC","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:75398d4b654bcc7173041691768f8b5be2ebe0fc82b9666131528d4ef2946c78","target":"graph","created_at":"2026-05-17T23:42:03Z","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 address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this problem can have approximation ratio less than $\\Omega(m^{1/3)$ when $m$ packets have to be transmitted, unless $P = NP$. We then use resource augmentation to assess the performance of a FIFO-like strategy. We prove that this strategy is 5-speed optimal, i.e., its cost remains within the optimal cost if we allow the algorithm to transmit data at a speed 5 time","authors_text":"Alberto Marchetti-Spaccamela, Leen Stougie (CWI), Peter Korteweg, Vincenzo Bonifaci","cross_cats":["cs.NI"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2008-02-20T14:18:24Z","title":"Minimizing Flow Time in the Wireless Gathering Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.2836","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:5bbf2bfd83bc3ca48eed5791609682d25c01467dc7009a75395671b201214862","target":"record","created_at":"2026-05-17T23:42:03Z","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":"c3e41e1a5e9cd1e7bc90aa3c2c8321f257bf824c6c090e7041a9f68275f66806","cross_cats_sorted":["cs.NI"],"license":"","primary_cat":"cs.DS","submitted_at":"2008-02-20T14:18:24Z","title_canon_sha256":"ef8b0dd6dabcc41ba5450524eecf60e20bdd6e540c05602ef66db599947eac2a"},"schema_version":"1.0","source":{"id":"0802.2836","kind":"arxiv","version":1}},"canonical_sha256":"35bdccdb021729b8ee4b00e3512677026f77d8f23fa5c84d9e10c44c6294043a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35bdccdb021729b8ee4b00e3512677026f77d8f23fa5c84d9e10c44c6294043a","first_computed_at":"2026-05-17T23:42:03.645354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:03.645354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PTwiXaFnZu1Yseu8/NF/Qnv+E0LG5HxqYPhHK60doAxLK3WjLLzr+TX2Z9kshpy6pReNxK2AXFYx8ZR9nW0MDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:03.645937Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.2836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bbf2bfd83bc3ca48eed5791609682d25c01467dc7009a75395671b201214862","sha256:75398d4b654bcc7173041691768f8b5be2ebe0fc82b9666131528d4ef2946c78"],"state_sha256":"138d4d1c543e3d7b9570ac28693e8564487ed2f3a37c8d39fb360cb388178248"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpP5pBLqD68vioZOecVaEFlW50ovWF7vM9TfyjnF9F6IRoSjwOz2yTzXZHPRSdBA1cG4EbbLgTKtRmZ/k9PfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T07:04:03.282383Z","bundle_sha256":"edfb961098f0a6685f75908adb68b257e62169783ca89e795309459fa3f64153"}}