{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IAYCIJRJOJPBYF6X2D2ULII65M","short_pith_number":"pith:IAYCIJRJ","schema_version":"1.0","canonical_sha256":"4030242629725e1c17d7d0f545a11eeb3848c06248defbd005fe2d5257e49770","source":{"kind":"arxiv","id":"1809.09792","version":1},"attestation_state":"computed","paper":{"title":"Gathering by Repulsion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Prosenjit Bose, Thomas Shermer","submitted_at":"2018-09-26T03:34:24Z","abstract_excerpt":"We consider a repulsion actuator located in an $n$-sided convex environment full of point particles. When the actuator is activated, all the particles move away from the actuator. We study the problem of gathering all the particles to a point. We give an $O(n^2)$ time algorithm to compute all the actuator locations that gather the particles to one point with one activation, and an $O(n)$ time algorithm to find a single such actuator location if one exists. We then provide an $O(n)$ time algorithm to place the optimal number of actuators whose sequential activation results in the gathering of t"},"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":"1809.09792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-26T03:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"07175ab7da39574d68255292f3659da84c650f13c83d7ceaa90a1d0bc66d3996","abstract_canon_sha256":"1c041908943d1198d7ff6f84679e74b4381e539275ba1591a57d825382358c8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.636542Z","signature_b64":"pfgIqyTqjAzzO074HVDgOBTCbX4dZaFRhDyQBkeJ8t+ZLFQssVk4iKgBZ/vv/gYJv71Yimtly7U6k60Mr7KlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4030242629725e1c17d7d0f545a11eeb3848c06248defbd005fe2d5257e49770","last_reissued_at":"2026-05-18T00:04:43.635951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.635951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gathering by Repulsion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Prosenjit Bose, Thomas Shermer","submitted_at":"2018-09-26T03:34:24Z","abstract_excerpt":"We consider a repulsion actuator located in an $n$-sided convex environment full of point particles. When the actuator is activated, all the particles move away from the actuator. We study the problem of gathering all the particles to a point. We give an $O(n^2)$ time algorithm to compute all the actuator locations that gather the particles to one point with one activation, and an $O(n)$ time algorithm to find a single such actuator location if one exists. We then provide an $O(n)$ time algorithm to place the optimal number of actuators whose sequential activation results in the gathering of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09792","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.09792","created_at":"2026-05-18T00:04:43.636046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09792v1","created_at":"2026-05-18T00:04:43.636046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09792","created_at":"2026-05-18T00:04:43.636046+00:00"},{"alias_kind":"pith_short_12","alias_value":"IAYCIJRJOJPB","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IAYCIJRJOJPBYF6X","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IAYCIJRJ","created_at":"2026-05-18T12:32:28.185984+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/IAYCIJRJOJPBYF6X2D2ULII65M","json":"https://pith.science/pith/IAYCIJRJOJPBYF6X2D2ULII65M.json","graph_json":"https://pith.science/api/pith-number/IAYCIJRJOJPBYF6X2D2ULII65M/graph.json","events_json":"https://pith.science/api/pith-number/IAYCIJRJOJPBYF6X2D2ULII65M/events.json","paper":"https://pith.science/paper/IAYCIJRJ"},"agent_actions":{"view_html":"https://pith.science/pith/IAYCIJRJOJPBYF6X2D2ULII65M","download_json":"https://pith.science/pith/IAYCIJRJOJPBYF6X2D2ULII65M.json","view_paper":"https://pith.science/paper/IAYCIJRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09792&json=true","fetch_graph":"https://pith.science/api/pith-number/IAYCIJRJOJPBYF6X2D2ULII65M/graph.json","fetch_events":"https://pith.science/api/pith-number/IAYCIJRJOJPBYF6X2D2ULII65M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IAYCIJRJOJPBYF6X2D2ULII65M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IAYCIJRJOJPBYF6X2D2ULII65M/action/storage_attestation","attest_author":"https://pith.science/pith/IAYCIJRJOJPBYF6X2D2ULII65M/action/author_attestation","sign_citation":"https://pith.science/pith/IAYCIJRJOJPBYF6X2D2ULII65M/action/citation_signature","submit_replication":"https://pith.science/pith/IAYCIJRJOJPBYF6X2D2ULII65M/action/replication_record"}},"created_at":"2026-05-18T00:04:43.636046+00:00","updated_at":"2026-05-18T00:04:43.636046+00:00"}