{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IBC73V45QHQRU7EU6GLD3UDEVP","short_pith_number":"pith:IBC73V45","schema_version":"1.0","canonical_sha256":"4045fdd79d81e11a7c94f1963dd064abe77823bd6b2473289137502e3af7cd8e","source":{"kind":"arxiv","id":"1605.05013","version":1},"attestation_state":"computed","paper":{"title":"Success criteria for quantum search on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avatar Tulsi","submitted_at":"2016-05-17T04:14:56Z","abstract_excerpt":"We consider quantum search on graphs. Recently, it has been shown that the graph properties like connectivity, global symmetry, or regularity cannot serve as a reliable criteria that must be satisfied by a graph to allow a successful quantum search. It is an open question whether it is possible to find such a criteria. We solve this question by giving an affirmative answer."},"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":"1605.05013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-17T04:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"8aa36036f5534ffe31a9be3b5cd951835f303916698870de1bbf36c65d5a3491","abstract_canon_sha256":"fdf30c3b3db8c2dfbb05cd3983899ca42cf77241f260ae0682b080472111b358"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:37.713585Z","signature_b64":"g4MryQZbycdvssg5F84Lxls/4syJTjRwRmF3Q3mP7tlFnmVl0AmLsDqy1OD1EwifMvpLAFg/W0YhE1I2Iuf3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4045fdd79d81e11a7c94f1963dd064abe77823bd6b2473289137502e3af7cd8e","last_reissued_at":"2026-05-18T01:14:37.712867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:37.712867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Success criteria for quantum search on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avatar Tulsi","submitted_at":"2016-05-17T04:14:56Z","abstract_excerpt":"We consider quantum search on graphs. Recently, it has been shown that the graph properties like connectivity, global symmetry, or regularity cannot serve as a reliable criteria that must be satisfied by a graph to allow a successful quantum search. It is an open question whether it is possible to find such a criteria. We solve this question by giving an affirmative answer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05013","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":"1605.05013","created_at":"2026-05-18T01:14:37.712974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05013v1","created_at":"2026-05-18T01:14:37.712974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05013","created_at":"2026-05-18T01:14:37.712974+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBC73V45QHQR","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBC73V45QHQRU7EU","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBC73V45","created_at":"2026-05-18T12:30:22.444734+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/IBC73V45QHQRU7EU6GLD3UDEVP","json":"https://pith.science/pith/IBC73V45QHQRU7EU6GLD3UDEVP.json","graph_json":"https://pith.science/api/pith-number/IBC73V45QHQRU7EU6GLD3UDEVP/graph.json","events_json":"https://pith.science/api/pith-number/IBC73V45QHQRU7EU6GLD3UDEVP/events.json","paper":"https://pith.science/paper/IBC73V45"},"agent_actions":{"view_html":"https://pith.science/pith/IBC73V45QHQRU7EU6GLD3UDEVP","download_json":"https://pith.science/pith/IBC73V45QHQRU7EU6GLD3UDEVP.json","view_paper":"https://pith.science/paper/IBC73V45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05013&json=true","fetch_graph":"https://pith.science/api/pith-number/IBC73V45QHQRU7EU6GLD3UDEVP/graph.json","fetch_events":"https://pith.science/api/pith-number/IBC73V45QHQRU7EU6GLD3UDEVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBC73V45QHQRU7EU6GLD3UDEVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBC73V45QHQRU7EU6GLD3UDEVP/action/storage_attestation","attest_author":"https://pith.science/pith/IBC73V45QHQRU7EU6GLD3UDEVP/action/author_attestation","sign_citation":"https://pith.science/pith/IBC73V45QHQRU7EU6GLD3UDEVP/action/citation_signature","submit_replication":"https://pith.science/pith/IBC73V45QHQRU7EU6GLD3UDEVP/action/replication_record"}},"created_at":"2026-05-18T01:14:37.712974+00:00","updated_at":"2026-05-18T01:14:37.712974+00:00"}