{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:F6T3T5RG3NG6O2EZF3ZT3TOAUB","short_pith_number":"pith:F6T3T5RG","schema_version":"1.0","canonical_sha256":"2fa7b9f626db4de768992ef33dcdc0a06db2af5fe8801a3735c64111e965cc60","source":{"kind":"arxiv","id":"1101.4036","version":3},"attestation_state":"computed","paper":{"title":"Secure Multiplex Coding with a Common Message","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi, Ryutaroh Matsumoto","submitted_at":"2011-01-20T21:58:55Z","abstract_excerpt":"We determine the capacity region of the secure multiplex coding with a common message, and evaluate the mutual information and the equivocation rate of a collection of secret messages to the second receiver (eavesdropper), which were not evaluated by Yamamoto et al."},"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":"1101.4036","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-20T21:58:55Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"4b55490b88b301e32432002a9bcd484652e49985931fa347acb5a760109b73c7","abstract_canon_sha256":"7b18a6a03c1f75c54185e291fe57b858d9e7b71ae8b681674813951c5ac70590"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:25.312837Z","signature_b64":"Xa8kVjFN3MOHeZq86UaUb1RWvJbwHDoIH++0CTzG4/mcTHyZz717qqMQTUAsKvULJwgFtiw6EhECzz273C6UAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fa7b9f626db4de768992ef33dcdc0a06db2af5fe8801a3735c64111e965cc60","last_reissued_at":"2026-05-18T04:09:25.312283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:25.312283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Multiplex Coding with a Common Message","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi, Ryutaroh Matsumoto","submitted_at":"2011-01-20T21:58:55Z","abstract_excerpt":"We determine the capacity region of the secure multiplex coding with a common message, and evaluate the mutual information and the equivocation rate of a collection of secret messages to the second receiver (eavesdropper), which were not evaluated by Yamamoto et al."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4036","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":""},"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":"1101.4036","created_at":"2026-05-18T04:09:25.312380+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4036v3","created_at":"2026-05-18T04:09:25.312380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4036","created_at":"2026-05-18T04:09:25.312380+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6T3T5RG3NG6","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6T3T5RG3NG6O2EZ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6T3T5RG","created_at":"2026-05-18T12:26:28.662955+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/F6T3T5RG3NG6O2EZF3ZT3TOAUB","json":"https://pith.science/pith/F6T3T5RG3NG6O2EZF3ZT3TOAUB.json","graph_json":"https://pith.science/api/pith-number/F6T3T5RG3NG6O2EZF3ZT3TOAUB/graph.json","events_json":"https://pith.science/api/pith-number/F6T3T5RG3NG6O2EZF3ZT3TOAUB/events.json","paper":"https://pith.science/paper/F6T3T5RG"},"agent_actions":{"view_html":"https://pith.science/pith/F6T3T5RG3NG6O2EZF3ZT3TOAUB","download_json":"https://pith.science/pith/F6T3T5RG3NG6O2EZF3ZT3TOAUB.json","view_paper":"https://pith.science/paper/F6T3T5RG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4036&json=true","fetch_graph":"https://pith.science/api/pith-number/F6T3T5RG3NG6O2EZF3ZT3TOAUB/graph.json","fetch_events":"https://pith.science/api/pith-number/F6T3T5RG3NG6O2EZF3ZT3TOAUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6T3T5RG3NG6O2EZF3ZT3TOAUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6T3T5RG3NG6O2EZF3ZT3TOAUB/action/storage_attestation","attest_author":"https://pith.science/pith/F6T3T5RG3NG6O2EZF3ZT3TOAUB/action/author_attestation","sign_citation":"https://pith.science/pith/F6T3T5RG3NG6O2EZF3ZT3TOAUB/action/citation_signature","submit_replication":"https://pith.science/pith/F6T3T5RG3NG6O2EZF3ZT3TOAUB/action/replication_record"}},"created_at":"2026-05-18T04:09:25.312380+00:00","updated_at":"2026-05-18T04:09:25.312380+00:00"}