{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Q6PUGPEBHZME2CFPLZINXW2SBP","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":"8a25ac510408315d36b4447b8bf710afd4b7838af549076e53959bc18fd75139","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-28T11:47:33Z","title_canon_sha256":"0f4955c7cceea6e195dd386c72ca7c3daa42bc350ff4149b5c9262715821ef33"},"schema_version":"1.0","source":{"id":"1510.08267","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08267","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08267v1","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08267","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"pith_short_12","alias_value":"Q6PUGPEBHZME","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q6PUGPEBHZME2CFP","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q6PUGPEB","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:f0ba71178c16661eff6e513e35d55c3e0fdc98dd55deeb103a38b186f5c93172","target":"graph","created_at":"2026-05-18T01:28:36Z","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":"The query complexity of graph properties is well-studied when queries are on edges. We investigate the same when queries are on nodes. In this setting a graph $G = (V, E)$ on $n$ vertices and a property $\\mathcal{P}$ are given. A black-box access to an unknown subset $S \\subseteq V$ is provided via queries of the form `Does $i \\in S$?'. We are interested in the minimum number of queries needed in worst case in order to determine whether $G[S]$, the subgraph of $G$ induced on $S$, satisfies $\\mathcal{P}$.\n  Apart from being combinatorially rich, this setting allows us to initiate a systematic s","authors_text":"Nikhil Balaji, Raghav Kulkarni, Samir Datta, Supartha Podder","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-28T11:47:33Z","title":"Graph properties in node-query setting: effect of breaking symmetry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08267","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:94efcbe02d8c0963372c2290517915004319d00b8e1ecc67a1c128b4322c7b47","target":"record","created_at":"2026-05-18T01:28:36Z","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":"8a25ac510408315d36b4447b8bf710afd4b7838af549076e53959bc18fd75139","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-28T11:47:33Z","title_canon_sha256":"0f4955c7cceea6e195dd386c72ca7c3daa42bc350ff4149b5c9262715821ef33"},"schema_version":"1.0","source":{"id":"1510.08267","kind":"arxiv","version":1}},"canonical_sha256":"879f433c813e584d08af5e50dbdb520bee1ce89561b8847ebadf1a6fc3840bd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"879f433c813e584d08af5e50dbdb520bee1ce89561b8847ebadf1a6fc3840bd7","first_computed_at":"2026-05-18T01:28:36.665192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:36.665192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E74GrCIO7ReeQ/EGhwhYLePQVd7U4HNYeiTiapLpZGj8XQsu1UvRRuImYg8VAbWV1XaXGUoaFvvCYp4Ukw4ACg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:36.666027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08267","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94efcbe02d8c0963372c2290517915004319d00b8e1ecc67a1c128b4322c7b47","sha256:f0ba71178c16661eff6e513e35d55c3e0fdc98dd55deeb103a38b186f5c93172"],"state_sha256":"8fbd77c10295e6855179b8eab101a442421531582631557aff47f68b74badbea"}