{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GO5GT73BHAQ4MIRFDZLL25MSC6","short_pith_number":"pith:GO5GT73B","canonical_record":{"source":{"id":"1403.6807","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-26T19:33:48Z","cross_cats_sorted":["cs.GT","cs.IT","cs.SY","math.IT"],"title_canon_sha256":"59a19f768aac379fe368a31852f253337efa2203c81188290ceb74a50dfebf0d","abstract_canon_sha256":"0205a0a1c87ebe038126bd17a36eea04d908aeb3834d0bac1e82348ba14d6510"},"schema_version":"1.0"},"canonical_sha256":"33ba69ff613821c622251e56bd759217a74d14aabee5b3b58b470b520a6c0848","source":{"kind":"arxiv","id":"1403.6807","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6807","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6807v3","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6807","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"GO5GT73BHAQ4","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GO5GT73BHAQ4MIRF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GO5GT73B","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GO5GT73BHAQ4MIRFDZLL25MSC6","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6807","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-26T19:33:48Z","cross_cats_sorted":["cs.GT","cs.IT","cs.SY","math.IT"],"title_canon_sha256":"59a19f768aac379fe368a31852f253337efa2203c81188290ceb74a50dfebf0d","abstract_canon_sha256":"0205a0a1c87ebe038126bd17a36eea04d908aeb3834d0bac1e82348ba14d6510"},"schema_version":"1.0"},"canonical_sha256":"33ba69ff613821c622251e56bd759217a74d14aabee5b3b58b470b520a6c0848","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:05.723470Z","signature_b64":"aEXkkODNRrTHk+n1bZa3pYFhB2hM209+e5UgqPqUYXpVSOu83ORGkIWZi64A9pfKmSl9y2+bB9Q9HHiRIlfeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33ba69ff613821c622251e56bd759217a74d14aabee5b3b58b470b520a6c0848","last_reissued_at":"2026-05-18T01:27:05.722797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:05.722797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6807","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-18T01:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYUb93xh89Q7JGmQIoTDWMNTK6JTGojpUAqiH8F8w/Bs1kcw5/xHBm4AYfXAEyWf1crt3CSXkuRW1zeh9dwiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:29:43.508551Z"},"content_sha256":"cf7350fc2fd3c76ce486525c4e42d7f9919eb9ab202f9488df4c4a7c4cdaaba4","schema_version":"1.0","event_id":"sha256:cf7350fc2fd3c76ce486525c4e42d7f9919eb9ab202f9488df4c4a7c4cdaaba4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GO5GT73BHAQ4MIRFDZLL25MSC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Spectrum Auction Design with Two-Dimensional Truthful Revelations under Uncertain Spectrum Availability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","cs.SY","math.IT"],"primary_cat":"cs.NI","authors_text":"Pramod K. Varshney, Swastik Brahma, V. Sriram Siddhardh Nadendla","submitted_at":"2014-03-26T19:33:48Z","abstract_excerpt":"In this paper, we propose a novel sealed-bid auction framework to address the problem of dynamic spectrum allocation in cognitive radio (CR) networks. We design an optimal auction mechanism that maximizes the moderator's expected utility, when the spectrum is not available with certainty. We assume that the moderator employs collaborative spectrum sensing in order to make a reliable inference about spectrum availability. Due to the presence of a collision cost whenever the moderator makes an erroneous inference, and a sensing cost at each CR, we investigate feasibility conditions that guarante"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6807","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-18T01:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASx5SMqDheNz+sl9hlVqXENVJOhVVxDlQ5ZfCPGncHLt53/Nrb+yLyRab2lzXnNuYZDz9+0ExEpWNjbUiAbUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:29:43.508903Z"},"content_sha256":"1311989435cbfa97486514dc8cbfa88033dfc5696385ade376257ad39a90ecb9","schema_version":"1.0","event_id":"sha256:1311989435cbfa97486514dc8cbfa88033dfc5696385ade376257ad39a90ecb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GO5GT73BHAQ4MIRFDZLL25MSC6/bundle.json","state_url":"https://pith.science/pith/GO5GT73BHAQ4MIRFDZLL25MSC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GO5GT73BHAQ4MIRFDZLL25MSC6/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-03T07:29:43Z","links":{"resolver":"https://pith.science/pith/GO5GT73BHAQ4MIRFDZLL25MSC6","bundle":"https://pith.science/pith/GO5GT73BHAQ4MIRFDZLL25MSC6/bundle.json","state":"https://pith.science/pith/GO5GT73BHAQ4MIRFDZLL25MSC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GO5GT73BHAQ4MIRFDZLL25MSC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GO5GT73BHAQ4MIRFDZLL25MSC6","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":"0205a0a1c87ebe038126bd17a36eea04d908aeb3834d0bac1e82348ba14d6510","cross_cats_sorted":["cs.GT","cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-26T19:33:48Z","title_canon_sha256":"59a19f768aac379fe368a31852f253337efa2203c81188290ceb74a50dfebf0d"},"schema_version":"1.0","source":{"id":"1403.6807","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6807","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6807v3","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6807","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"GO5GT73BHAQ4","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GO5GT73BHAQ4MIRF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GO5GT73B","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:1311989435cbfa97486514dc8cbfa88033dfc5696385ade376257ad39a90ecb9","target":"graph","created_at":"2026-05-18T01:27:05Z","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":"In this paper, we propose a novel sealed-bid auction framework to address the problem of dynamic spectrum allocation in cognitive radio (CR) networks. We design an optimal auction mechanism that maximizes the moderator's expected utility, when the spectrum is not available with certainty. We assume that the moderator employs collaborative spectrum sensing in order to make a reliable inference about spectrum availability. Due to the presence of a collision cost whenever the moderator makes an erroneous inference, and a sensing cost at each CR, we investigate feasibility conditions that guarante","authors_text":"Pramod K. Varshney, Swastik Brahma, V. Sriram Siddhardh Nadendla","cross_cats":["cs.GT","cs.IT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-26T19:33:48Z","title":"Optimal Spectrum Auction Design with Two-Dimensional Truthful Revelations under Uncertain Spectrum Availability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6807","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:cf7350fc2fd3c76ce486525c4e42d7f9919eb9ab202f9488df4c4a7c4cdaaba4","target":"record","created_at":"2026-05-18T01:27:05Z","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":"0205a0a1c87ebe038126bd17a36eea04d908aeb3834d0bac1e82348ba14d6510","cross_cats_sorted":["cs.GT","cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-26T19:33:48Z","title_canon_sha256":"59a19f768aac379fe368a31852f253337efa2203c81188290ceb74a50dfebf0d"},"schema_version":"1.0","source":{"id":"1403.6807","kind":"arxiv","version":3}},"canonical_sha256":"33ba69ff613821c622251e56bd759217a74d14aabee5b3b58b470b520a6c0848","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33ba69ff613821c622251e56bd759217a74d14aabee5b3b58b470b520a6c0848","first_computed_at":"2026-05-18T01:27:05.722797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:05.722797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aEXkkODNRrTHk+n1bZa3pYFhB2hM209+e5UgqPqUYXpVSOu83ORGkIWZi64A9pfKmSl9y2+bB9Q9HHiRIlfeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:05.723470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6807","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf7350fc2fd3c76ce486525c4e42d7f9919eb9ab202f9488df4c4a7c4cdaaba4","sha256:1311989435cbfa97486514dc8cbfa88033dfc5696385ade376257ad39a90ecb9"],"state_sha256":"a7a5a0ed5a192da04ce73189534f5880860038ec407ea3b68c5c7811aef74d92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnQKdDEadFMB7Wd9s1qNijxHnOfjx89yrIkgIWdy5gzrFo36akkAkNmw2G9w7LpGIjBWsl6FuJsljIZYrilTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:29:43.510941Z","bundle_sha256":"24db45cc0c76f59c5348555f8898029228a74f6c120be154f33ce4f6c1a6a341"}}