{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ARXNE56DUL5XQQQ23ZSVUP22F7","short_pith_number":"pith:ARXNE56D","schema_version":"1.0","canonical_sha256":"046ed277c3a2fb78421ade655a3f5a2fed2561ee310e403c09024ff4d5986a25","source":{"kind":"arxiv","id":"1406.0769","version":3},"attestation_state":"computed","paper":{"title":"A quadratic lower bound for the convergence rate in the one-dimensional Hegselmann-Krause bounded confidence dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.SY","authors_text":"Edvin Wedin, Peter Hegarty","submitted_at":"2014-06-02T14:59:29Z","abstract_excerpt":"Let f_{k}(n) be the maximum number of time steps taken to reach equilibrium by a system of n agents obeying the k-dimensional Hegselmann-Krause bounded confidence dynamics. Previously, it was known that \\Omega(n) = f_{1}(n) = O(n^3). Here we show that f_{1}(n) = \\Omega(n^2), which matches the best-known lower bound in all dimensions k >= 2."},"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":"1406.0769","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-02T14:59:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c97787107a74ee579c0e45c8ec5927b9880e9ea6f161e0e54362b610170cfb68","abstract_canon_sha256":"d3be8a2ce180de11586dc6dd140ae21413c735da3186a3059ae5edf0bd3906ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:31.966225Z","signature_b64":"w60Uv9HgTgfyVkbctg/J/k+IEYabnKU1SlImWz89HDJDWsgY/suKzZgTOdzxVnrzxaeToDXO95ZXsNJFJfJiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"046ed277c3a2fb78421ade655a3f5a2fed2561ee310e403c09024ff4d5986a25","last_reissued_at":"2026-05-18T02:30:31.965783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:31.965783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quadratic lower bound for the convergence rate in the one-dimensional Hegselmann-Krause bounded confidence dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.SY","authors_text":"Edvin Wedin, Peter Hegarty","submitted_at":"2014-06-02T14:59:29Z","abstract_excerpt":"Let f_{k}(n) be the maximum number of time steps taken to reach equilibrium by a system of n agents obeying the k-dimensional Hegselmann-Krause bounded confidence dynamics. Previously, it was known that \\Omega(n) = f_{1}(n) = O(n^3). Here we show that f_{1}(n) = \\Omega(n^2), which matches the best-known lower bound in all dimensions k >= 2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0769","kind":"arxiv","version":3},"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":"1406.0769","created_at":"2026-05-18T02:30:31.965847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0769v3","created_at":"2026-05-18T02:30:31.965847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0769","created_at":"2026-05-18T02:30:31.965847+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARXNE56DUL5X","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARXNE56DUL5XQQQ2","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARXNE56D","created_at":"2026-05-18T12:28:19.803747+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/ARXNE56DUL5XQQQ23ZSVUP22F7","json":"https://pith.science/pith/ARXNE56DUL5XQQQ23ZSVUP22F7.json","graph_json":"https://pith.science/api/pith-number/ARXNE56DUL5XQQQ23ZSVUP22F7/graph.json","events_json":"https://pith.science/api/pith-number/ARXNE56DUL5XQQQ23ZSVUP22F7/events.json","paper":"https://pith.science/paper/ARXNE56D"},"agent_actions":{"view_html":"https://pith.science/pith/ARXNE56DUL5XQQQ23ZSVUP22F7","download_json":"https://pith.science/pith/ARXNE56DUL5XQQQ23ZSVUP22F7.json","view_paper":"https://pith.science/paper/ARXNE56D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0769&json=true","fetch_graph":"https://pith.science/api/pith-number/ARXNE56DUL5XQQQ23ZSVUP22F7/graph.json","fetch_events":"https://pith.science/api/pith-number/ARXNE56DUL5XQQQ23ZSVUP22F7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARXNE56DUL5XQQQ23ZSVUP22F7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARXNE56DUL5XQQQ23ZSVUP22F7/action/storage_attestation","attest_author":"https://pith.science/pith/ARXNE56DUL5XQQQ23ZSVUP22F7/action/author_attestation","sign_citation":"https://pith.science/pith/ARXNE56DUL5XQQQ23ZSVUP22F7/action/citation_signature","submit_replication":"https://pith.science/pith/ARXNE56DUL5XQQQ23ZSVUP22F7/action/replication_record"}},"created_at":"2026-05-18T02:30:31.965847+00:00","updated_at":"2026-05-18T02:30:31.965847+00:00"}