{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7MR7LKBXQSWIOUGE23ZJUPLBD4","short_pith_number":"pith:7MR7LKBX","schema_version":"1.0","canonical_sha256":"fb23f5a83784ac8750c4d6f29a3d611f1280af71cf894dfa3457e8322bd6b8b3","source":{"kind":"arxiv","id":"1511.00457","version":5},"attestation_state":"computed","paper":{"title":"Structure theory of flip graphs with applications to Weak Symmetry Breaking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DC","authors_text":"Dmitry N. Kozlov","submitted_at":"2015-11-02T11:46:41Z","abstract_excerpt":"This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values of n, such that WSB for n~processes is solvable by a certain explicitly constructed 3-round IIS protocol. In particular, the minimal number of rounds, which an IIS protocol needs in order to solve the WSB task, does not go to infinity, when the number of processes goes to infinity. Our methods can also be used to generate such values of n.\n  We phrase our p"},"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":"1511.00457","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-02T11:46:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2611af6ba94313054feae5755bdb5b459164a01a4fb90522f134ac080bf907d5","abstract_canon_sha256":"c84e9be715eee2661699394a88927fbef085923ebcc6d4ec395c52484588f4df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:09.850445Z","signature_b64":"Ut3OF2PBO7o5nclHG/3jqQxGo8w89FoeMPMW/DVpBdi08f9MmMChk9aNx+j/Gt5kFU8zVvMkivVVt8qdU4/XBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb23f5a83784ac8750c4d6f29a3d611f1280af71cf894dfa3457e8322bd6b8b3","last_reissued_at":"2026-05-18T00:50:09.849835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:09.849835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure theory of flip graphs with applications to Weak Symmetry Breaking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DC","authors_text":"Dmitry N. Kozlov","submitted_at":"2015-11-02T11:46:41Z","abstract_excerpt":"This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values of n, such that WSB for n~processes is solvable by a certain explicitly constructed 3-round IIS protocol. In particular, the minimal number of rounds, which an IIS protocol needs in order to solve the WSB task, does not go to infinity, when the number of processes goes to infinity. Our methods can also be used to generate such values of n.\n  We phrase our p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00457","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":""},"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":"1511.00457","created_at":"2026-05-18T00:50:09.849923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00457v5","created_at":"2026-05-18T00:50:09.849923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00457","created_at":"2026-05-18T00:50:09.849923+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MR7LKBXQSWI","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MR7LKBXQSWIOUGE","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MR7LKBX","created_at":"2026-05-18T12:29:10.953037+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/7MR7LKBXQSWIOUGE23ZJUPLBD4","json":"https://pith.science/pith/7MR7LKBXQSWIOUGE23ZJUPLBD4.json","graph_json":"https://pith.science/api/pith-number/7MR7LKBXQSWIOUGE23ZJUPLBD4/graph.json","events_json":"https://pith.science/api/pith-number/7MR7LKBXQSWIOUGE23ZJUPLBD4/events.json","paper":"https://pith.science/paper/7MR7LKBX"},"agent_actions":{"view_html":"https://pith.science/pith/7MR7LKBXQSWIOUGE23ZJUPLBD4","download_json":"https://pith.science/pith/7MR7LKBXQSWIOUGE23ZJUPLBD4.json","view_paper":"https://pith.science/paper/7MR7LKBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00457&json=true","fetch_graph":"https://pith.science/api/pith-number/7MR7LKBXQSWIOUGE23ZJUPLBD4/graph.json","fetch_events":"https://pith.science/api/pith-number/7MR7LKBXQSWIOUGE23ZJUPLBD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MR7LKBXQSWIOUGE23ZJUPLBD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MR7LKBXQSWIOUGE23ZJUPLBD4/action/storage_attestation","attest_author":"https://pith.science/pith/7MR7LKBXQSWIOUGE23ZJUPLBD4/action/author_attestation","sign_citation":"https://pith.science/pith/7MR7LKBXQSWIOUGE23ZJUPLBD4/action/citation_signature","submit_replication":"https://pith.science/pith/7MR7LKBXQSWIOUGE23ZJUPLBD4/action/replication_record"}},"created_at":"2026-05-18T00:50:09.849923+00:00","updated_at":"2026-05-18T00:50:09.849923+00:00"}