{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UWMXNNIDYTAELJBWI4DUWK2WQD","short_pith_number":"pith:UWMXNNID","schema_version":"1.0","canonical_sha256":"a59976b503c4c045a43647074b2b5680cf54ede174de4da7df603f910ac0e989","source":{"kind":"arxiv","id":"1709.07785","version":1},"attestation_state":"computed","paper":{"title":"Secure Grouping Protocol Using a Deck of Cards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Goichiro Hanaoka, Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, Yuji Hashimoto","submitted_at":"2017-09-22T14:43:31Z","abstract_excerpt":"We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about how the remaining parties are divided (except for certain public predetermined constraints, such as the number of parties in each group). In this paper, we construct an information-theoretically secure protocol using a deck of physical cards to solve the problem, which is jointly executable by the parties themselves without a trusted third party. Despite the n"},"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":"1709.07785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-09-22T14:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"d96cb8987cb4033c4a987b9f805343bb44c15c61274f55d3a36292fbf7e6e9a3","abstract_canon_sha256":"a01447d9c8ca1459fbf7f5932d050e40b8af8b2060e452b7858af8725a6aefd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:19.454657Z","signature_b64":"Z2uGSck8bhg8J5KqWoGI1WShwxuNCaTgSBSUlLra51kicad6Isdnc3PutI8qADzAJ3F+BTO8+HfLKPHaLdC/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a59976b503c4c045a43647074b2b5680cf54ede174de4da7df603f910ac0e989","last_reissued_at":"2026-05-18T00:03:19.454016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:19.454016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Grouping Protocol Using a Deck of Cards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Goichiro Hanaoka, Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, Yuji Hashimoto","submitted_at":"2017-09-22T14:43:31Z","abstract_excerpt":"We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about how the remaining parties are divided (except for certain public predetermined constraints, such as the number of parties in each group). In this paper, we construct an information-theoretically secure protocol using a deck of physical cards to solve the problem, which is jointly executable by the parties themselves without a trusted third party. Despite the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07785","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":"1709.07785","created_at":"2026-05-18T00:03:19.454111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07785v1","created_at":"2026-05-18T00:03:19.454111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07785","created_at":"2026-05-18T00:03:19.454111+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWMXNNIDYTAE","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWMXNNIDYTAELJBW","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWMXNNID","created_at":"2026-05-18T12:31:49.984773+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/UWMXNNIDYTAELJBWI4DUWK2WQD","json":"https://pith.science/pith/UWMXNNIDYTAELJBWI4DUWK2WQD.json","graph_json":"https://pith.science/api/pith-number/UWMXNNIDYTAELJBWI4DUWK2WQD/graph.json","events_json":"https://pith.science/api/pith-number/UWMXNNIDYTAELJBWI4DUWK2WQD/events.json","paper":"https://pith.science/paper/UWMXNNID"},"agent_actions":{"view_html":"https://pith.science/pith/UWMXNNIDYTAELJBWI4DUWK2WQD","download_json":"https://pith.science/pith/UWMXNNIDYTAELJBWI4DUWK2WQD.json","view_paper":"https://pith.science/paper/UWMXNNID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07785&json=true","fetch_graph":"https://pith.science/api/pith-number/UWMXNNIDYTAELJBWI4DUWK2WQD/graph.json","fetch_events":"https://pith.science/api/pith-number/UWMXNNIDYTAELJBWI4DUWK2WQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWMXNNIDYTAELJBWI4DUWK2WQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWMXNNIDYTAELJBWI4DUWK2WQD/action/storage_attestation","attest_author":"https://pith.science/pith/UWMXNNIDYTAELJBWI4DUWK2WQD/action/author_attestation","sign_citation":"https://pith.science/pith/UWMXNNIDYTAELJBWI4DUWK2WQD/action/citation_signature","submit_replication":"https://pith.science/pith/UWMXNNIDYTAELJBWI4DUWK2WQD/action/replication_record"}},"created_at":"2026-05-18T00:03:19.454111+00:00","updated_at":"2026-05-18T00:03:19.454111+00:00"}