{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:35MR3KN5Q3CJ6SSTIK23SVFQ5G","short_pith_number":"pith:35MR3KN5","canonical_record":{"source":{"id":"2310.04817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-07T14:14:48Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"5b931e0afcf1a78f0b6677e0abeb161e3fbd13aa39ecebc4d71bc94804b52f02","abstract_canon_sha256":"53cdb1a393cd4c583f9b4c75a9615a8a563436f2b96c1e5fb54e65deac0ddbf1"},"schema_version":"1.0"},"canonical_sha256":"df591da9bd86c49f4a5342b5b954b0e988ce91bef48c3eb2c534ec34ac507008","source":{"kind":"arxiv","id":"2310.04817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.04817","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"2310.04817v1","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04817","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"35MR3KN5Q3CJ","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"35MR3KN5Q3CJ6SST","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"35MR3KN5","created_at":"2026-07-05T06:58:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:35MR3KN5Q3CJ6SSTIK23SVFQ5G","target":"record","payload":{"canonical_record":{"source":{"id":"2310.04817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-07T14:14:48Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"5b931e0afcf1a78f0b6677e0abeb161e3fbd13aa39ecebc4d71bc94804b52f02","abstract_canon_sha256":"53cdb1a393cd4c583f9b4c75a9615a8a563436f2b96c1e5fb54e65deac0ddbf1"},"schema_version":"1.0"},"canonical_sha256":"df591da9bd86c49f4a5342b5b954b0e988ce91bef48c3eb2c534ec34ac507008","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:23.208284Z","signature_b64":"jKNTip8hUP6guOrY/+YmWz0WmcsYvUv9aXgT7xbKh+jlxhnBMnRiWQ+Jx9xYY7PQ+meUd2d//wfSTRaeko7QDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df591da9bd86c49f4a5342b5b954b0e988ce91bef48c3eb2c534ec34ac507008","last_reissued_at":"2026-07-05T06:58:23.207865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:23.207865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.04817","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-07-05T06:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/eifRIKMeUdPqFWI3MgSaB2xD/HoJ0q0rhtzOKb0k6Fa9zrns/04bZZUK7At/FkOvgLE7r3ubMDJTrWGov3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:44:53.497751Z"},"content_sha256":"d2fcbee1a72cfdccc26439c03e197c5e34285c6bd3c03546c0f4c19995a0457a","schema_version":"1.0","event_id":"sha256:d2fcbee1a72cfdccc26439c03e197c5e34285c6bd3c03546c0f4c19995a0457a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:35MR3KN5Q3CJ6SSTIK23SVFQ5G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Grouping-based Scheduler for Efficient Channel Utilization under Age of Information Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jingzhou Sun, Lehan Wang, Sheng Zhou, Yuxuan Sun, Zhisheng Niu","submitted_at":"2023-10-07T14:14:48Z","abstract_excerpt":"We consider a status information updating system where a fusion center collects the status information from a large number of sources and each of them has its own age of information (AoI) constraints. A novel grouping-based scheduler is proposed to solve this complex large-scale problem by dividing the sources into different scheduling groups. The problem is then transformed into deriving the optimal grouping scheme. A two-step grouping algorithm (TGA) is proposed: 1) Given AoI constraints, we first identify the sources with harmonic AoI constraints, then design a fast grouping method and an o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04817","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.04817/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-05T06:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"beJyhbx3+7g02gpyIk2HgdmkGhJOZmDMa8CGYvZseW98/pirzovnbtzrBgrASo28ZbI2MdMVx94NOtzd2P+LAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:44:53.498325Z"},"content_sha256":"91fac385d61c8e6c596fbf4e806c843b4574ae289aa65e6833097898b8fb7176","schema_version":"1.0","event_id":"sha256:91fac385d61c8e6c596fbf4e806c843b4574ae289aa65e6833097898b8fb7176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/bundle.json","state_url":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/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-08-15T00:44:53Z","links":{"resolver":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G","bundle":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/bundle.json","state":"https://pith.science/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35MR3KN5Q3CJ6SSTIK23SVFQ5G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:35MR3KN5Q3CJ6SSTIK23SVFQ5G","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":"53cdb1a393cd4c583f9b4c75a9615a8a563436f2b96c1e5fb54e65deac0ddbf1","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-07T14:14:48Z","title_canon_sha256":"5b931e0afcf1a78f0b6677e0abeb161e3fbd13aa39ecebc4d71bc94804b52f02"},"schema_version":"1.0","source":{"id":"2310.04817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.04817","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"2310.04817v1","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04817","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"35MR3KN5Q3CJ","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"35MR3KN5Q3CJ6SST","created_at":"2026-07-05T06:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"35MR3KN5","created_at":"2026-07-05T06:58:23Z"}],"graph_snapshots":[{"event_id":"sha256:91fac385d61c8e6c596fbf4e806c843b4574ae289aa65e6833097898b8fb7176","target":"graph","created_at":"2026-07-05T06:58:23Z","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/2310.04817/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a status information updating system where a fusion center collects the status information from a large number of sources and each of them has its own age of information (AoI) constraints. A novel grouping-based scheduler is proposed to solve this complex large-scale problem by dividing the sources into different scheduling groups. The problem is then transformed into deriving the optimal grouping scheme. A two-step grouping algorithm (TGA) is proposed: 1) Given AoI constraints, we first identify the sources with harmonic AoI constraints, then design a fast grouping method and an o","authors_text":"Jingzhou Sun, Lehan Wang, Sheng Zhou, Yuxuan Sun, Zhisheng Niu","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-07T14:14:48Z","title":"A Grouping-based Scheduler for Efficient Channel Utilization under Age of Information Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04817","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:d2fcbee1a72cfdccc26439c03e197c5e34285c6bd3c03546c0f4c19995a0457a","target":"record","created_at":"2026-07-05T06:58:23Z","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":"53cdb1a393cd4c583f9b4c75a9615a8a563436f2b96c1e5fb54e65deac0ddbf1","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-07T14:14:48Z","title_canon_sha256":"5b931e0afcf1a78f0b6677e0abeb161e3fbd13aa39ecebc4d71bc94804b52f02"},"schema_version":"1.0","source":{"id":"2310.04817","kind":"arxiv","version":1}},"canonical_sha256":"df591da9bd86c49f4a5342b5b954b0e988ce91bef48c3eb2c534ec34ac507008","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df591da9bd86c49f4a5342b5b954b0e988ce91bef48c3eb2c534ec34ac507008","first_computed_at":"2026-07-05T06:58:23.207865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:58:23.207865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jKNTip8hUP6guOrY/+YmWz0WmcsYvUv9aXgT7xbKh+jlxhnBMnRiWQ+Jx9xYY7PQ+meUd2d//wfSTRaeko7QDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:58:23.208284Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.04817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2fcbee1a72cfdccc26439c03e197c5e34285c6bd3c03546c0f4c19995a0457a","sha256:91fac385d61c8e6c596fbf4e806c843b4574ae289aa65e6833097898b8fb7176"],"state_sha256":"7789d45a54809938d121eb5a0d511ab8db6f3f0f31bb8fbd2c4376a29d06dd05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFMemYhrHh+bkzfh55RiMlQnbzcMc4xYKvTRJKRviMB17GwU/mKkPTrBP78FvoM5W7s3tvNw41WnCTOhQJQWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T00:44:53.573913Z","bundle_sha256":"b5832efdafd93e8d785f77120d378ed22c7fa5719be1e0b1c89c1cea67ec38c5"}}