{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:F7I3MFWRK2RTTY4DEAZCXCTVBC","short_pith_number":"pith:F7I3MFWR","canonical_record":{"source":{"id":"1908.09135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T13:27:38Z","cross_cats_sorted":[],"title_canon_sha256":"39fc3ad1361e164f6f21569f91072f3f548ad6baa4d946a10efb08bfeae159dd","abstract_canon_sha256":"1500e1713e0673d21e1f314ad0a6d2278afb0fe526bd0e9c0c0789ec0e2f40e1"},"schema_version":"1.0"},"canonical_sha256":"2fd1b616d156a339e38320322b8a7508802e9a26bd9c583eabc1ae4f81472418","source":{"kind":"arxiv","id":"1908.09135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09135","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09135v1","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09135","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_12","alias_value":"F7I3MFWRK2RT","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_16","alias_value":"F7I3MFWRK2RTTY4D","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_8","alias_value":"F7I3MFWR","created_at":"2026-07-04T23:59:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:F7I3MFWRK2RTTY4DEAZCXCTVBC","target":"record","payload":{"canonical_record":{"source":{"id":"1908.09135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T13:27:38Z","cross_cats_sorted":[],"title_canon_sha256":"39fc3ad1361e164f6f21569f91072f3f548ad6baa4d946a10efb08bfeae159dd","abstract_canon_sha256":"1500e1713e0673d21e1f314ad0a6d2278afb0fe526bd0e9c0c0789ec0e2f40e1"},"schema_version":"1.0"},"canonical_sha256":"2fd1b616d156a339e38320322b8a7508802e9a26bd9c583eabc1ae4f81472418","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:37.007747Z","signature_b64":"wJGyEtbEVfpaWGe6DZq+NYwiF9DRJSHpeUE5K1lfBnLo6lm5v0iNzrnBT+J0hJlOTD9N6ForLAKybqKdKliUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fd1b616d156a339e38320322b8a7508802e9a26bd9c583eabc1ae4f81472418","last_reissued_at":"2026-07-04T23:59:37.007350Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:37.007350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.09135","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-07-04T23:59:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"so0tVJPtdPPiH5v9NLDxwVVDsBKlCESyFBBz2TrrAbdaXJHBiDFAhtT/Etzlw72C8zJGY22SqF9W+uNkF5D/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:48:25.471853Z"},"content_sha256":"343f15fb60866388e9fbdb7ec63d624f317541efd877076c0dba4f9084b7a639","schema_version":"1.0","event_id":"sha256:343f15fb60866388e9fbdb7ec63d624f317541efd877076c0dba4f9084b7a639"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:F7I3MFWRK2RTTY4DEAZCXCTVBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subadditive Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akihiro Kishimoto, Kiyohito Nagano","submitted_at":"2019-08-24T13:27:38Z","abstract_excerpt":"Set function optimization is essential in AI and machine learning. We focus on a subadditive set function that generalizes submodularity, and examine the subadditivity of non-submodular functions. We also deal with a minimax subadditive load balancing problem, and present a modularization-minimization algorithm that theoretically guarantees a worst-case approximation factor. In addition, we give a lower bound computation technique for the problem. We apply these methods to the multi-robot routing problem for an empirical performance evaluation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09135","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.09135/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:59:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UwepZjF/nD7L1xhWbwusgrBftn7/sumF0/gf1sQjTMfqQ0V2QN8y+kuiYXcZCrCkjScb5OBTpBLSRTgGAyY6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:48:25.472380Z"},"content_sha256":"8f230f6cd6024c8f5049a9ad099a2e5aa7f98a1783b4341ed086874c36d12a33","schema_version":"1.0","event_id":"sha256:8f230f6cd6024c8f5049a9ad099a2e5aa7f98a1783b4341ed086874c36d12a33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7I3MFWRK2RTTY4DEAZCXCTVBC/bundle.json","state_url":"https://pith.science/pith/F7I3MFWRK2RTTY4DEAZCXCTVBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7I3MFWRK2RTTY4DEAZCXCTVBC/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-08-16T23:48:25Z","links":{"resolver":"https://pith.science/pith/F7I3MFWRK2RTTY4DEAZCXCTVBC","bundle":"https://pith.science/pith/F7I3MFWRK2RTTY4DEAZCXCTVBC/bundle.json","state":"https://pith.science/pith/F7I3MFWRK2RTTY4DEAZCXCTVBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7I3MFWRK2RTTY4DEAZCXCTVBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:F7I3MFWRK2RTTY4DEAZCXCTVBC","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":"1500e1713e0673d21e1f314ad0a6d2278afb0fe526bd0e9c0c0789ec0e2f40e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T13:27:38Z","title_canon_sha256":"39fc3ad1361e164f6f21569f91072f3f548ad6baa4d946a10efb08bfeae159dd"},"schema_version":"1.0","source":{"id":"1908.09135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09135","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09135v1","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09135","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_12","alias_value":"F7I3MFWRK2RT","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_16","alias_value":"F7I3MFWRK2RTTY4D","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_8","alias_value":"F7I3MFWR","created_at":"2026-07-04T23:59:37Z"}],"graph_snapshots":[{"event_id":"sha256:8f230f6cd6024c8f5049a9ad099a2e5aa7f98a1783b4341ed086874c36d12a33","target":"graph","created_at":"2026-07-04T23:59:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.09135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Set function optimization is essential in AI and machine learning. We focus on a subadditive set function that generalizes submodularity, and examine the subadditivity of non-submodular functions. We also deal with a minimax subadditive load balancing problem, and present a modularization-minimization algorithm that theoretically guarantees a worst-case approximation factor. In addition, we give a lower bound computation technique for the problem. We apply these methods to the multi-robot routing problem for an empirical performance evaluation.","authors_text":"Akihiro Kishimoto, Kiyohito Nagano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T13:27:38Z","title":"Subadditive Load Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09135","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:343f15fb60866388e9fbdb7ec63d624f317541efd877076c0dba4f9084b7a639","target":"record","created_at":"2026-07-04T23:59:37Z","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":"1500e1713e0673d21e1f314ad0a6d2278afb0fe526bd0e9c0c0789ec0e2f40e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T13:27:38Z","title_canon_sha256":"39fc3ad1361e164f6f21569f91072f3f548ad6baa4d946a10efb08bfeae159dd"},"schema_version":"1.0","source":{"id":"1908.09135","kind":"arxiv","version":1}},"canonical_sha256":"2fd1b616d156a339e38320322b8a7508802e9a26bd9c583eabc1ae4f81472418","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fd1b616d156a339e38320322b8a7508802e9a26bd9c583eabc1ae4f81472418","first_computed_at":"2026-07-04T23:59:37.007350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:37.007350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wJGyEtbEVfpaWGe6DZq+NYwiF9DRJSHpeUE5K1lfBnLo6lm5v0iNzrnBT+J0hJlOTD9N6ForLAKybqKdKliUCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:37.007747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.09135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:343f15fb60866388e9fbdb7ec63d624f317541efd877076c0dba4f9084b7a639","sha256:8f230f6cd6024c8f5049a9ad099a2e5aa7f98a1783b4341ed086874c36d12a33"],"state_sha256":"b9450b3b079c153674321fda957feabb2909ba619107cfc93e18771a6c866b31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0xUSuMz+B4ekYZyHnK4D3QeyaCRf9mtVM5OH6VkocPJ6BML30KRuc8kjMNfOTIrmp4MTedM7DjFwbRt9bMR/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T23:48:25.478148Z","bundle_sha256":"c91b7b41aaee77d306f0d276bd5795f57b75c1342eae7a597d9f0265db3b5c0e"}}