{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:X6QAR45O6J7BHVGI7LHDWM6SUK","short_pith_number":"pith:X6QAR45O","schema_version":"1.0","canonical_sha256":"bfa008f3aef27e13d4c8face3b33d2a2a2df278874f91d15972e5ac3f962da6c","source":{"kind":"arxiv","id":"2301.02876","version":5},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2301.02876","created_at":"2026-07-05T08:02:19.566072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.02876v5","created_at":"2026-07-05T08:02:19.566072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.02876","created_at":"2026-07-05T08:02:19.566072+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6QAR45O6J7B","created_at":"2026-07-05T08:02:19.566072+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6QAR45O6J7BHVGI","created_at":"2026-07-05T08:02:19.566072+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6QAR45O","created_at":"2026-07-05T08:02:19.566072+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK","json":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK.json","graph_json":"https://pith.science/api/pith-number/X6QAR45O6J7BHVGI7LHDWM6SUK/graph.json","events_json":"https://pith.science/api/pith-number/X6QAR45O6J7BHVGI7LHDWM6SUK/events.json","paper":"https://pith.science/paper/X6QAR45O"},"agent_actions":{"view_html":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK","download_json":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK.json","view_paper":"https://pith.science/paper/X6QAR45O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.02876&json=true","fetch_graph":"https://pith.science/api/pith-number/X6QAR45O6J7BHVGI7LHDWM6SUK/graph.json","fetch_events":"https://pith.science/api/pith-number/X6QAR45O6J7BHVGI7LHDWM6SUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/action/storage_attestation","attest_author":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/action/author_attestation","sign_citation":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/action/citation_signature","submit_replication":"https://pith.science/pith/X6QAR45O6J7BHVGI7LHDWM6SUK/action/replication_record"}},"created_at":"2026-07-05T08:02:19.566072+00:00","updated_at":"2026-07-05T08:02:19.566072+00:00"}