{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GTVQCLRKLM4UJ6GEUN2HXQIIAK","short_pith_number":"pith:GTVQCLRK","schema_version":"1.0","canonical_sha256":"34eb012e2a5b3944f8c4a3747bc1080298b74db72752eefe10e49f41453e62b7","source":{"kind":"arxiv","id":"1705.08438","version":1},"attestation_state":"computed","paper":{"title":"On The Multiparty Communication Complexity of Testing Triangle-Freeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Orr Fischer, Rotem Oshman, Shay Gershtein","submitted_at":"2017-05-23T17:48:25Z","abstract_excerpt":"In this paper we initiate the study of property testing in simultaneous and non-simultaneous multi-party communication complexity, focusing on testing triangle-freeness in graphs. We consider the $\\textit{coordinator}$ model, where we have $k$ players receiving private inputs, and a coordinator who receives no input; the coordinator can communicate with all the players, but the players cannot communicate with each other. In this model, we ask: if an input graph is divided between the players, with each player receiving some of the edges, how many bits do the players and the coordinator need to"},"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":"1705.08438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-23T17:48:25Z","cross_cats_sorted":[],"title_canon_sha256":"153aaa4112a31ecdb3dc73adc73d4c9c26d70257cd70f94dc060fb7c026956d0","abstract_canon_sha256":"8374735a4c41e190e672f1e1d48ee81ba88f46750a8355af7a75f655f753f93e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.268106Z","signature_b64":"gVFh+c+QiUZOR7hYNvJNXsHbIQnUcIXSCD9rrPmLIljmepdEjFDpBKVq70LiuTne1F2fb4qiVftS0ISyOp71BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34eb012e2a5b3944f8c4a3747bc1080298b74db72752eefe10e49f41453e62b7","last_reissued_at":"2026-05-18T00:43:48.267473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.267473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The Multiparty Communication Complexity of Testing Triangle-Freeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Orr Fischer, Rotem Oshman, Shay Gershtein","submitted_at":"2017-05-23T17:48:25Z","abstract_excerpt":"In this paper we initiate the study of property testing in simultaneous and non-simultaneous multi-party communication complexity, focusing on testing triangle-freeness in graphs. We consider the $\\textit{coordinator}$ model, where we have $k$ players receiving private inputs, and a coordinator who receives no input; the coordinator can communicate with all the players, but the players cannot communicate with each other. In this model, we ask: if an input graph is divided between the players, with each player receiving some of the edges, how many bits do the players and the coordinator need to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08438","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":"1705.08438","created_at":"2026-05-18T00:43:48.267568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08438v1","created_at":"2026-05-18T00:43:48.267568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08438","created_at":"2026-05-18T00:43:48.267568+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTVQCLRKLM4U","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTVQCLRKLM4UJ6GE","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTVQCLRK","created_at":"2026-05-18T12:31:18.294218+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/GTVQCLRKLM4UJ6GEUN2HXQIIAK","json":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK.json","graph_json":"https://pith.science/api/pith-number/GTVQCLRKLM4UJ6GEUN2HXQIIAK/graph.json","events_json":"https://pith.science/api/pith-number/GTVQCLRKLM4UJ6GEUN2HXQIIAK/events.json","paper":"https://pith.science/paper/GTVQCLRK"},"agent_actions":{"view_html":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK","download_json":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK.json","view_paper":"https://pith.science/paper/GTVQCLRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08438&json=true","fetch_graph":"https://pith.science/api/pith-number/GTVQCLRKLM4UJ6GEUN2HXQIIAK/graph.json","fetch_events":"https://pith.science/api/pith-number/GTVQCLRKLM4UJ6GEUN2HXQIIAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/action/storage_attestation","attest_author":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/action/author_attestation","sign_citation":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/action/citation_signature","submit_replication":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/action/replication_record"}},"created_at":"2026-05-18T00:43:48.267568+00:00","updated_at":"2026-05-18T00:43:48.267568+00:00"}