{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q6PUGPEBHZME2CFPLZINXW2SBP","short_pith_number":"pith:Q6PUGPEB","schema_version":"1.0","canonical_sha256":"879f433c813e584d08af5e50dbdb520bee1ce89561b8847ebadf1a6fc3840bd7","source":{"kind":"arxiv","id":"1510.08267","version":1},"attestation_state":"computed","paper":{"title":"Graph properties in node-query setting: effect of breaking symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Nikhil Balaji, Raghav Kulkarni, Samir Datta, Supartha Podder","submitted_at":"2015-10-28T11:47:33Z","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"},"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":"1510.08267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-28T11:47:33Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"0f4955c7cceea6e195dd386c72ca7c3daa42bc350ff4149b5c9262715821ef33","abstract_canon_sha256":"8a25ac510408315d36b4447b8bf710afd4b7838af549076e53959bc18fd75139"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:36.666027Z","signature_b64":"E74GrCIO7ReeQ/EGhwhYLePQVd7U4HNYeiTiapLpZGj8XQsu1UvRRuImYg8VAbWV1XaXGUoaFvvCYp4Ukw4ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"879f433c813e584d08af5e50dbdb520bee1ce89561b8847ebadf1a6fc3840bd7","last_reissued_at":"2026-05-18T01:28:36.665192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:36.665192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph properties in node-query setting: effect of breaking symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Nikhil Balaji, Raghav Kulkarni, Samir Datta, Supartha Podder","submitted_at":"2015-10-28T11:47:33Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08267","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":"1510.08267","created_at":"2026-05-18T01:28:36.665331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08267v1","created_at":"2026-05-18T01:28:36.665331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08267","created_at":"2026-05-18T01:28:36.665331+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6PUGPEBHZME","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6PUGPEBHZME2CFP","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6PUGPEB","created_at":"2026-05-18T12:29:37.295048+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/Q6PUGPEBHZME2CFPLZINXW2SBP","json":"https://pith.science/pith/Q6PUGPEBHZME2CFPLZINXW2SBP.json","graph_json":"https://pith.science/api/pith-number/Q6PUGPEBHZME2CFPLZINXW2SBP/graph.json","events_json":"https://pith.science/api/pith-number/Q6PUGPEBHZME2CFPLZINXW2SBP/events.json","paper":"https://pith.science/paper/Q6PUGPEB"},"agent_actions":{"view_html":"https://pith.science/pith/Q6PUGPEBHZME2CFPLZINXW2SBP","download_json":"https://pith.science/pith/Q6PUGPEBHZME2CFPLZINXW2SBP.json","view_paper":"https://pith.science/paper/Q6PUGPEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08267&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6PUGPEBHZME2CFPLZINXW2SBP/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6PUGPEBHZME2CFPLZINXW2SBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6PUGPEBHZME2CFPLZINXW2SBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6PUGPEBHZME2CFPLZINXW2SBP/action/storage_attestation","attest_author":"https://pith.science/pith/Q6PUGPEBHZME2CFPLZINXW2SBP/action/author_attestation","sign_citation":"https://pith.science/pith/Q6PUGPEBHZME2CFPLZINXW2SBP/action/citation_signature","submit_replication":"https://pith.science/pith/Q6PUGPEBHZME2CFPLZINXW2SBP/action/replication_record"}},"created_at":"2026-05-18T01:28:36.665331+00:00","updated_at":"2026-05-18T01:28:36.665331+00:00"}