{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:GW64ZWYCC4U3R3SLADRVCJTXAJ","short_pith_number":"pith:GW64ZWYC","schema_version":"1.0","canonical_sha256":"35bdccdb021729b8ee4b00e3512677026f77d8f23fa5c84d9e10c44c6294043a","source":{"kind":"arxiv","id":"0802.2836","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0802.2836","created_at":"2026-05-17T23:42:03.645453+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.2836v1","created_at":"2026-05-17T23:42:03.645453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.2836","created_at":"2026-05-17T23:42:03.645453+00:00"},{"alias_kind":"pith_short_12","alias_value":"GW64ZWYCC4U3","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"GW64ZWYCC4U3R3SL","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"GW64ZWYC","created_at":"2026-05-18T12:25:57.157939+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/GW64ZWYCC4U3R3SLADRVCJTXAJ","json":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ.json","graph_json":"https://pith.science/api/pith-number/GW64ZWYCC4U3R3SLADRVCJTXAJ/graph.json","events_json":"https://pith.science/api/pith-number/GW64ZWYCC4U3R3SLADRVCJTXAJ/events.json","paper":"https://pith.science/paper/GW64ZWYC"},"agent_actions":{"view_html":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ","download_json":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ.json","view_paper":"https://pith.science/paper/GW64ZWYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.2836&json=true","fetch_graph":"https://pith.science/api/pith-number/GW64ZWYCC4U3R3SLADRVCJTXAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GW64ZWYCC4U3R3SLADRVCJTXAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/action/storage_attestation","attest_author":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/action/author_attestation","sign_citation":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/action/citation_signature","submit_replication":"https://pith.science/pith/GW64ZWYCC4U3R3SLADRVCJTXAJ/action/replication_record"}},"created_at":"2026-05-17T23:42:03.645453+00:00","updated_at":"2026-05-17T23:42:03.645453+00:00"}