{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UGW5OBSADBGX53NMJU5BPJCMO4","short_pith_number":"pith:UGW5OBSA","schema_version":"1.0","canonical_sha256":"a1add70640184d7eedac4d3a17a44c773a410503510d4f75acdb2ffb2d335f70","source":{"kind":"arxiv","id":"1807.01962","version":1},"attestation_state":"computed","paper":{"title":"Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Annette M. C. Ficker, Frits C. R. Spieksma, Matus Mihalak, Thomas Erlebach","submitted_at":"2018-07-05T12:34:10Z","abstract_excerpt":"Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum of the component-wise maxima of the four vectors in the quad. The problem is to partition the given 4k vectors into k quads with minimum total cost. We analyze a straightforward matching-based algorithm, and prove that this algorithm is a (3/2)-approximation algorithm for this problem. We further analyze the performance of this algorithm on a hierarchy of special cases of the problem, and prove that, in one particul"},"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":"1807.01962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-05T12:34:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1ad3d94841b412a669f7e14dbb04ddbca9b2ecfbbe2a3811763c4244b99187ea","abstract_canon_sha256":"990e258960c34022d46d821a73e0f8756af1c52399645819e9ac93b05fa08de9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:24.596326Z","signature_b64":"xk9Qa8Km8XAhhKzP2okWuq1B8UoCrHzZlo8il98UsqaW5DuKsx3Pm6sUnTSa08Tk4B/N0fgiF+UWG2pn5EmwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1add70640184d7eedac4d3a17a44c773a410503510d4f75acdb2ffb2d335f70","last_reissued_at":"2026-05-18T00:11:24.595647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:24.595647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Annette M. C. Ficker, Frits C. R. Spieksma, Matus Mihalak, Thomas Erlebach","submitted_at":"2018-07-05T12:34:10Z","abstract_excerpt":"Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum of the component-wise maxima of the four vectors in the quad. The problem is to partition the given 4k vectors into k quads with minimum total cost. We analyze a straightforward matching-based algorithm, and prove that this algorithm is a (3/2)-approximation algorithm for this problem. We further analyze the performance of this algorithm on a hierarchy of special cases of the problem, and prove that, in one particul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01962","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":"1807.01962","created_at":"2026-05-18T00:11:24.595755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01962v1","created_at":"2026-05-18T00:11:24.595755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01962","created_at":"2026-05-18T00:11:24.595755+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGW5OBSADBGX","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGW5OBSADBGX53NM","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGW5OBSA","created_at":"2026-05-18T12:32:56.356000+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/UGW5OBSADBGX53NMJU5BPJCMO4","json":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4.json","graph_json":"https://pith.science/api/pith-number/UGW5OBSADBGX53NMJU5BPJCMO4/graph.json","events_json":"https://pith.science/api/pith-number/UGW5OBSADBGX53NMJU5BPJCMO4/events.json","paper":"https://pith.science/paper/UGW5OBSA"},"agent_actions":{"view_html":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4","download_json":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4.json","view_paper":"https://pith.science/paper/UGW5OBSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01962&json=true","fetch_graph":"https://pith.science/api/pith-number/UGW5OBSADBGX53NMJU5BPJCMO4/graph.json","fetch_events":"https://pith.science/api/pith-number/UGW5OBSADBGX53NMJU5BPJCMO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4/action/storage_attestation","attest_author":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4/action/author_attestation","sign_citation":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4/action/citation_signature","submit_replication":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4/action/replication_record"}},"created_at":"2026-05-18T00:11:24.595755+00:00","updated_at":"2026-05-18T00:11:24.595755+00:00"}