{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H7SWHZIHVOPWHVHQT3LLW2KRFX","short_pith_number":"pith:H7SWHZIH","schema_version":"1.0","canonical_sha256":"3fe563e507ab9f63d4f09ed6bb69512dda164859e26e41ab6c54a2f8dc4bc9ae","source":{"kind":"arxiv","id":"1207.5216","version":4},"attestation_state":"computed","paper":{"title":"A colouring protocol for the generalized Russian cards problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andr\\'es Cord\\'on-Franco, David Fern\\'andez-Duque, Fernando Soler-Toscano, Hans van Ditmarsch","submitted_at":"2012-07-22T11:06:17Z","abstract_excerpt":"In the generalized Russian cards problem, Alice, Bob and Cath draw $a$, $b$ and $c$ cards, respectively, from a deck of size $a+b+c$. Alice and Bob must then communicate their entire hand to each other, without Cath learning the owner of a single card she does not hold. Unlike many traditional problems in cryptography, however, they are not allowed to encode or hide the messages they exchange from Cath. The problem is then to find methods through which they can achieve this. We propose a general four-step solution based on finite vector spaces, and call it the \"colouring protocol\", as it invol"},"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":"1207.5216","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-22T11:06:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2fa59e3d7c82373545e13af97ff364410119ad9bd1e17d664061404815bc8323","abstract_canon_sha256":"ce238cacf655c5adf0a4e66cfe3b47910409e2fb879edda279db57f2cba89cc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:36.612524Z","signature_b64":"X3dUxv7WuXfaYA9v9Eub6PGDwCdfldd84wPTRekqzuSyPkIys/79PzaOJl87W/WrOB6dDD6r7yRjJA5nOc/GAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fe563e507ab9f63d4f09ed6bb69512dda164859e26e41ab6c54a2f8dc4bc9ae","last_reissued_at":"2026-05-18T02:55:36.611828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:36.611828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A colouring protocol for the generalized Russian cards problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andr\\'es Cord\\'on-Franco, David Fern\\'andez-Duque, Fernando Soler-Toscano, Hans van Ditmarsch","submitted_at":"2012-07-22T11:06:17Z","abstract_excerpt":"In the generalized Russian cards problem, Alice, Bob and Cath draw $a$, $b$ and $c$ cards, respectively, from a deck of size $a+b+c$. Alice and Bob must then communicate their entire hand to each other, without Cath learning the owner of a single card she does not hold. Unlike many traditional problems in cryptography, however, they are not allowed to encode or hide the messages they exchange from Cath. The problem is then to find methods through which they can achieve this. We propose a general four-step solution based on finite vector spaces, and call it the \"colouring protocol\", as it invol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5216","kind":"arxiv","version":4},"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":"1207.5216","created_at":"2026-05-18T02:55:36.611935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5216v4","created_at":"2026-05-18T02:55:36.611935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5216","created_at":"2026-05-18T02:55:36.611935+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7SWHZIHVOPW","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7SWHZIHVOPWHVHQ","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7SWHZIH","created_at":"2026-05-18T12:27:06.952714+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/H7SWHZIHVOPWHVHQT3LLW2KRFX","json":"https://pith.science/pith/H7SWHZIHVOPWHVHQT3LLW2KRFX.json","graph_json":"https://pith.science/api/pith-number/H7SWHZIHVOPWHVHQT3LLW2KRFX/graph.json","events_json":"https://pith.science/api/pith-number/H7SWHZIHVOPWHVHQT3LLW2KRFX/events.json","paper":"https://pith.science/paper/H7SWHZIH"},"agent_actions":{"view_html":"https://pith.science/pith/H7SWHZIHVOPWHVHQT3LLW2KRFX","download_json":"https://pith.science/pith/H7SWHZIHVOPWHVHQT3LLW2KRFX.json","view_paper":"https://pith.science/paper/H7SWHZIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5216&json=true","fetch_graph":"https://pith.science/api/pith-number/H7SWHZIHVOPWHVHQT3LLW2KRFX/graph.json","fetch_events":"https://pith.science/api/pith-number/H7SWHZIHVOPWHVHQT3LLW2KRFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7SWHZIHVOPWHVHQT3LLW2KRFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7SWHZIHVOPWHVHQT3LLW2KRFX/action/storage_attestation","attest_author":"https://pith.science/pith/H7SWHZIHVOPWHVHQT3LLW2KRFX/action/author_attestation","sign_citation":"https://pith.science/pith/H7SWHZIHVOPWHVHQT3LLW2KRFX/action/citation_signature","submit_replication":"https://pith.science/pith/H7SWHZIHVOPWHVHQT3LLW2KRFX/action/replication_record"}},"created_at":"2026-05-18T02:55:36.611935+00:00","updated_at":"2026-05-18T02:55:36.611935+00:00"}