{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FWRWJMM44VBUJVSL3C243EDQYM","short_pith_number":"pith:FWRWJMM4","schema_version":"1.0","canonical_sha256":"2da364b19ce54344d64bd8b5cd9070c338621e5b4d5f3ec1879ae25e49f6da43","source":{"kind":"arxiv","id":"1707.04156","version":2},"attestation_state":"computed","paper":{"title":"MAC Resolvability: First And Second Order Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Igor Bjelakovic, Matthias Frey, Slawomir Stanczak","submitted_at":"2017-07-13T14:53:22Z","abstract_excerpt":"Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel from the perspective of resolvability. We then refine the approach in order to obtain some novel results on the second-order achievable rates."},"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":"1707.04156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T14:53:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f184f3e890fc53747363b2d52f6eaaae950f3f22ad4f9288d36b6302c27d75b8","abstract_canon_sha256":"bb22cbe7f2af3f4e9c48fbfe107d225138184b4b5e6762834ee0336dcd07fd94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:12.732496Z","signature_b64":"VffK43g6dZrg1Yr/fQJbKaR2/uFCk2INzZrhW7c5FEx50yb5cnwP+VDsa+fLJAgr9ZqrYCPxle7cPYUaQsCcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2da364b19ce54344d64bd8b5cd9070c338621e5b4d5f3ec1879ae25e49f6da43","last_reissued_at":"2026-05-18T00:26:12.732054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:12.732054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MAC Resolvability: First And Second Order Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Igor Bjelakovic, Matthias Frey, Slawomir Stanczak","submitted_at":"2017-07-13T14:53:22Z","abstract_excerpt":"Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel from the perspective of resolvability. We then refine the approach in order to obtain some novel results on the second-order achievable rates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04156","kind":"arxiv","version":2},"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":"1707.04156","created_at":"2026-05-18T00:26:12.732123+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04156v2","created_at":"2026-05-18T00:26:12.732123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04156","created_at":"2026-05-18T00:26:12.732123+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWRWJMM44VBU","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWRWJMM44VBUJVSL","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWRWJMM4","created_at":"2026-05-18T12:31:15.632608+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/FWRWJMM44VBUJVSL3C243EDQYM","json":"https://pith.science/pith/FWRWJMM44VBUJVSL3C243EDQYM.json","graph_json":"https://pith.science/api/pith-number/FWRWJMM44VBUJVSL3C243EDQYM/graph.json","events_json":"https://pith.science/api/pith-number/FWRWJMM44VBUJVSL3C243EDQYM/events.json","paper":"https://pith.science/paper/FWRWJMM4"},"agent_actions":{"view_html":"https://pith.science/pith/FWRWJMM44VBUJVSL3C243EDQYM","download_json":"https://pith.science/pith/FWRWJMM44VBUJVSL3C243EDQYM.json","view_paper":"https://pith.science/paper/FWRWJMM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04156&json=true","fetch_graph":"https://pith.science/api/pith-number/FWRWJMM44VBUJVSL3C243EDQYM/graph.json","fetch_events":"https://pith.science/api/pith-number/FWRWJMM44VBUJVSL3C243EDQYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWRWJMM44VBUJVSL3C243EDQYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWRWJMM44VBUJVSL3C243EDQYM/action/storage_attestation","attest_author":"https://pith.science/pith/FWRWJMM44VBUJVSL3C243EDQYM/action/author_attestation","sign_citation":"https://pith.science/pith/FWRWJMM44VBUJVSL3C243EDQYM/action/citation_signature","submit_replication":"https://pith.science/pith/FWRWJMM44VBUJVSL3C243EDQYM/action/replication_record"}},"created_at":"2026-05-18T00:26:12.732123+00:00","updated_at":"2026-05-18T00:26:12.732123+00:00"}