{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XESG5VKGOHDD4POHD57CUTUOUK","short_pith_number":"pith:XESG5VKG","canonical_record":{"source":{"id":"1809.03392","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-10T15:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"a32de9d31090a65d52eb249bcf33bfcfb1d61eb33edda3b8c6ca09508b6615a1","abstract_canon_sha256":"ff7aad77a65e8c1d2189acfa11625f662ea41dce25efd49af3b67ea285586239"},"schema_version":"1.0"},"canonical_sha256":"b9246ed54671c63e3dc71f7e2a4e8ea28ab7752f29d91ba319f5e55a93dd8d19","source":{"kind":"arxiv","id":"1809.03392","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03392","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03392v4","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03392","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"XESG5VKGOHDD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XESG5VKGOHDD4POH","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XESG5VKG","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XESG5VKGOHDD4POHD57CUTUOUK","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03392","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-10T15:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"a32de9d31090a65d52eb249bcf33bfcfb1d61eb33edda3b8c6ca09508b6615a1","abstract_canon_sha256":"ff7aad77a65e8c1d2189acfa11625f662ea41dce25efd49af3b67ea285586239"},"schema_version":"1.0"},"canonical_sha256":"b9246ed54671c63e3dc71f7e2a4e8ea28ab7752f29d91ba319f5e55a93dd8d19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:06.844938Z","signature_b64":"FHe5YsE5A79PylwBhR3dXm03bhKdVX/RGKF7yEDNqtfXgkXeBQXUNC/Ihx9DB8jhHCZ17988qJB38SwsJWCzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9246ed54671c63e3dc71f7e2a4e8ea28ab7752f29d91ba319f5e55a93dd8d19","last_reissued_at":"2026-05-18T00:01:06.844402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:06.844402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03392","source_version":4,"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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ty+r5sSEFL814JEj/Yll9RNl2jvobybDbr2U4/dK/BzK39WRZKuZr4iW70LTcDl0sQZKEfOr7dS8CWD4v3GkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:02:34.695237Z"},"content_sha256":"d67a844ea55f7fb50de436661888e2404404ab942b4bbc38f60f7f75d76cd76b","schema_version":"1.0","event_id":"sha256:d67a844ea55f7fb50de436661888e2404404ab942b4bbc38f60f7f75d76cd76b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XESG5VKGOHDD4POHD57CUTUOUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Partition of a Tree with Social Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hirotaka Ono, Masahiro Okubo, Tesshu Hanaka","submitted_at":"2018-09-10T15:24:00Z","abstract_excerpt":"We study the problem to find a partition of \\textcolor{black}{a} graph $G$ with maximum social welfare based on social distance between vertices in $G$, called MaxSWP. This problem is known to be NP-hard in general. In this paper, we first give a complete characterization of optimal partitions of trees with small diameters. Then, by utilizing these results, we show that MaxSWP can be solved in linear time for trees. Moreover, we show that MaxSWP is NP-hard even for 4-regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03392","kind":"arxiv","version":4},"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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaLxHta5R3JQsW+svp9iXd+dIMxREOwkbsaCOIAjxl8Zt1pxiks1w4w1N7NscL5DaQjv9ZlO0BIJxFGUEqr1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:02:34.695605Z"},"content_sha256":"89411b19999545b79746b759a81fa5ef308fe96ec2ccd44369a725396541e2c9","schema_version":"1.0","event_id":"sha256:89411b19999545b79746b759a81fa5ef308fe96ec2ccd44369a725396541e2c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XESG5VKGOHDD4POHD57CUTUOUK/bundle.json","state_url":"https://pith.science/pith/XESG5VKGOHDD4POHD57CUTUOUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XESG5VKGOHDD4POHD57CUTUOUK/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-21T18:02:34Z","links":{"resolver":"https://pith.science/pith/XESG5VKGOHDD4POHD57CUTUOUK","bundle":"https://pith.science/pith/XESG5VKGOHDD4POHD57CUTUOUK/bundle.json","state":"https://pith.science/pith/XESG5VKGOHDD4POHD57CUTUOUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XESG5VKGOHDD4POHD57CUTUOUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XESG5VKGOHDD4POHD57CUTUOUK","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":"ff7aad77a65e8c1d2189acfa11625f662ea41dce25efd49af3b67ea285586239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-10T15:24:00Z","title_canon_sha256":"a32de9d31090a65d52eb249bcf33bfcfb1d61eb33edda3b8c6ca09508b6615a1"},"schema_version":"1.0","source":{"id":"1809.03392","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03392","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03392v4","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03392","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"XESG5VKGOHDD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XESG5VKGOHDD4POH","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XESG5VKG","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:89411b19999545b79746b759a81fa5ef308fe96ec2ccd44369a725396541e2c9","target":"graph","created_at":"2026-05-18T00:01:06Z","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":"We study the problem to find a partition of \\textcolor{black}{a} graph $G$ with maximum social welfare based on social distance between vertices in $G$, called MaxSWP. This problem is known to be NP-hard in general. In this paper, we first give a complete characterization of optimal partitions of trees with small diameters. Then, by utilizing these results, we show that MaxSWP can be solved in linear time for trees. Moreover, we show that MaxSWP is NP-hard even for 4-regular graphs.","authors_text":"Hirotaka Ono, Masahiro Okubo, Tesshu Hanaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-10T15:24:00Z","title":"Optimal Partition of a Tree with Social Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03392","kind":"arxiv","version":4},"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:d67a844ea55f7fb50de436661888e2404404ab942b4bbc38f60f7f75d76cd76b","target":"record","created_at":"2026-05-18T00:01:06Z","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":"ff7aad77a65e8c1d2189acfa11625f662ea41dce25efd49af3b67ea285586239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-10T15:24:00Z","title_canon_sha256":"a32de9d31090a65d52eb249bcf33bfcfb1d61eb33edda3b8c6ca09508b6615a1"},"schema_version":"1.0","source":{"id":"1809.03392","kind":"arxiv","version":4}},"canonical_sha256":"b9246ed54671c63e3dc71f7e2a4e8ea28ab7752f29d91ba319f5e55a93dd8d19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9246ed54671c63e3dc71f7e2a4e8ea28ab7752f29d91ba319f5e55a93dd8d19","first_computed_at":"2026-05-18T00:01:06.844402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:06.844402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FHe5YsE5A79PylwBhR3dXm03bhKdVX/RGKF7yEDNqtfXgkXeBQXUNC/Ihx9DB8jhHCZ17988qJB38SwsJWCzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:06.844938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03392","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d67a844ea55f7fb50de436661888e2404404ab942b4bbc38f60f7f75d76cd76b","sha256:89411b19999545b79746b759a81fa5ef308fe96ec2ccd44369a725396541e2c9"],"state_sha256":"98f5332a9da72c5bada7e46c30e8926bcfd875642d6411609b333b6cd23ee960"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGW7iUUjiChbiWltNqSzwZQeuPRgUUfUMAloydbP9NUj5EXroiGlg9u2LA9ndgPKkY+E04GV5jukd4DyqUWqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:02:34.697967Z","bundle_sha256":"60a6f1f02c9ae949ec22837908a44aa401e7c524915c4d6ac70dbea24e63a562"}}