{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MYQV6ATFQ5FI6F6UMYQOERAZE7","short_pith_number":"pith:MYQV6ATF","canonical_record":{"source":{"id":"1010.0041","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-10-01T00:45:03Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"4ceeec8005003526c02b4e1cb24f04f1707e35adb35c37493dbf6fdeb001227e","abstract_canon_sha256":"34e4c4fed0fd0cfc23945c30b4af54b356fd6c9f374cfc54e35b0eb9720a7c0c"},"schema_version":"1.0"},"canonical_sha256":"66215f0265874a8f17d46620e2441927c9ceacec97868d196bdd3018b3ef8fda","source":{"kind":"arxiv","id":"1010.0041","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0041","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0041v4","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0041","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"MYQV6ATFQ5FI","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MYQV6ATFQ5FI6F6U","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MYQV6ATF","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MYQV6ATFQ5FI6F6UMYQOERAZE7","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0041","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-10-01T00:45:03Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"4ceeec8005003526c02b4e1cb24f04f1707e35adb35c37493dbf6fdeb001227e","abstract_canon_sha256":"34e4c4fed0fd0cfc23945c30b4af54b356fd6c9f374cfc54e35b0eb9720a7c0c"},"schema_version":"1.0"},"canonical_sha256":"66215f0265874a8f17d46620e2441927c9ceacec97868d196bdd3018b3ef8fda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:49.454575Z","signature_b64":"/RHYUL2T5DSc1A6L5O/1sSUfSobOBjd4pArYjJSwuZIns8AV03Bb3duYakIsUaoORpPkyQa378Ymy1eLYpsFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66215f0265874a8f17d46620e2441927c9ceacec97868d196bdd3018b3ef8fda","last_reissued_at":"2026-05-18T03:46:49.453870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:49.453870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0041","source_version":4,"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-18T03:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"103N+8zudb9tYbBz6vw8GELyMTcWLd4M1ABJao2xC8Z1ipc2SE5llSKkS2k0HplKL2R5SjQbqR61OJStyAA5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:44:53.568268Z"},"content_sha256":"96578b7052a14d1523d8c8dde932a125e4bd23f862b6d5ee47729216f512c7d6","schema_version":"1.0","event_id":"sha256:96578b7052a14d1523d8c8dde932a125e4bd23f862b6d5ee47729216f512c7d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MYQV6ATFQ5FI6F6UMYQOERAZE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput and Collision Analysis of Multi-Channel Multi-Stage Spectrum Sensing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.PF","authors_text":"Danijela \\v{C}abri\\'c, Przemys{\\l}aw Pawe{\\l}czak, Wesam Gabran","submitted_at":"2010-10-01T00:45:03Z","abstract_excerpt":"Multi-stage sensing is a novel concept that refers to a general class of spectrum sensing algorithms that divide the sensing process into a number of sequential stages. The number of sensing stages and the sensing technique per stage can be used to optimize performance with respect to secondary user throughput and the collision probability between primary and secondary users. So far, the impact of multi-stage sensing on network throughput and collision probability for a realistic network model is relatively unexplored. Therefore, we present the first analytical framework which enables performa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0041","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"},"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-18T03:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IfrDEyGrVOY01EFsk1C6vNWhSquYocPS80A7lIih6VTqZrhpIkMV87zpAuSoKEfeC9EmpJFl9GyODso/v/0uBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:44:53.569022Z"},"content_sha256":"ab6267079e424d02cec0afd570774d241b47d7dce4de19b8c3a6143fb3eb5aec","schema_version":"1.0","event_id":"sha256:ab6267079e424d02cec0afd570774d241b47d7dce4de19b8c3a6143fb3eb5aec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYQV6ATFQ5FI6F6UMYQOERAZE7/bundle.json","state_url":"https://pith.science/pith/MYQV6ATFQ5FI6F6UMYQOERAZE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYQV6ATFQ5FI6F6UMYQOERAZE7/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-06T21:44:53Z","links":{"resolver":"https://pith.science/pith/MYQV6ATFQ5FI6F6UMYQOERAZE7","bundle":"https://pith.science/pith/MYQV6ATFQ5FI6F6UMYQOERAZE7/bundle.json","state":"https://pith.science/pith/MYQV6ATFQ5FI6F6UMYQOERAZE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYQV6ATFQ5FI6F6UMYQOERAZE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MYQV6ATFQ5FI6F6UMYQOERAZE7","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":"34e4c4fed0fd0cfc23945c30b4af54b356fd6c9f374cfc54e35b0eb9720a7c0c","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-10-01T00:45:03Z","title_canon_sha256":"4ceeec8005003526c02b4e1cb24f04f1707e35adb35c37493dbf6fdeb001227e"},"schema_version":"1.0","source":{"id":"1010.0041","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0041","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0041v4","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0041","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"MYQV6ATFQ5FI","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MYQV6ATFQ5FI6F6U","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MYQV6ATF","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:ab6267079e424d02cec0afd570774d241b47d7dce4de19b8c3a6143fb3eb5aec","target":"graph","created_at":"2026-05-18T03:46:49Z","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":"Multi-stage sensing is a novel concept that refers to a general class of spectrum sensing algorithms that divide the sensing process into a number of sequential stages. The number of sensing stages and the sensing technique per stage can be used to optimize performance with respect to secondary user throughput and the collision probability between primary and secondary users. So far, the impact of multi-stage sensing on network throughput and collision probability for a realistic network model is relatively unexplored. Therefore, we present the first analytical framework which enables performa","authors_text":"Danijela \\v{C}abri\\'c, Przemys{\\l}aw Pawe{\\l}czak, Wesam Gabran","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-10-01T00:45:03Z","title":"Throughput and Collision Analysis of Multi-Channel Multi-Stage Spectrum Sensing Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0041","kind":"arxiv","version":4},"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:96578b7052a14d1523d8c8dde932a125e4bd23f862b6d5ee47729216f512c7d6","target":"record","created_at":"2026-05-18T03:46:49Z","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":"34e4c4fed0fd0cfc23945c30b4af54b356fd6c9f374cfc54e35b0eb9720a7c0c","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-10-01T00:45:03Z","title_canon_sha256":"4ceeec8005003526c02b4e1cb24f04f1707e35adb35c37493dbf6fdeb001227e"},"schema_version":"1.0","source":{"id":"1010.0041","kind":"arxiv","version":4}},"canonical_sha256":"66215f0265874a8f17d46620e2441927c9ceacec97868d196bdd3018b3ef8fda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66215f0265874a8f17d46620e2441927c9ceacec97868d196bdd3018b3ef8fda","first_computed_at":"2026-05-18T03:46:49.453870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:49.453870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/RHYUL2T5DSc1A6L5O/1sSUfSobOBjd4pArYjJSwuZIns8AV03Bb3duYakIsUaoORpPkyQa378Ymy1eLYpsFAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:49.454575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0041","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96578b7052a14d1523d8c8dde932a125e4bd23f862b6d5ee47729216f512c7d6","sha256:ab6267079e424d02cec0afd570774d241b47d7dce4de19b8c3a6143fb3eb5aec"],"state_sha256":"090e3faa2ccfee7b512de5987a2649141163f54340a0026ae772a058b55ad84b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0Z5UpThwekF1X0jRNs18komEYD8/bvKN5AuDhRPVdbOu9TIyJTZp+4zKIDLVRVJu7+9zD7Aegkd5HCS0ZT3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:44:53.572760Z","bundle_sha256":"5d3834aafe3706cd10081f396abe31aeb1159f427c6d010e492f0af5905ff9cd"}}