{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FYTA67VA57SYOXEKL54L7H25RF","short_pith_number":"pith:FYTA67VA","schema_version":"1.0","canonical_sha256":"2e260f7ea0efe5875c8a5f78bf9f5d89426a3f446a9bdb273926faec04330a54","source":{"kind":"arxiv","id":"1907.02131","version":1},"attestation_state":"computed","paper":{"title":"Stabilization Time in Minority Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"P\\'al Andr\\'as Papp, Roger Wattenhofer","submitted_at":"2019-07-03T20:55:47Z","abstract_excerpt":"We analyze the stabilization time of minority processes in graphs. A minority process is a dynamically changing coloring, where each node repeatedly changes its color to the color which is least frequent in its neighborhood. First, we present a simple $\\Omega(n^2)$ stabilization time lower bound in the sequential adversarial model. Our main contribution is a graph construction which proves a ${\\Omega}(n^{2-\\epsilon})$ stabilization time lower bound for any $\\epsilon>0$. This lower bound holds even if the order of nodes is chosen benevolently, not only in the sequential model, but also in any r"},"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":"1907.02131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-03T20:55:47Z","cross_cats_sorted":[],"title_canon_sha256":"b45055dd1dc6e4861afa528b2b66c9b116b542ea1eea90fe0bb3853ca2ec3630","abstract_canon_sha256":"2f36b607ca6c6be693fa29cc4c7923c3c6bc0db1aaece3c0f3e00c4582f16a2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:29.776856Z","signature_b64":"ormSgqyO1a0zNROVyBWJzORJwlZg5EVueeAvbh6csO95enIop/RistTKeNKb+L8LxrODIcUKA34K4dgZq01OBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e260f7ea0efe5875c8a5f78bf9f5d89426a3f446a9bdb273926faec04330a54","last_reissued_at":"2026-05-17T23:41:29.776132Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:29.776132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stabilization Time in Minority Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"P\\'al Andr\\'as Papp, Roger Wattenhofer","submitted_at":"2019-07-03T20:55:47Z","abstract_excerpt":"We analyze the stabilization time of minority processes in graphs. A minority process is a dynamically changing coloring, where each node repeatedly changes its color to the color which is least frequent in its neighborhood. First, we present a simple $\\Omega(n^2)$ stabilization time lower bound in the sequential adversarial model. Our main contribution is a graph construction which proves a ${\\Omega}(n^{2-\\epsilon})$ stabilization time lower bound for any $\\epsilon>0$. This lower bound holds even if the order of nodes is chosen benevolently, not only in the sequential model, but also in any r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02131","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":"1907.02131","created_at":"2026-05-17T23:41:29.776261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02131v1","created_at":"2026-05-17T23:41:29.776261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02131","created_at":"2026-05-17T23:41:29.776261+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYTA67VA57SY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYTA67VA57SYOXEK","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYTA67VA","created_at":"2026-05-18T12:33:18.533446+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/FYTA67VA57SYOXEKL54L7H25RF","json":"https://pith.science/pith/FYTA67VA57SYOXEKL54L7H25RF.json","graph_json":"https://pith.science/api/pith-number/FYTA67VA57SYOXEKL54L7H25RF/graph.json","events_json":"https://pith.science/api/pith-number/FYTA67VA57SYOXEKL54L7H25RF/events.json","paper":"https://pith.science/paper/FYTA67VA"},"agent_actions":{"view_html":"https://pith.science/pith/FYTA67VA57SYOXEKL54L7H25RF","download_json":"https://pith.science/pith/FYTA67VA57SYOXEKL54L7H25RF.json","view_paper":"https://pith.science/paper/FYTA67VA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02131&json=true","fetch_graph":"https://pith.science/api/pith-number/FYTA67VA57SYOXEKL54L7H25RF/graph.json","fetch_events":"https://pith.science/api/pith-number/FYTA67VA57SYOXEKL54L7H25RF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYTA67VA57SYOXEKL54L7H25RF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYTA67VA57SYOXEKL54L7H25RF/action/storage_attestation","attest_author":"https://pith.science/pith/FYTA67VA57SYOXEKL54L7H25RF/action/author_attestation","sign_citation":"https://pith.science/pith/FYTA67VA57SYOXEKL54L7H25RF/action/citation_signature","submit_replication":"https://pith.science/pith/FYTA67VA57SYOXEKL54L7H25RF/action/replication_record"}},"created_at":"2026-05-17T23:41:29.776261+00:00","updated_at":"2026-05-17T23:41:29.776261+00:00"}