{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5PRDOUESWEMN5RAYSPTPZ55UI6","short_pith_number":"pith:5PRDOUES","canonical_record":{"source":{"id":"1808.09024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-27T20:15:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"099124334cc5fa27de5ad6b5108fc9344cc1bc3730d3060446f2de83f96c43dd","abstract_canon_sha256":"5f0bc587722d94fcd7d3a024b67da5b57920dafe2ce07f948c0c281e87cc8c8f"},"schema_version":"1.0"},"canonical_sha256":"ebe2375092b118dec41893e6fcf7b447b12dc4aebe28c1f1f1ceda73e2dee5fe","source":{"kind":"arxiv","id":"1808.09024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09024","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09024v1","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09024","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"5PRDOUESWEMN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5PRDOUESWEMN5RAY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5PRDOUES","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5PRDOUESWEMN5RAYSPTPZ55UI6","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-27T20:15:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"099124334cc5fa27de5ad6b5108fc9344cc1bc3730d3060446f2de83f96c43dd","abstract_canon_sha256":"5f0bc587722d94fcd7d3a024b67da5b57920dafe2ce07f948c0c281e87cc8c8f"},"schema_version":"1.0"},"canonical_sha256":"ebe2375092b118dec41893e6fcf7b447b12dc4aebe28c1f1f1ceda73e2dee5fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:04.835958Z","signature_b64":"KRqG+SwPCCQBo3/8r4qCgVNphI5GeH00kMyoW3uQ9ARaN6fpUWqto9Hmo+HJahfmcU2NgbEn4H7R3R+oY55aBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebe2375092b118dec41893e6fcf7b447b12dc4aebe28c1f1f1ceda73e2dee5fe","last_reissued_at":"2026-05-18T00:07:04.835235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:04.835235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09024","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:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THfw53+StDRMeNL9oXQSkNwU3NWKapKH2lkBp8m5df1CMSEEcxcU0DwPLQHZSC330q7z1t4lV/c8oeL2Gf66BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:10:56.642348Z"},"content_sha256":"f90258cbb199694c2bf5a790e8f124be77d5ce2463b871a741f2ed4a7530dda4","schema_version":"1.0","event_id":"sha256:f90258cbb199694c2bf5a790e8f124be77d5ce2463b871a741f2ed4a7530dda4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5PRDOUESWEMN5RAYSPTPZ55UI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Carlos Hidalgo-Toscano, Clemens Huemer, Dieter Mitsche, Dolores Lara, Ruy Fabila-Monroy","submitted_at":"2018-08-27T20:15:23Z","abstract_excerpt":"How to draw the vertices of a complete multipartite graph $G$ on different points of a bounded $d$-dimensional integer grid, such that the sum of squared distances between vertices of $G$ is (i) minimized or (ii) maximized? For both problems we provide a characterization of the solutions. For the particular case $d=1$, our solution for (i) also settles the minimum-2-sum problem for complete bipartite graphs; the minimum-2-sum problem was defined by Juvan and Mohar in 1992. Weighted centroidal Voronoi tessellations are the solution for (ii). Such drawings are related with Laplacian eigenvalues "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09024","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:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x4UuIws+HrXxqS4fwZFvhbiDX+OPkU2E1u/uZjFaeve5I/Tmjp+MmQneQgolZI+Hix+rmqpY6gEqxuHf3//zCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:10:56.642977Z"},"content_sha256":"367a03853f670fabe4859c3472384c34d680d61bf5836e6755fac2bf8f8414ec","schema_version":"1.0","event_id":"sha256:367a03853f670fabe4859c3472384c34d680d61bf5836e6755fac2bf8f8414ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PRDOUESWEMN5RAYSPTPZ55UI6/bundle.json","state_url":"https://pith.science/pith/5PRDOUESWEMN5RAYSPTPZ55UI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PRDOUESWEMN5RAYSPTPZ55UI6/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-06-03T03:10:56Z","links":{"resolver":"https://pith.science/pith/5PRDOUESWEMN5RAYSPTPZ55UI6","bundle":"https://pith.science/pith/5PRDOUESWEMN5RAYSPTPZ55UI6/bundle.json","state":"https://pith.science/pith/5PRDOUESWEMN5RAYSPTPZ55UI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PRDOUESWEMN5RAYSPTPZ55UI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5PRDOUESWEMN5RAYSPTPZ55UI6","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":"5f0bc587722d94fcd7d3a024b67da5b57920dafe2ce07f948c0c281e87cc8c8f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-27T20:15:23Z","title_canon_sha256":"099124334cc5fa27de5ad6b5108fc9344cc1bc3730d3060446f2de83f96c43dd"},"schema_version":"1.0","source":{"id":"1808.09024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09024","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09024v1","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09024","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"5PRDOUESWEMN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5PRDOUESWEMN5RAY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5PRDOUES","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:367a03853f670fabe4859c3472384c34d680d61bf5836e6755fac2bf8f8414ec","target":"graph","created_at":"2026-05-18T00:07:04Z","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":"How to draw the vertices of a complete multipartite graph $G$ on different points of a bounded $d$-dimensional integer grid, such that the sum of squared distances between vertices of $G$ is (i) minimized or (ii) maximized? For both problems we provide a characterization of the solutions. For the particular case $d=1$, our solution for (i) also settles the minimum-2-sum problem for complete bipartite graphs; the minimum-2-sum problem was defined by Juvan and Mohar in 1992. Weighted centroidal Voronoi tessellations are the solution for (ii). Such drawings are related with Laplacian eigenvalues ","authors_text":"Carlos Hidalgo-Toscano, Clemens Huemer, Dieter Mitsche, Dolores Lara, Ruy Fabila-Monroy","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-27T20:15:23Z","title":"Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09024","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:f90258cbb199694c2bf5a790e8f124be77d5ce2463b871a741f2ed4a7530dda4","target":"record","created_at":"2026-05-18T00:07:04Z","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":"5f0bc587722d94fcd7d3a024b67da5b57920dafe2ce07f948c0c281e87cc8c8f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-27T20:15:23Z","title_canon_sha256":"099124334cc5fa27de5ad6b5108fc9344cc1bc3730d3060446f2de83f96c43dd"},"schema_version":"1.0","source":{"id":"1808.09024","kind":"arxiv","version":1}},"canonical_sha256":"ebe2375092b118dec41893e6fcf7b447b12dc4aebe28c1f1f1ceda73e2dee5fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebe2375092b118dec41893e6fcf7b447b12dc4aebe28c1f1f1ceda73e2dee5fe","first_computed_at":"2026-05-18T00:07:04.835235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:04.835235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KRqG+SwPCCQBo3/8r4qCgVNphI5GeH00kMyoW3uQ9ARaN6fpUWqto9Hmo+HJahfmcU2NgbEn4H7R3R+oY55aBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:04.835958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f90258cbb199694c2bf5a790e8f124be77d5ce2463b871a741f2ed4a7530dda4","sha256:367a03853f670fabe4859c3472384c34d680d61bf5836e6755fac2bf8f8414ec"],"state_sha256":"f16e8f415219a69444d56868abcb75e5af7f6d48877c5348bfcf7c9c9402a4a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbvRRXNUuFbcHcFL6UtC5+dVdj2JyWdAqxYzI0zW64uyz3hEvAqQRnH3qEM9Bh/JiFGTv58aYqKnlyacV5/UBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:10:56.645974Z","bundle_sha256":"9ce2792095d7c003e980c622449b9986ab263cb5ac10b726fd0f81c25661e959"}}