{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:RKO4ZIM6VFRUPPRLGLFCLPZ2CT","short_pith_number":"pith:RKO4ZIM6","canonical_record":{"source":{"id":"2107.09404","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-20T10:54:23Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"b70aefc8f2a0b53b76441abb97947115f1e990839633195e0b7245d0764f57d0","abstract_canon_sha256":"ac80b6df9c5ee387c3ca02e698d31c4d0dccb4a765ca9db01c0627b427ad48ef"},"schema_version":"1.0"},"canonical_sha256":"8a9dcca19ea96347be2b32ca25bf3a14fae4ae8ba69f3cd16540f5018c674a49","source":{"kind":"arxiv","id":"2107.09404","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.09404","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"arxiv_version","alias_value":"2107.09404v3","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.09404","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"pith_short_12","alias_value":"RKO4ZIM6VFRU","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"pith_short_16","alias_value":"RKO4ZIM6VFRUPPRL","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"pith_short_8","alias_value":"RKO4ZIM6","created_at":"2026-07-05T03:12:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:RKO4ZIM6VFRUPPRLGLFCLPZ2CT","target":"record","payload":{"canonical_record":{"source":{"id":"2107.09404","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-20T10:54:23Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"b70aefc8f2a0b53b76441abb97947115f1e990839633195e0b7245d0764f57d0","abstract_canon_sha256":"ac80b6df9c5ee387c3ca02e698d31c4d0dccb4a765ca9db01c0627b427ad48ef"},"schema_version":"1.0"},"canonical_sha256":"8a9dcca19ea96347be2b32ca25bf3a14fae4ae8ba69f3cd16540f5018c674a49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:12:49.721153Z","signature_b64":"FdLF92/XzcH1KQ7S5iTRTjUxZfoRZNGvuJW5b7izqjykLQsJVemjWZdX/eBLAwDdZiHHWpf6uy9w3LWBNEz3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a9dcca19ea96347be2b32ca25bf3a14fae4ae8ba69f3cd16540f5018c674a49","last_reissued_at":"2026-07-05T03:12:49.720697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:12:49.720697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.09404","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-07-05T03:12:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5zvJPme8xp+V4tmAvmuClAeR8A0pXj0TQWJeYifdrvPGfLbn/8YlicroxQVklh9rqldQhkb4USae3V6DVlLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T11:36:01.014419Z"},"content_sha256":"aef6a181a439c9da6ab391bbc22052cb3c3ab088466618cf88da250bcf4e75b5","schema_version":"1.0","event_id":"sha256:aef6a181a439c9da6ab391bbc22052cb3c3ab088466618cf88da250bcf4e75b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:RKO4ZIM6VFRUPPRLGLFCLPZ2CT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing the Set Cardinality of Users Scheduled for Ultra-dense uRLLC Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Yuan, Shiwen He, Yongming Huang, Yunshan Yi, Zhenyu An","submitted_at":"2021-07-20T10:54:23Z","abstract_excerpt":"Ultra-reliability and low latency communication has long been an important but challenging task in the fifth and sixth generation wireless communication systems. Scheduling as many users as possible to serve on the limited time-frequency resource is one of a crucial topic, subjecting to the maximum allowable transmission power and the minimum rate requirement of each user. We address it by proposing a mixed integer programming model, with the goal of maximizing the set cardinality of users instead of maximizing the system sum rate or energy efficiency. Mathematical transformations and successi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.09404","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.09404/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:12:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHADVxi875UDEYqu/IR9Jh1ECcN1vHFNwbxMmcQPp/yEPO9ElQDdY0mKI+XMEioJ+R1lLGqBBQOYGA7bqwRLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T11:36:01.014801Z"},"content_sha256":"e12c92c41cdb7ed841ace4481d41c2b9136034810ef36ffa81d82b264d78beaf","schema_version":"1.0","event_id":"sha256:e12c92c41cdb7ed841ace4481d41c2b9136034810ef36ffa81d82b264d78beaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKO4ZIM6VFRUPPRLGLFCLPZ2CT/bundle.json","state_url":"https://pith.science/pith/RKO4ZIM6VFRUPPRLGLFCLPZ2CT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKO4ZIM6VFRUPPRLGLFCLPZ2CT/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-15T11:36:01Z","links":{"resolver":"https://pith.science/pith/RKO4ZIM6VFRUPPRLGLFCLPZ2CT","bundle":"https://pith.science/pith/RKO4ZIM6VFRUPPRLGLFCLPZ2CT/bundle.json","state":"https://pith.science/pith/RKO4ZIM6VFRUPPRLGLFCLPZ2CT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKO4ZIM6VFRUPPRLGLFCLPZ2CT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:RKO4ZIM6VFRUPPRLGLFCLPZ2CT","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":"ac80b6df9c5ee387c3ca02e698d31c4d0dccb4a765ca9db01c0627b427ad48ef","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-20T10:54:23Z","title_canon_sha256":"b70aefc8f2a0b53b76441abb97947115f1e990839633195e0b7245d0764f57d0"},"schema_version":"1.0","source":{"id":"2107.09404","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.09404","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"arxiv_version","alias_value":"2107.09404v3","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.09404","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"pith_short_12","alias_value":"RKO4ZIM6VFRU","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"pith_short_16","alias_value":"RKO4ZIM6VFRUPPRL","created_at":"2026-07-05T03:12:49Z"},{"alias_kind":"pith_short_8","alias_value":"RKO4ZIM6","created_at":"2026-07-05T03:12:49Z"}],"graph_snapshots":[{"event_id":"sha256:e12c92c41cdb7ed841ace4481d41c2b9136034810ef36ffa81d82b264d78beaf","target":"graph","created_at":"2026-07-05T03:12: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.09404/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ultra-reliability and low latency communication has long been an important but challenging task in the fifth and sixth generation wireless communication systems. Scheduling as many users as possible to serve on the limited time-frequency resource is one of a crucial topic, subjecting to the maximum allowable transmission power and the minimum rate requirement of each user. We address it by proposing a mixed integer programming model, with the goal of maximizing the set cardinality of users instead of maximizing the system sum rate or energy efficiency. Mathematical transformations and successi","authors_text":"Jun Yuan, Shiwen He, Yongming Huang, Yunshan Yi, Zhenyu An","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-20T10:54:23Z","title":"Maximizing the Set Cardinality of Users Scheduled for Ultra-dense uRLLC Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.09404","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:aef6a181a439c9da6ab391bbc22052cb3c3ab088466618cf88da250bcf4e75b5","target":"record","created_at":"2026-07-05T03:12: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":"ac80b6df9c5ee387c3ca02e698d31c4d0dccb4a765ca9db01c0627b427ad48ef","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-20T10:54:23Z","title_canon_sha256":"b70aefc8f2a0b53b76441abb97947115f1e990839633195e0b7245d0764f57d0"},"schema_version":"1.0","source":{"id":"2107.09404","kind":"arxiv","version":3}},"canonical_sha256":"8a9dcca19ea96347be2b32ca25bf3a14fae4ae8ba69f3cd16540f5018c674a49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a9dcca19ea96347be2b32ca25bf3a14fae4ae8ba69f3cd16540f5018c674a49","first_computed_at":"2026-07-05T03:12:49.720697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:12:49.720697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FdLF92/XzcH1KQ7S5iTRTjUxZfoRZNGvuJW5b7izqjykLQsJVemjWZdX/eBLAwDdZiHHWpf6uy9w3LWBNEz3AA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:12:49.721153Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.09404","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aef6a181a439c9da6ab391bbc22052cb3c3ab088466618cf88da250bcf4e75b5","sha256:e12c92c41cdb7ed841ace4481d41c2b9136034810ef36ffa81d82b264d78beaf"],"state_sha256":"f3ec350c96e0dc6320ea6c5878664e97c437c8c6c0000813e36f51a7c632e3d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wHPsUR9gFqivGMkIvdSGmgmAtkCylPE2QXoPP35BOiBq81IPuD07gT4ir94QWb+c3S96IiLp6KV7NS0OYexKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-15T11:36:01.016952Z","bundle_sha256":"a516ddc0289e8851505fffe5628ab71d7e52b7b8a06f5b5f6102fd694e061dd3"}}