{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UGW5OBSADBGX53NMJU5BPJCMO4","short_pith_number":"pith:UGW5OBSA","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"},"canonical_sha256":"a1add70640184d7eedac4d3a17a44c773a410503510d4f75acdb2ffb2d335f70","source":{"kind":"arxiv","id":"1807.01962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01962","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01962v1","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01962","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"pith_short_12","alias_value":"UGW5OBSADBGX","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UGW5OBSADBGX53NM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UGW5OBSA","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UGW5OBSADBGX53NMJU5BPJCMO4","target":"record","payload":{"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"},"canonical_sha256":"a1add70640184d7eedac4d3a17a44c773a410503510d4f75acdb2ffb2d335f70","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"},"source_kind":"arxiv","source_id":"1807.01962","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-18T00:11:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNHdoc1inSXe+odt8sx0Cn9FbbvMlGjVnLBk6y9h1hGdB4m+E6Giy9qxNfqSZdPhwnGgJ7dMUFOwXi5wTKusAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:27:22.418943Z"},"content_sha256":"fa0c787b5605ccea6b52c8104a2eb8a6b18b8b168611711fcb08d41b50dfcef0","schema_version":"1.0","event_id":"sha256:fa0c787b5605ccea6b52c8104a2eb8a6b18b8b168611711fcb08d41b50dfcef0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UGW5OBSADBGX53NMJU5BPJCMO4","target":"graph","payload":{"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"},"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-18T00:11:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVVIEpUtJJoN4unMgn9QA3F9nwrL2Nkp2NTpwNbAN7DRQYZbmZOwy56pHiUVjM5pfT37JU1qlL3IcnfqCOvQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:27:22.419330Z"},"content_sha256":"994ee3004895d4e6d6d582276d2feb1c5aa375437e3470f93af4e112fe59ffa0","schema_version":"1.0","event_id":"sha256:994ee3004895d4e6d6d582276d2feb1c5aa375437e3470f93af4e112fe59ffa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4/bundle.json","state_url":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGW5OBSADBGX53NMJU5BPJCMO4/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-28T17:27:22Z","links":{"resolver":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4","bundle":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4/bundle.json","state":"https://pith.science/pith/UGW5OBSADBGX53NMJU5BPJCMO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGW5OBSADBGX53NMJU5BPJCMO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UGW5OBSADBGX53NMJU5BPJCMO4","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":"990e258960c34022d46d821a73e0f8756af1c52399645819e9ac93b05fa08de9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-05T12:34:10Z","title_canon_sha256":"1ad3d94841b412a669f7e14dbb04ddbca9b2ecfbbe2a3811763c4244b99187ea"},"schema_version":"1.0","source":{"id":"1807.01962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01962","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01962v1","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01962","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"pith_short_12","alias_value":"UGW5OBSADBGX","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UGW5OBSADBGX53NM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UGW5OBSA","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:994ee3004895d4e6d6d582276d2feb1c5aa375437e3470f93af4e112fe59ffa0","target":"graph","created_at":"2026-05-18T00:11:24Z","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":"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","authors_text":"Annette M. C. Ficker, Frits C. R. Spieksma, Matus Mihalak, Thomas Erlebach","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-05T12:34:10Z","title":"Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01962","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:fa0c787b5605ccea6b52c8104a2eb8a6b18b8b168611711fcb08d41b50dfcef0","target":"record","created_at":"2026-05-18T00:11:24Z","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":"990e258960c34022d46d821a73e0f8756af1c52399645819e9ac93b05fa08de9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-05T12:34:10Z","title_canon_sha256":"1ad3d94841b412a669f7e14dbb04ddbca9b2ecfbbe2a3811763c4244b99187ea"},"schema_version":"1.0","source":{"id":"1807.01962","kind":"arxiv","version":1}},"canonical_sha256":"a1add70640184d7eedac4d3a17a44c773a410503510d4f75acdb2ffb2d335f70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1add70640184d7eedac4d3a17a44c773a410503510d4f75acdb2ffb2d335f70","first_computed_at":"2026-05-18T00:11:24.595647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:24.595647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xk9Qa8Km8XAhhKzP2okWuq1B8UoCrHzZlo8il98UsqaW5DuKsx3Pm6sUnTSa08Tk4B/N0fgiF+UWG2pn5EmwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:24.596326Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa0c787b5605ccea6b52c8104a2eb8a6b18b8b168611711fcb08d41b50dfcef0","sha256:994ee3004895d4e6d6d582276d2feb1c5aa375437e3470f93af4e112fe59ffa0"],"state_sha256":"e35df62acd08321ad8fac12007a6b52cdb72c3bdb63bd996b008c66d9f1e309e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEmuscXOFa+oEjU6o5uZaSgj4bIccYuezKR3SreIkDYqzhFDuyFWPARJHLFNX8j4YGrccOkCXCacRSpNsvi2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:27:22.421925Z","bundle_sha256":"fd48a06cf711015fd12493d8ab8bbd1d7b6c04618a8d106e4e919ff4ba42cbca"}}