{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3FHQRJPE6M4PXCMDJFTWJKWSJ6","short_pith_number":"pith:3FHQRJPE","canonical_record":{"source":{"id":"1408.5098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:30:12Z","cross_cats_sorted":[],"title_canon_sha256":"ff29eb03975488ddfb94c54ba1cf49742f01a35f4a9bfaca48a6cad0ae30b896","abstract_canon_sha256":"b3947f33e1efa2a178251213e67973a1db080add88a738b9c071df122e30f4d1"},"schema_version":"1.0"},"canonical_sha256":"d94f08a5e4f338fb8983496764aad24f844a7d888b2ea9e5e266a2f9bdc1216e","source":{"kind":"arxiv","id":"1408.5098","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5098","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5098v1","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5098","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"3FHQRJPE6M4P","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3FHQRJPE6M4PXCMD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3FHQRJPE","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3FHQRJPE6M4PXCMDJFTWJKWSJ6","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:30:12Z","cross_cats_sorted":[],"title_canon_sha256":"ff29eb03975488ddfb94c54ba1cf49742f01a35f4a9bfaca48a6cad0ae30b896","abstract_canon_sha256":"b3947f33e1efa2a178251213e67973a1db080add88a738b9c071df122e30f4d1"},"schema_version":"1.0"},"canonical_sha256":"d94f08a5e4f338fb8983496764aad24f844a7d888b2ea9e5e266a2f9bdc1216e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:40.741179Z","signature_b64":"1BnDmOt4NU3xw8mHUqRHExkoN4wOsH6hhD1ukK/8vhdrAzSuL16lN6/HZasMj0l7gLdfr0+xsINSmYFC+d2SAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d94f08a5e4f338fb8983496764aad24f844a7d888b2ea9e5e266a2f9bdc1216e","last_reissued_at":"2026-05-18T02:44:40.740565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:40.740565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5098","source_version":1,"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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53TZgCAyadfNoCTiEOvn1g2S1V60uXsAvYoN+LWUIjfejgUEQJN3kfmmDFnXrSACGNnLSraCMJvuVGTWLalCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:58:33.386342Z"},"content_sha256":"8aa34e6719aca11d08e75894642f3c1342823924ce1f70135898e79e684da85d","schema_version":"1.0","event_id":"sha256:8aa34e6719aca11d08e75894642f3c1342823924ce1f70135898e79e684da85d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3FHQRJPE6M4PXCMDJFTWJKWSJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Decision Algorithm for Access Selection in Multi-operator Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bernard Cousin (IRISA), Samer Lahoud (IRISA), Samhat Abed Ellatif (UL), Soha Farhat (IRISA, UL)","submitted_at":"2014-08-21T18:30:12Z","abstract_excerpt":"In this paper, we propose a hybrid decision algorithm for the selection of the access in multi-operator networks environment, where competing operators share their radio access networks to meet traffic and data rate demands. The proposed algorithm guarantees the user satisfaction and a global gain for all cooperating operators. Simulation results prove the efficiency of the proposed scheme and show that the cooperation between operators achieves benefits to both users and operators; user acceptance as well as the operator resource utilization and the operator revenue increase."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5098","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"},"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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQA2XvPdDaRBLFU/Jf2W3t/L5VHMU0MuqiK/6gtyhOTF5NsiEMhmkTrnF8qsiuk12BzkAs6dmgU6BoRMBkh0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:58:33.386692Z"},"content_sha256":"a7602134466bfda9b91fdbc9d5b94ef8ee4f12454585c8329e2b1562e0fdd479","schema_version":"1.0","event_id":"sha256:a7602134466bfda9b91fdbc9d5b94ef8ee4f12454585c8329e2b1562e0fdd479"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FHQRJPE6M4PXCMDJFTWJKWSJ6/bundle.json","state_url":"https://pith.science/pith/3FHQRJPE6M4PXCMDJFTWJKWSJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FHQRJPE6M4PXCMDJFTWJKWSJ6/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-07-02T23:58:33Z","links":{"resolver":"https://pith.science/pith/3FHQRJPE6M4PXCMDJFTWJKWSJ6","bundle":"https://pith.science/pith/3FHQRJPE6M4PXCMDJFTWJKWSJ6/bundle.json","state":"https://pith.science/pith/3FHQRJPE6M4PXCMDJFTWJKWSJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FHQRJPE6M4PXCMDJFTWJKWSJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3FHQRJPE6M4PXCMDJFTWJKWSJ6","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":"b3947f33e1efa2a178251213e67973a1db080add88a738b9c071df122e30f4d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:30:12Z","title_canon_sha256":"ff29eb03975488ddfb94c54ba1cf49742f01a35f4a9bfaca48a6cad0ae30b896"},"schema_version":"1.0","source":{"id":"1408.5098","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5098","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5098v1","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5098","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"3FHQRJPE6M4P","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3FHQRJPE6M4PXCMD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3FHQRJPE","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:a7602134466bfda9b91fdbc9d5b94ef8ee4f12454585c8329e2b1562e0fdd479","target":"graph","created_at":"2026-05-18T02:44:40Z","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 hybrid decision algorithm for the selection of the access in multi-operator networks environment, where competing operators share their radio access networks to meet traffic and data rate demands. The proposed algorithm guarantees the user satisfaction and a global gain for all cooperating operators. Simulation results prove the efficiency of the proposed scheme and show that the cooperation between operators achieves benefits to both users and operators; user acceptance as well as the operator resource utilization and the operator revenue increase.","authors_text":"Bernard Cousin (IRISA), Samer Lahoud (IRISA), Samhat Abed Ellatif (UL), Soha Farhat (IRISA, UL)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:30:12Z","title":"Hybrid Decision Algorithm for Access Selection in Multi-operator Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5098","kind":"arxiv","version":1},"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:8aa34e6719aca11d08e75894642f3c1342823924ce1f70135898e79e684da85d","target":"record","created_at":"2026-05-18T02:44:40Z","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":"b3947f33e1efa2a178251213e67973a1db080add88a738b9c071df122e30f4d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:30:12Z","title_canon_sha256":"ff29eb03975488ddfb94c54ba1cf49742f01a35f4a9bfaca48a6cad0ae30b896"},"schema_version":"1.0","source":{"id":"1408.5098","kind":"arxiv","version":1}},"canonical_sha256":"d94f08a5e4f338fb8983496764aad24f844a7d888b2ea9e5e266a2f9bdc1216e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d94f08a5e4f338fb8983496764aad24f844a7d888b2ea9e5e266a2f9bdc1216e","first_computed_at":"2026-05-18T02:44:40.740565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:40.740565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1BnDmOt4NU3xw8mHUqRHExkoN4wOsH6hhD1ukK/8vhdrAzSuL16lN6/HZasMj0l7gLdfr0+xsINSmYFC+d2SAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:40.741179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5098","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aa34e6719aca11d08e75894642f3c1342823924ce1f70135898e79e684da85d","sha256:a7602134466bfda9b91fdbc9d5b94ef8ee4f12454585c8329e2b1562e0fdd479"],"state_sha256":"a719b4a4b22293c700563a157a862cb31c374eeecbc6ce7b90683678dfe508fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQ8jl6pg1af3m7DBuwCIE5tIa+UjlR11UenAmf1fSWP0os8p2Qmj1xRgxUefcAh84Gb2xHdotjFif4IJIlkPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:58:33.388640Z","bundle_sha256":"39ea3c3fa6df05edcb86b0bb3e01e0d5521c66f3e2c078d2a2646b2ea3a132bb"}}