{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5ZLMZMM4KGDCH7MDMQ2OGQJM2P","short_pith_number":"pith:5ZLMZMM4","canonical_record":{"source":{"id":"1404.5859","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T15:21:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcd8619ab741a5339c23a289649a0fec4bde109c458c8e56a07f54aec3b08b2c","abstract_canon_sha256":"6835ace37144362609304b6bd6e37c749d2c35a7e6378c3985a12f15dba4971b"},"schema_version":"1.0"},"canonical_sha256":"ee56ccb19c518623fd836434e3412cd3cdea0a1bc8a9ceefd1c6d5122c69fdbe","source":{"kind":"arxiv","id":"1404.5859","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5859","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5859v3","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5859","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"5ZLMZMM4KGDC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5ZLMZMM4KGDCH7MD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5ZLMZMM4","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5ZLMZMM4KGDCH7MDMQ2OGQJM2P","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5859","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T15:21:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcd8619ab741a5339c23a289649a0fec4bde109c458c8e56a07f54aec3b08b2c","abstract_canon_sha256":"6835ace37144362609304b6bd6e37c749d2c35a7e6378c3985a12f15dba4971b"},"schema_version":"1.0"},"canonical_sha256":"ee56ccb19c518623fd836434e3412cd3cdea0a1bc8a9ceefd1c6d5122c69fdbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:11.790607Z","signature_b64":"czK0ZTsrz1ouciHwRnvThLaI9pVzz3PKymDG+6clfgmDEwaI+NzuRD/QXqQSK9jPLkmBYBSDhyn9xieYXph+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee56ccb19c518623fd836434e3412cd3cdea0a1bc8a9ceefd1c6d5122c69fdbe","last_reissued_at":"2026-05-18T00:58:11.789928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:11.789928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5859","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvQU3jXbnsaOH6UihbVP3zH12ko8bMgSfe6mmuG6f5VzRLC9oTBMG+/o/o6bQUL300Y5h4YC+jbDWut6QVj3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:11:49.310139Z"},"content_sha256":"67335c8bddc91f08d8a8a53d0c3106609a16858184314bc70f86cee958187015","schema_version":"1.0","event_id":"sha256:67335c8bddc91f08d8a8a53d0c3106609a16858184314bc70f86cee958187015"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5ZLMZMM4KGDCH7MDMQ2OGQJM2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Channel Assignment in Cognitive Radio Networks: Stable Matching and Walrasian Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bernd Holfeld, Rami Mochaourab, Thomas Wirth","submitted_at":"2014-04-23T15:21:18Z","abstract_excerpt":"We consider a set of secondary transmitter-receiver pairs in a cognitive radio setting. Based on channel sensing and access performances, we consider the problem of assigning channels orthogonally to secondary users through distributed coordination and cooperation algorithms. Two economic models are applied for this purpose: matching markets and competitive markets. In the matching market model, secondary users and channels build two agent sets. We implement a stable matching algorithm in which each secondary user, based on his achievable rate, proposes to the coordinator to be matched with de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5859","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/Q08XJMd524Q6KLzYAJhAtl1u8k2tTiMh3mgYsxnmnpaXHtD6XotU4CrDvMcWIekUJF/53miWzRk4pAyFgtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:11:49.310507Z"},"content_sha256":"15d9cf3a52571fe93ceda50e3b9709f28a4ef7a2c71f014f1d1f43180e55dcaf","schema_version":"1.0","event_id":"sha256:15d9cf3a52571fe93ceda50e3b9709f28a4ef7a2c71f014f1d1f43180e55dcaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZLMZMM4KGDCH7MDMQ2OGQJM2P/bundle.json","state_url":"https://pith.science/pith/5ZLMZMM4KGDCH7MDMQ2OGQJM2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZLMZMM4KGDCH7MDMQ2OGQJM2P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T02:11:49Z","links":{"resolver":"https://pith.science/pith/5ZLMZMM4KGDCH7MDMQ2OGQJM2P","bundle":"https://pith.science/pith/5ZLMZMM4KGDCH7MDMQ2OGQJM2P/bundle.json","state":"https://pith.science/pith/5ZLMZMM4KGDCH7MDMQ2OGQJM2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZLMZMM4KGDCH7MDMQ2OGQJM2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5ZLMZMM4KGDCH7MDMQ2OGQJM2P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6835ace37144362609304b6bd6e37c749d2c35a7e6378c3985a12f15dba4971b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T15:21:18Z","title_canon_sha256":"dcd8619ab741a5339c23a289649a0fec4bde109c458c8e56a07f54aec3b08b2c"},"schema_version":"1.0","source":{"id":"1404.5859","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5859","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5859v3","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5859","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"5ZLMZMM4KGDC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5ZLMZMM4KGDCH7MD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5ZLMZMM4","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:15d9cf3a52571fe93ceda50e3b9709f28a4ef7a2c71f014f1d1f43180e55dcaf","target":"graph","created_at":"2026-05-18T00:58:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a set of secondary transmitter-receiver pairs in a cognitive radio setting. Based on channel sensing and access performances, we consider the problem of assigning channels orthogonally to secondary users through distributed coordination and cooperation algorithms. Two economic models are applied for this purpose: matching markets and competitive markets. In the matching market model, secondary users and channels build two agent sets. We implement a stable matching algorithm in which each secondary user, based on his achievable rate, proposes to the coordinator to be matched with de","authors_text":"Bernd Holfeld, Rami Mochaourab, Thomas Wirth","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T15:21:18Z","title":"Distributed Channel Assignment in Cognitive Radio Networks: Stable Matching and Walrasian Equilibrium"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5859","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:67335c8bddc91f08d8a8a53d0c3106609a16858184314bc70f86cee958187015","target":"record","created_at":"2026-05-18T00:58:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6835ace37144362609304b6bd6e37c749d2c35a7e6378c3985a12f15dba4971b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T15:21:18Z","title_canon_sha256":"dcd8619ab741a5339c23a289649a0fec4bde109c458c8e56a07f54aec3b08b2c"},"schema_version":"1.0","source":{"id":"1404.5859","kind":"arxiv","version":3}},"canonical_sha256":"ee56ccb19c518623fd836434e3412cd3cdea0a1bc8a9ceefd1c6d5122c69fdbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee56ccb19c518623fd836434e3412cd3cdea0a1bc8a9ceefd1c6d5122c69fdbe","first_computed_at":"2026-05-18T00:58:11.789928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:11.789928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"czK0ZTsrz1ouciHwRnvThLaI9pVzz3PKymDG+6clfgmDEwaI+NzuRD/QXqQSK9jPLkmBYBSDhyn9xieYXph+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:11.790607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5859","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67335c8bddc91f08d8a8a53d0c3106609a16858184314bc70f86cee958187015","sha256:15d9cf3a52571fe93ceda50e3b9709f28a4ef7a2c71f014f1d1f43180e55dcaf"],"state_sha256":"cc8f16de0a7cb9e7cafed1b102e22bca2e9f12bfe23c7ace9730336a8dd93f0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWi+VJdStfVlmyQiAlcONcx1n2lNjwQoFprYJuapiCbPAMk705Nd5lOOSEecwsH8+jbN7/cFNefVWJSTZP59Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:11:49.312528Z","bundle_sha256":"5364587e3d5ed7d786045454692ed6fb84b53928db60ad3d65e1dd24165247ae"}}