{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TZAX5XPPWTJBJEXB5A7AI7EFK4","short_pith_number":"pith:TZAX5XPP","canonical_record":{"source":{"id":"1401.0437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-02T13:49:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0ef24297e654a23098204a3d4fe2a708a25f5306d94671a2f203dcd1118cbc4","abstract_canon_sha256":"cc4014c8cf9eecc5e34b6fa018299fd301a012bbc89880a30e0a29495eea6495"},"schema_version":"1.0"},"canonical_sha256":"9e417eddefb4d21492e1e83e047c85570c55bb448638f0279f87e1c2d757987e","source":{"kind":"arxiv","id":"1401.0437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0437","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0437v1","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0437","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"TZAX5XPPWTJB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TZAX5XPPWTJBJEXB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TZAX5XPP","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TZAX5XPPWTJBJEXB5A7AI7EFK4","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-02T13:49:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0ef24297e654a23098204a3d4fe2a708a25f5306d94671a2f203dcd1118cbc4","abstract_canon_sha256":"cc4014c8cf9eecc5e34b6fa018299fd301a012bbc89880a30e0a29495eea6495"},"schema_version":"1.0"},"canonical_sha256":"9e417eddefb4d21492e1e83e047c85570c55bb448638f0279f87e1c2d757987e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:23.231700Z","signature_b64":"k/t7hWvQoigI+63fidCV/9oh2trHLQzzcOwWV9tV4N7SH4G+GWDfxvGz2kBH+kRW1b4NJLwTuU/5FxuLN5woDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e417eddefb4d21492e1e83e047c85570c55bb448638f0279f87e1c2d757987e","last_reissued_at":"2026-05-18T03:03:23.230990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:23.230990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0437","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-18T03:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqWIRm41euNy6FsXEqWozKjRECE1yhr1+pBCZcROVsEYhBHkUFPI1vMfDv3jccrim0i09nUz7cRKMCnjk5XuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:37:55.661307Z"},"content_sha256":"b2154291e80b93b5d5c10ac9ac7ad45575b03462a58bda05cbfae120636bbd2f","schema_version":"1.0","event_id":"sha256:b2154291e80b93b5d5c10ac9ac7ad45575b03462a58bda05cbfae120636bbd2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TZAX5XPPWTJBJEXB5A7AI7EFK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UROP: A Simple, Near-Optimal Scheduling Policy for Energy Harvesting Sensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elif Uysal-Biyikoglu, Omer Melih Gul","submitted_at":"2014-01-02T13:49:28Z","abstract_excerpt":"This paper considers a single-hop wireless network where a central node (or fusion center, FC) collects data from a set of m energy harvesting (EH) nodes (e.g. nodes of a wireless sensor network). In each time slot, k of m nodes can be scheduled by the FC for transmission over k orthogonal channels. FC has no knowledge about EH processes and current battery states of nodes; however, it knows outcomes of previous transmission attempts. The objective is to find a low complexity scheduling policy that maximizes total throughput of the data backlogged system using the harvested energy, for all typ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0437","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-18T03:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFuagqroLpynWsJtsnjv7YkJj5XTlFo1S00ajH/pn6ffYGoYiLnqa00IVhfpnaLiv3ORYoOlsNK2L+0MahOEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:37:55.661777Z"},"content_sha256":"5318e094635d2f0e58d37cc1e31968c25a84fdc6ec6de2f548c3eba939a3a6f7","schema_version":"1.0","event_id":"sha256:5318e094635d2f0e58d37cc1e31968c25a84fdc6ec6de2f548c3eba939a3a6f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZAX5XPPWTJBJEXB5A7AI7EFK4/bundle.json","state_url":"https://pith.science/pith/TZAX5XPPWTJBJEXB5A7AI7EFK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZAX5XPPWTJBJEXB5A7AI7EFK4/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-09T21:37:55Z","links":{"resolver":"https://pith.science/pith/TZAX5XPPWTJBJEXB5A7AI7EFK4","bundle":"https://pith.science/pith/TZAX5XPPWTJBJEXB5A7AI7EFK4/bundle.json","state":"https://pith.science/pith/TZAX5XPPWTJBJEXB5A7AI7EFK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZAX5XPPWTJBJEXB5A7AI7EFK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TZAX5XPPWTJBJEXB5A7AI7EFK4","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":"cc4014c8cf9eecc5e34b6fa018299fd301a012bbc89880a30e0a29495eea6495","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-02T13:49:28Z","title_canon_sha256":"a0ef24297e654a23098204a3d4fe2a708a25f5306d94671a2f203dcd1118cbc4"},"schema_version":"1.0","source":{"id":"1401.0437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0437","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0437v1","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0437","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"TZAX5XPPWTJB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TZAX5XPPWTJBJEXB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TZAX5XPP","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:5318e094635d2f0e58d37cc1e31968c25a84fdc6ec6de2f548c3eba939a3a6f7","target":"graph","created_at":"2026-05-18T03:03: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"},"paper":{"abstract_excerpt":"This paper considers a single-hop wireless network where a central node (or fusion center, FC) collects data from a set of m energy harvesting (EH) nodes (e.g. nodes of a wireless sensor network). In each time slot, k of m nodes can be scheduled by the FC for transmission over k orthogonal channels. FC has no knowledge about EH processes and current battery states of nodes; however, it knows outcomes of previous transmission attempts. The objective is to find a low complexity scheduling policy that maximizes total throughput of the data backlogged system using the harvested energy, for all typ","authors_text":"Elif Uysal-Biyikoglu, Omer Melih Gul","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-02T13:49:28Z","title":"UROP: A Simple, Near-Optimal Scheduling Policy for Energy Harvesting Sensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0437","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:b2154291e80b93b5d5c10ac9ac7ad45575b03462a58bda05cbfae120636bbd2f","target":"record","created_at":"2026-05-18T03:03: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":"cc4014c8cf9eecc5e34b6fa018299fd301a012bbc89880a30e0a29495eea6495","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-02T13:49:28Z","title_canon_sha256":"a0ef24297e654a23098204a3d4fe2a708a25f5306d94671a2f203dcd1118cbc4"},"schema_version":"1.0","source":{"id":"1401.0437","kind":"arxiv","version":1}},"canonical_sha256":"9e417eddefb4d21492e1e83e047c85570c55bb448638f0279f87e1c2d757987e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e417eddefb4d21492e1e83e047c85570c55bb448638f0279f87e1c2d757987e","first_computed_at":"2026-05-18T03:03:23.230990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:23.230990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k/t7hWvQoigI+63fidCV/9oh2trHLQzzcOwWV9tV4N7SH4G+GWDfxvGz2kBH+kRW1b4NJLwTuU/5FxuLN5woDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:23.231700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2154291e80b93b5d5c10ac9ac7ad45575b03462a58bda05cbfae120636bbd2f","sha256:5318e094635d2f0e58d37cc1e31968c25a84fdc6ec6de2f548c3eba939a3a6f7"],"state_sha256":"c9384f1a233407b7883c39379bf026ba3119f56be71d8dc4c85be12f797856d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7zSwSgG234mHDloGP8DYmjPKOFu6tBXNdaaKenuMUxGwjgiMyoJdxahSiA7ZRTK7BlKQYbGSua/mBzig3hbBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T21:37:55.665124Z","bundle_sha256":"c84fab0d201bf22e53b840d3cf7da9133fd95711fb1aed0ff8612dd807c9c9ad"}}