{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SBORRULGBB4SIJWDVNCLCQKXYC","short_pith_number":"pith:SBORRULG","schema_version":"1.0","canonical_sha256":"905d18d16608792426c3ab44b14157c0b130e96d5e2e6627043eaa4dd5ca7b3e","source":{"kind":"arxiv","id":"1007.0118","version":1},"attestation_state":"computed","paper":{"title":"Channel Assortment Strategy for Reliable Communication in Multi-Hop Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Mubashir Husain Rehmani","submitted_at":"2010-07-01T10:17:29Z","abstract_excerpt":"In this paper, we propose a channel assortment strategy for Reliable Communication in Multi-Hop Cognitive Radio Networks."},"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":"1007.0118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-07-01T10:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"801429c5c81100152d930b53a74454cab679b7c4db6fd9fa47dd53356c80485a","abstract_canon_sha256":"131d0bd9c4aca40b0a718cdb973e0465ad006855df9a0bee109936880519c5ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.840924Z","signature_b64":"66lE1SSsiOGcHYVEEbznRc/YUWqufo6Xf0Ce14z8N2e1JZVIaXwkMtzZ6VqKxPc0UQ0QAVqRsLNnRL6GofeCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"905d18d16608792426c3ab44b14157c0b130e96d5e2e6627043eaa4dd5ca7b3e","last_reissued_at":"2026-05-18T00:59:10.840239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.840239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel Assortment Strategy for Reliable Communication in Multi-Hop Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Mubashir Husain Rehmani","submitted_at":"2010-07-01T10:17:29Z","abstract_excerpt":"In this paper, we propose a channel assortment strategy for Reliable Communication in Multi-Hop Cognitive Radio Networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0118","kind":"arxiv","version":1},"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":"1007.0118","created_at":"2026-05-18T00:59:10.840355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.0118v1","created_at":"2026-05-18T00:59:10.840355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0118","created_at":"2026-05-18T00:59:10.840355+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBORRULGBB4S","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBORRULGBB4SIJWD","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBORRULG","created_at":"2026-05-18T12:26:13.927090+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/SBORRULGBB4SIJWDVNCLCQKXYC","json":"https://pith.science/pith/SBORRULGBB4SIJWDVNCLCQKXYC.json","graph_json":"https://pith.science/api/pith-number/SBORRULGBB4SIJWDVNCLCQKXYC/graph.json","events_json":"https://pith.science/api/pith-number/SBORRULGBB4SIJWDVNCLCQKXYC/events.json","paper":"https://pith.science/paper/SBORRULG"},"agent_actions":{"view_html":"https://pith.science/pith/SBORRULGBB4SIJWDVNCLCQKXYC","download_json":"https://pith.science/pith/SBORRULGBB4SIJWDVNCLCQKXYC.json","view_paper":"https://pith.science/paper/SBORRULG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.0118&json=true","fetch_graph":"https://pith.science/api/pith-number/SBORRULGBB4SIJWDVNCLCQKXYC/graph.json","fetch_events":"https://pith.science/api/pith-number/SBORRULGBB4SIJWDVNCLCQKXYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBORRULGBB4SIJWDVNCLCQKXYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBORRULGBB4SIJWDVNCLCQKXYC/action/storage_attestation","attest_author":"https://pith.science/pith/SBORRULGBB4SIJWDVNCLCQKXYC/action/author_attestation","sign_citation":"https://pith.science/pith/SBORRULGBB4SIJWDVNCLCQKXYC/action/citation_signature","submit_replication":"https://pith.science/pith/SBORRULGBB4SIJWDVNCLCQKXYC/action/replication_record"}},"created_at":"2026-05-18T00:59:10.840355+00:00","updated_at":"2026-05-18T00:59:10.840355+00:00"}