{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:X6QAR45O6J7BHVGI7LHDWM6SUK","short_pith_number":"pith:X6QAR45O","canonical_record":{"source":{"id":"2301.02876","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-07T15:34:49Z","cross_cats_sorted":[],"title_canon_sha256":"5e258dfdf574d25554e568c5c03b61d3a28d40af1eaf2534ce9c213fb1537797","abstract_canon_sha256":"9ffcbd91e2d9d1c87896b0926d8b8ea541604c4d1b988c1aa174be3350035341"},"schema_version":"1.0"},"canonical_sha256":"bfa008f3aef27e13d4c8face3b33d2a2a2df278874f91d15972e5ac3f962da6c","source":{"kind":"arxiv","id":"2301.02876","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.02876","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"2301.02876v5","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.02876","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"X6QAR45O6J7B","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"pith_short_16","alias_value":"X6QAR45O6J7BHVGI","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"pith_short_8","alias_value":"X6QAR45O","created_at":"2026-07-05T08:02:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:X6QAR45O6J7BHVGI7LHDWM6SUK","target":"record","payload":{"canonical_record":{"source":{"id":"2301.02876","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-07T15:34:49Z","cross_cats_sorted":[],"title_canon_sha256":"5e258dfdf574d25554e568c5c03b61d3a28d40af1eaf2534ce9c213fb1537797","abstract_canon_sha256":"9ffcbd91e2d9d1c87896b0926d8b8ea541604c4d1b988c1aa174be3350035341"},"schema_version":"1.0"},"canonical_sha256":"bfa008f3aef27e13d4c8face3b33d2a2a2df278874f91d15972e5ac3f962da6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:19.566517Z","signature_b64":"YPDDZO1B0eH6/qcGP8wfnJTN2j/3ZyKNQ3VqC+fLGymZTsRsNSW0sVSJ9bMconM1gL75YFoqQtKeFiy/9s5oCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfa008f3aef27e13d4c8face3b33d2a2a2df278874f91d15972e5ac3f962da6c","last_reissued_at":"2026-07-05T08:02:19.566016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:19.566016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.02876","source_version":5,"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-05T08:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19jdWHtBDmZo3P97GIgwDb3pOqIFERH5roZdulEqCy8J5k9oX6cCFdRiEUPoFOLJdaPuSXamLIr6e0i5O0jiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:35:08.625484Z"},"content_sha256":"9816529eb11bef1bfc810544610bd9baf701a06b0f5a02925dd1fbc501a76705","schema_version":"1.0","event_id":"sha256:9816529eb11bef1bfc810544610bd9baf701a06b0f5a02925dd1fbc501a76705"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:X6QAR45O6J7BHVGI7LHDWM6SUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Assigning Agents to Increase Network-Based Neighborhood Diversity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Yuan, Anil Vullikanti, Chen Chen, Daniel J. Rosenkrantz, Madhav V. Marathe, Richard E. Stearns, S. S. Ravi, Zirou Qiu","submitted_at":"2023-01-07T15:34:49Z","abstract_excerpt":"Motivated by real-world applications such as the allocation of public housing, we examine the problem of assigning a group of agents to vertices (e.g., spatial locations) of a network so that the diversity level is maximized. Specifically, agents are of two types (characterized by features), and we measure diversity by the number of agents who have at least one neighbor of a different type. This problem is known to be NP-hard, and we focus on developing approximation algorithms with provable performance guarantees. We first present a local-improvement algorithm for general graphs that provides"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.02876","kind":"arxiv","version":5},"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/2301.02876/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-05T08:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qc8L11Ga5MrdNiSquPqjqXsitlny28iIWvdUSkekzfRRxsU0V2l+ZdAbiwyjiEiFAQHYLrmsD9AoGPwOU3HVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:35:08.626375Z"},"content_sha256":"d6fb1c13d94c3b1b89c60b5555a99c8bf3e31d30f4f7a67563aa69cce968a3c2","schema_version":"1.0","event_id":"sha256:d6fb1c13d94c3b1b89c60b5555a99c8bf3e31d30f4f7a67563aa69cce968a3c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/bundle.json","state_url":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/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-06T18:35:08Z","links":{"resolver":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK","bundle":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/bundle.json","state":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:X6QAR45O6J7BHVGI7LHDWM6SUK","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":"9ffcbd91e2d9d1c87896b0926d8b8ea541604c4d1b988c1aa174be3350035341","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-07T15:34:49Z","title_canon_sha256":"5e258dfdf574d25554e568c5c03b61d3a28d40af1eaf2534ce9c213fb1537797"},"schema_version":"1.0","source":{"id":"2301.02876","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.02876","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"2301.02876v5","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.02876","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"X6QAR45O6J7B","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"pith_short_16","alias_value":"X6QAR45O6J7BHVGI","created_at":"2026-07-05T08:02:19Z"},{"alias_kind":"pith_short_8","alias_value":"X6QAR45O","created_at":"2026-07-05T08:02:19Z"}],"graph_snapshots":[{"event_id":"sha256:d6fb1c13d94c3b1b89c60b5555a99c8bf3e31d30f4f7a67563aa69cce968a3c2","target":"graph","created_at":"2026-07-05T08:02:19Z","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/2301.02876/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by real-world applications such as the allocation of public housing, we examine the problem of assigning a group of agents to vertices (e.g., spatial locations) of a network so that the diversity level is maximized. Specifically, agents are of two types (characterized by features), and we measure diversity by the number of agents who have at least one neighbor of a different type. This problem is known to be NP-hard, and we focus on developing approximation algorithms with provable performance guarantees. We first present a local-improvement algorithm for general graphs that provides","authors_text":"Andrew Yuan, Anil Vullikanti, Chen Chen, Daniel J. Rosenkrantz, Madhav V. Marathe, Richard E. Stearns, S. S. Ravi, Zirou Qiu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-07T15:34:49Z","title":"Assigning Agents to Increase Network-Based Neighborhood Diversity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.02876","kind":"arxiv","version":5},"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:9816529eb11bef1bfc810544610bd9baf701a06b0f5a02925dd1fbc501a76705","target":"record","created_at":"2026-07-05T08:02:19Z","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":"9ffcbd91e2d9d1c87896b0926d8b8ea541604c4d1b988c1aa174be3350035341","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-07T15:34:49Z","title_canon_sha256":"5e258dfdf574d25554e568c5c03b61d3a28d40af1eaf2534ce9c213fb1537797"},"schema_version":"1.0","source":{"id":"2301.02876","kind":"arxiv","version":5}},"canonical_sha256":"bfa008f3aef27e13d4c8face3b33d2a2a2df278874f91d15972e5ac3f962da6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfa008f3aef27e13d4c8face3b33d2a2a2df278874f91d15972e5ac3f962da6c","first_computed_at":"2026-07-05T08:02:19.566016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:02:19.566016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YPDDZO1B0eH6/qcGP8wfnJTN2j/3ZyKNQ3VqC+fLGymZTsRsNSW0sVSJ9bMconM1gL75YFoqQtKeFiy/9s5oCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:02:19.566517Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.02876","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9816529eb11bef1bfc810544610bd9baf701a06b0f5a02925dd1fbc501a76705","sha256:d6fb1c13d94c3b1b89c60b5555a99c8bf3e31d30f4f7a67563aa69cce968a3c2"],"state_sha256":"3256fe2ed76c18541c8e22c2a1fec6d66948935ccd001af9c2a29e16917817ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7hO+EEeTNviGuSj3Y8UHDQOUVKtOO8uYDKF6o5zAuelUodAp13307g3G0f5xrZl7Q/6eg1QorXAxjUGq9luBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:35:08.632422Z","bundle_sha256":"a6bbe574aebce6db03b15f7389769e341a8e4de669808807f76f1791e5f09200"}}