{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GPU6DN3XPHZEWLGSMWKSAX2JS5","short_pith_number":"pith:GPU6DN3X","schema_version":"1.0","canonical_sha256":"33e9e1b77779f24b2cd26595205f4997604ee03651ea9e8f39c5be8b8d8d1133","source":{"kind":"arxiv","id":"1702.00787","version":1},"attestation_state":"computed","paper":{"title":"Distributed Approximation Algorithms for the Multiple Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Ananth Murthy, Chandan Yeshwanth, Shrisha Rao","submitted_at":"2017-02-02T09:55:43Z","abstract_excerpt":"We consider the distributed version of the Multiple Knapsack Problem (MKP), where $m$ items are to be distributed amongst $n$ processors, each with a knapsack. We propose different distributed approximation algorithms with a tradeoff between time and message complexities. The algorithms are based on the greedy approach of assigning the best item to the knapsack with the largest capacity. These algorithms obtain a solution with a bound of $\\frac{1}{n+1}$ times the optimum solution, with either $\\mathcal{O}\\left(m\\log n\\right)$ time and $\\mathcal{O}\\left(m n\\right)$ messages, or $\\mathcal{O}\\lef"},"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":"1702.00787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-02T09:55:43Z","cross_cats_sorted":["cs.DC","cs.DM"],"title_canon_sha256":"6069359b91e34bf4554981db55c708548b9cdaaf1f41e43af0f8598efc655e5f","abstract_canon_sha256":"1fa0a6adf336a4461234c26766fda6f6d0e3d8bd4fdfc6a71fd456fb5187d3cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:29.762277Z","signature_b64":"X8aO/VQrKiqjL56oUxIUI0xFxhQSqpnPBxy6cqRmNdpkKaH1JAEz0FUSixHt7WDyNO01jM0J9+6IzDSqAVfjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33e9e1b77779f24b2cd26595205f4997604ee03651ea9e8f39c5be8b8d8d1133","last_reissued_at":"2026-05-18T00:51:29.761796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:29.761796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Approximation Algorithms for the Multiple Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Ananth Murthy, Chandan Yeshwanth, Shrisha Rao","submitted_at":"2017-02-02T09:55:43Z","abstract_excerpt":"We consider the distributed version of the Multiple Knapsack Problem (MKP), where $m$ items are to be distributed amongst $n$ processors, each with a knapsack. We propose different distributed approximation algorithms with a tradeoff between time and message complexities. The algorithms are based on the greedy approach of assigning the best item to the knapsack with the largest capacity. These algorithms obtain a solution with a bound of $\\frac{1}{n+1}$ times the optimum solution, with either $\\mathcal{O}\\left(m\\log n\\right)$ time and $\\mathcal{O}\\left(m n\\right)$ messages, or $\\mathcal{O}\\lef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00787","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":"1702.00787","created_at":"2026-05-18T00:51:29.761867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00787v1","created_at":"2026-05-18T00:51:29.761867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00787","created_at":"2026-05-18T00:51:29.761867+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPU6DN3XPHZE","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPU6DN3XPHZEWLGS","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPU6DN3X","created_at":"2026-05-18T12:31:18.294218+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/GPU6DN3XPHZEWLGSMWKSAX2JS5","json":"https://pith.science/pith/GPU6DN3XPHZEWLGSMWKSAX2JS5.json","graph_json":"https://pith.science/api/pith-number/GPU6DN3XPHZEWLGSMWKSAX2JS5/graph.json","events_json":"https://pith.science/api/pith-number/GPU6DN3XPHZEWLGSMWKSAX2JS5/events.json","paper":"https://pith.science/paper/GPU6DN3X"},"agent_actions":{"view_html":"https://pith.science/pith/GPU6DN3XPHZEWLGSMWKSAX2JS5","download_json":"https://pith.science/pith/GPU6DN3XPHZEWLGSMWKSAX2JS5.json","view_paper":"https://pith.science/paper/GPU6DN3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00787&json=true","fetch_graph":"https://pith.science/api/pith-number/GPU6DN3XPHZEWLGSMWKSAX2JS5/graph.json","fetch_events":"https://pith.science/api/pith-number/GPU6DN3XPHZEWLGSMWKSAX2JS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPU6DN3XPHZEWLGSMWKSAX2JS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPU6DN3XPHZEWLGSMWKSAX2JS5/action/storage_attestation","attest_author":"https://pith.science/pith/GPU6DN3XPHZEWLGSMWKSAX2JS5/action/author_attestation","sign_citation":"https://pith.science/pith/GPU6DN3XPHZEWLGSMWKSAX2JS5/action/citation_signature","submit_replication":"https://pith.science/pith/GPU6DN3XPHZEWLGSMWKSAX2JS5/action/replication_record"}},"created_at":"2026-05-18T00:51:29.761867+00:00","updated_at":"2026-05-18T00:51:29.761867+00:00"}