{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YAT4FLZTVUM22DAOS6HXJ7SOED","short_pith_number":"pith:YAT4FLZT","schema_version":"1.0","canonical_sha256":"c027c2af33ad19ad0c0e978f74fe4e20d0b56d6bbebcc86be0ff4f93bd8c6b3f","source":{"kind":"arxiv","id":"1808.03324","version":3},"attestation_state":"computed","paper":{"title":"Topological Graphic Passwords And Their Matchings Towards Cryptography","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CR","authors_text":"Bing Yao, Chao Yang, Hongyu Wang, Hui Sun, Jing Su, Mingjun Zhang, Sihua Yang, Xiaohui Zhang, Yarong Mu, Yirong Sun","submitted_at":"2018-07-26T16:34:51Z","abstract_excerpt":"Graphical passwords (GPWs) are convenient for mobile equipments with touch screen. Topological graphic passwords (Topsnut-gpws) can be saved in computer by classical matrices and run quickly than the existing GPWs. We research Topsnut-gpws by the matching of view, since they have many advantages. We discuss: configuration matching partition, coloring/labelling matching partition, set matching partition, matching chain, etc. And, we introduce new graph labellings for enriching Topsnut-matchings and show that these labellings can be realized for trees or spanning trees of networks. In theoretica"},"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":"1808.03324","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2018-07-26T16:34:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"93fb215767e055cc575138325df21b9363049a9086f2c657e6f67b8d0c46a74d","abstract_canon_sha256":"bb3cb287a2e2a4224cdc4d3c6bb45a06d76ced410747b9aeb613554e961cb970"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:05:32.980821Z","signature_b64":"3xrzjzrVQ5xIFfhCkIgyctOquu0wqSm7z49g/Hn7IFosH/wYSgJ/6sPNK25T3xDuu6wGz6NOpV6CvwrC7GY2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c027c2af33ad19ad0c0e978f74fe4e20d0b56d6bbebcc86be0ff4f93bd8c6b3f","last_reissued_at":"2026-07-05T00:05:32.980425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:05:32.980425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological Graphic Passwords And Their Matchings Towards Cryptography","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CR","authors_text":"Bing Yao, Chao Yang, Hongyu Wang, Hui Sun, Jing Su, Mingjun Zhang, Sihua Yang, Xiaohui Zhang, Yarong Mu, Yirong Sun","submitted_at":"2018-07-26T16:34:51Z","abstract_excerpt":"Graphical passwords (GPWs) are convenient for mobile equipments with touch screen. Topological graphic passwords (Topsnut-gpws) can be saved in computer by classical matrices and run quickly than the existing GPWs. We research Topsnut-gpws by the matching of view, since they have many advantages. We discuss: configuration matching partition, coloring/labelling matching partition, set matching partition, matching chain, etc. And, we introduce new graph labellings for enriching Topsnut-matchings and show that these labellings can be realized for trees or spanning trees of networks. In theoretica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03324","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1808.03324/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1808.03324","created_at":"2026-07-05T00:05:32.980481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03324v3","created_at":"2026-07-05T00:05:32.980481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03324","created_at":"2026-07-05T00:05:32.980481+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAT4FLZTVUM2","created_at":"2026-07-05T00:05:32.980481+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAT4FLZTVUM22DAO","created_at":"2026-07-05T00:05:32.980481+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAT4FLZT","created_at":"2026-07-05T00:05:32.980481+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21097","citing_title":"Singularity Cipher: A Topology-Driven Cryptographic Scheme Based on Visual Paradox and Klein Bottle Illusions","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YAT4FLZTVUM22DAOS6HXJ7SOED","json":"https://pith.science/pith/YAT4FLZTVUM22DAOS6HXJ7SOED.json","graph_json":"https://pith.science/api/pith-number/YAT4FLZTVUM22DAOS6HXJ7SOED/graph.json","events_json":"https://pith.science/api/pith-number/YAT4FLZTVUM22DAOS6HXJ7SOED/events.json","paper":"https://pith.science/paper/YAT4FLZT"},"agent_actions":{"view_html":"https://pith.science/pith/YAT4FLZTVUM22DAOS6HXJ7SOED","download_json":"https://pith.science/pith/YAT4FLZTVUM22DAOS6HXJ7SOED.json","view_paper":"https://pith.science/paper/YAT4FLZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03324&json=true","fetch_graph":"https://pith.science/api/pith-number/YAT4FLZTVUM22DAOS6HXJ7SOED/graph.json","fetch_events":"https://pith.science/api/pith-number/YAT4FLZTVUM22DAOS6HXJ7SOED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAT4FLZTVUM22DAOS6HXJ7SOED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAT4FLZTVUM22DAOS6HXJ7SOED/action/storage_attestation","attest_author":"https://pith.science/pith/YAT4FLZTVUM22DAOS6HXJ7SOED/action/author_attestation","sign_citation":"https://pith.science/pith/YAT4FLZTVUM22DAOS6HXJ7SOED/action/citation_signature","submit_replication":"https://pith.science/pith/YAT4FLZTVUM22DAOS6HXJ7SOED/action/replication_record"}},"created_at":"2026-07-05T00:05:32.980481+00:00","updated_at":"2026-07-05T00:05:32.980481+00:00"}