{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GTVQCLRKLM4UJ6GEUN2HXQIIAK","short_pith_number":"pith:GTVQCLRK","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"},"canonical_sha256":"34eb012e2a5b3944f8c4a3747bc1080298b74db72752eefe10e49f41453e62b7","source":{"kind":"arxiv","id":"1705.08438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08438","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08438v1","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08438","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"GTVQCLRKLM4U","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GTVQCLRKLM4UJ6GE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GTVQCLRK","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GTVQCLRKLM4UJ6GEUN2HXQIIAK","target":"record","payload":{"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"},"canonical_sha256":"34eb012e2a5b3944f8c4a3747bc1080298b74db72752eefe10e49f41453e62b7","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"},"source_kind":"arxiv","source_id":"1705.08438","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8tj9B6arY3Sf7MrX1X5iHeE2WXD/M49GVocjrVt9Adx3rMHn5ke1wgCIPklgXP97+3ekq2fjImvSXp1oj78Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:33:08.109062Z"},"content_sha256":"e57c017e9fa9104161f613c884b26585a8ce93cb45108c266d1ca92a13265edc","schema_version":"1.0","event_id":"sha256:e57c017e9fa9104161f613c884b26585a8ce93cb45108c266d1ca92a13265edc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GTVQCLRKLM4UJ6GEUN2HXQIIAK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8svVEx0UjbdPTBIIqKO/wm7INuqAAwPEP2O3K/rMmpDRBYL1Tag2uZy//cDbC2XhqXVUb3zBW1Xr8y2qNxsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:33:08.109739Z"},"content_sha256":"1a986d1a80aeddd45dfde0a93da0af213699de586b73b68f71c5237812189ec7","schema_version":"1.0","event_id":"sha256:1a986d1a80aeddd45dfde0a93da0af213699de586b73b68f71c5237812189ec7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/bundle.json","state_url":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T20:33:08Z","links":{"resolver":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK","bundle":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/bundle.json","state":"https://pith.science/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTVQCLRKLM4UJ6GEUN2HXQIIAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GTVQCLRKLM4UJ6GEUN2HXQIIAK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8374735a4c41e190e672f1e1d48ee81ba88f46750a8355af7a75f655f753f93e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-23T17:48:25Z","title_canon_sha256":"153aaa4112a31ecdb3dc73adc73d4c9c26d70257cd70f94dc060fb7c026956d0"},"schema_version":"1.0","source":{"id":"1705.08438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08438","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08438v1","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08438","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"GTVQCLRKLM4U","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GTVQCLRKLM4UJ6GE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GTVQCLRK","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:1a986d1a80aeddd45dfde0a93da0af213699de586b73b68f71c5237812189ec7","target":"graph","created_at":"2026-05-18T00:43:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Orr Fischer, Rotem Oshman, Shay Gershtein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-23T17:48:25Z","title":"On The Multiparty Communication Complexity of Testing Triangle-Freeness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08438","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e57c017e9fa9104161f613c884b26585a8ce93cb45108c266d1ca92a13265edc","target":"record","created_at":"2026-05-18T00:43:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8374735a4c41e190e672f1e1d48ee81ba88f46750a8355af7a75f655f753f93e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-23T17:48:25Z","title_canon_sha256":"153aaa4112a31ecdb3dc73adc73d4c9c26d70257cd70f94dc060fb7c026956d0"},"schema_version":"1.0","source":{"id":"1705.08438","kind":"arxiv","version":1}},"canonical_sha256":"34eb012e2a5b3944f8c4a3747bc1080298b74db72752eefe10e49f41453e62b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34eb012e2a5b3944f8c4a3747bc1080298b74db72752eefe10e49f41453e62b7","first_computed_at":"2026-05-18T00:43:48.267473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:48.267473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gVFh+c+QiUZOR7hYNvJNXsHbIQnUcIXSCD9rrPmLIljmepdEjFDpBKVq70LiuTne1F2fb4qiVftS0ISyOp71BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:48.268106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e57c017e9fa9104161f613c884b26585a8ce93cb45108c266d1ca92a13265edc","sha256:1a986d1a80aeddd45dfde0a93da0af213699de586b73b68f71c5237812189ec7"],"state_sha256":"dc5bfbb89686078f21c8f7bc667174fe5161a313a75cc60e310f685b31eb3f02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AgTcYf8JDbYpGJwnHe+dob/AgWgH3Q4SlvnIc39xh6Hjn8+VZ/MoZyFzLHLHqQh+5bPM3GpZqO8V4g+7Sha+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:33:08.114120Z","bundle_sha256":"ccba329d77787aaf6ec790c0cdb3aca4533eeb0cc206e3b79249eff9d0f5010c"}}