{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZKYY5S2DFIWDIBPS4DN5J66BOJ","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":"f3d05e83311ffdb2d3c82882798eece5c8d6cb44c599b86e1f8ae8637a536365","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-13T11:53:21Z","title_canon_sha256":"9486177c1de0f0b58328bf7b83bd153bb4d223517590e7178a7188df8b593816"},"schema_version":"1.0","source":{"id":"1709.04262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04262","created_at":"2026-05-18T00:25:07Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04262v2","created_at":"2026-05-18T00:25:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04262","created_at":"2026-05-18T00:25:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZKYY5S2DFIWD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZKYY5S2DFIWDIBPS","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZKYY5S2D","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:1bff05bc2a37d3fb8cb5aea3c0fe916693a3630dc511d23ca1196174462cb6e1","target":"graph","created_at":"2026-05-18T00:25:07Z","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 a celebrated work, Blais, Brody, and Matulef developed a technique for proving property testing lower bounds via reductions from communication complexity. Their work focused on testing properties of functions, and yielded new lower bounds as well as simplified analyses of known lower bounds. Here, we take a further step in generalizing the methodology of Blais et al. to analyze the query complexity of graph parameter estimation problems. In particular, our technique decouples the lower bound arguments from the representation of the graph, allowing it to work with any query type.\n  We illust","authors_text":"Talya Eden, Will Rosenbaum","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-13T11:53:21Z","title":"Lower Bounds for Approximating Graph Parameters via Communication Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04262","kind":"arxiv","version":2},"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:30bd9493243d090ad08501bef9e8582a50be2327afaacacde50c51e630d9c137","target":"record","created_at":"2026-05-18T00:25:07Z","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":"f3d05e83311ffdb2d3c82882798eece5c8d6cb44c599b86e1f8ae8637a536365","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-13T11:53:21Z","title_canon_sha256":"9486177c1de0f0b58328bf7b83bd153bb4d223517590e7178a7188df8b593816"},"schema_version":"1.0","source":{"id":"1709.04262","kind":"arxiv","version":2}},"canonical_sha256":"cab18ecb432a2c3405f2e0dbd4fbc1726a286c846a2292b90850b925992d5b74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cab18ecb432a2c3405f2e0dbd4fbc1726a286c846a2292b90850b925992d5b74","first_computed_at":"2026-05-18T00:25:07.495612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:07.495612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EtBD0yh8UMdCa860NtzjkD+KcH+1rk+FWJKqt/xzlw14eWKM+yJg9UNWVUBd/Ao/aF9CsGeF/tu1h5bgKK66Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:07.496192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30bd9493243d090ad08501bef9e8582a50be2327afaacacde50c51e630d9c137","sha256:1bff05bc2a37d3fb8cb5aea3c0fe916693a3630dc511d23ca1196174462cb6e1"],"state_sha256":"8134941abc7c336c5b52de0f5eb3cbee9ffea9c438101deddcde676b441705b0"}