{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FFUENBMUVZNYOE5FOJ7K4XZM2X","short_pith_number":"pith:FFUENBMU","canonical_record":{"source":{"id":"1211.6162","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-26T23:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"164bb627feb3c9c23b24a4253a536aac6a289b3ae5fffed4d1c11c107b645a3b","abstract_canon_sha256":"c6ecc7a7d73897c7e77df09fdc51fcec5c635c9e8235f85356022c531284435d"},"schema_version":"1.0"},"canonical_sha256":"2968468594ae5b8713a5727eae5f2cd5d6f226356eb90922695f187665a84c80","source":{"kind":"arxiv","id":"1211.6162","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6162","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6162v2","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6162","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"FFUENBMUVZNY","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FFUENBMUVZNYOE5F","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FFUENBMU","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FFUENBMUVZNYOE5FOJ7K4XZM2X","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6162","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-26T23:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"164bb627feb3c9c23b24a4253a536aac6a289b3ae5fffed4d1c11c107b645a3b","abstract_canon_sha256":"c6ecc7a7d73897c7e77df09fdc51fcec5c635c9e8235f85356022c531284435d"},"schema_version":"1.0"},"canonical_sha256":"2968468594ae5b8713a5727eae5f2cd5d6f226356eb90922695f187665a84c80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:45.806392Z","signature_b64":"KZKMZ911aVuWB1zeWjD7hD3dZzKmkP7vnkUxhbhMDrkmF6gzYLyuHXh5o07l+QeAwbYCIZiyJE4ndhBtB3zoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2968468594ae5b8713a5727eae5f2cd5d6f226356eb90922695f187665a84c80","last_reissued_at":"2026-05-18T02:29:45.805971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:45.805971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6162","source_version":2,"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:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzPR0RFqQvLVddQAWRaVYK9nfTY+/OIWtdCB9HB40nOv5fznuBArhXSvxV/5nRtuOJgf7hxSRKRqevGiLOazAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:22:22.909989Z"},"content_sha256":"adf7789b9724baeac11c354a8d8a93daf68f0abf179cbe2c8bc74ca6d56f48b5","schema_version":"1.0","event_id":"sha256:adf7789b9724baeac11c354a8d8a93daf68f0abf179cbe2c8bc74ca6d56f48b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FFUENBMUVZNYOE5FOJ7K4XZM2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quality of Information Maximization for Wireless Networks via a Fully Separable Quadratic Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. Neely, Sucha Supittayapornpong","submitted_at":"2012-11-26T23:36:10Z","abstract_excerpt":"An information collection problem in a wireless network with random events is considered. Wireless devices report on each event using one of multiple reporting formats. Each format has a different quality and uses different data lengths. Delivering all data in the highest quality format can overload system resources. The goal is to make intelligent format selection and routing decisions to maximize time-averaged information quality subject to network stability. Lyapunov optimization theory can be used to solve such a problem by repeatedly minimizing the linear terms of a quadratic drift-plus-p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6162","kind":"arxiv","version":2},"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:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CT96945LKA6AnE0m2wtqAlQkpWivuAio7QpEKuAP4FlkJbfIkWoLWShNNuotgtfqqBkRM21b23EH/HGlltf6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:22:22.910335Z"},"content_sha256":"d8ca415ca6fb88a02ffb3687f04a7c88c4544270252f611bedb17cf2a26ac9d7","schema_version":"1.0","event_id":"sha256:d8ca415ca6fb88a02ffb3687f04a7c88c4544270252f611bedb17cf2a26ac9d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFUENBMUVZNYOE5FOJ7K4XZM2X/bundle.json","state_url":"https://pith.science/pith/FFUENBMUVZNYOE5FOJ7K4XZM2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFUENBMUVZNYOE5FOJ7K4XZM2X/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-02T06:22:22Z","links":{"resolver":"https://pith.science/pith/FFUENBMUVZNYOE5FOJ7K4XZM2X","bundle":"https://pith.science/pith/FFUENBMUVZNYOE5FOJ7K4XZM2X/bundle.json","state":"https://pith.science/pith/FFUENBMUVZNYOE5FOJ7K4XZM2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFUENBMUVZNYOE5FOJ7K4XZM2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FFUENBMUVZNYOE5FOJ7K4XZM2X","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":"c6ecc7a7d73897c7e77df09fdc51fcec5c635c9e8235f85356022c531284435d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-26T23:36:10Z","title_canon_sha256":"164bb627feb3c9c23b24a4253a536aac6a289b3ae5fffed4d1c11c107b645a3b"},"schema_version":"1.0","source":{"id":"1211.6162","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6162","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6162v2","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6162","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"FFUENBMUVZNY","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FFUENBMUVZNYOE5F","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FFUENBMU","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:d8ca415ca6fb88a02ffb3687f04a7c88c4544270252f611bedb17cf2a26ac9d7","target":"graph","created_at":"2026-05-18T02:29:45Z","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":"An information collection problem in a wireless network with random events is considered. Wireless devices report on each event using one of multiple reporting formats. Each format has a different quality and uses different data lengths. Delivering all data in the highest quality format can overload system resources. The goal is to make intelligent format selection and routing decisions to maximize time-averaged information quality subject to network stability. Lyapunov optimization theory can be used to solve such a problem by repeatedly minimizing the linear terms of a quadratic drift-plus-p","authors_text":"Michael J. Neely, Sucha Supittayapornpong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-26T23:36:10Z","title":"Quality of Information Maximization for Wireless Networks via a Fully Separable Quadratic Policy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6162","kind":"arxiv","version":2},"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:adf7789b9724baeac11c354a8d8a93daf68f0abf179cbe2c8bc74ca6d56f48b5","target":"record","created_at":"2026-05-18T02:29:45Z","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":"c6ecc7a7d73897c7e77df09fdc51fcec5c635c9e8235f85356022c531284435d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-26T23:36:10Z","title_canon_sha256":"164bb627feb3c9c23b24a4253a536aac6a289b3ae5fffed4d1c11c107b645a3b"},"schema_version":"1.0","source":{"id":"1211.6162","kind":"arxiv","version":2}},"canonical_sha256":"2968468594ae5b8713a5727eae5f2cd5d6f226356eb90922695f187665a84c80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2968468594ae5b8713a5727eae5f2cd5d6f226356eb90922695f187665a84c80","first_computed_at":"2026-05-18T02:29:45.805971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:45.805971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KZKMZ911aVuWB1zeWjD7hD3dZzKmkP7vnkUxhbhMDrkmF6gzYLyuHXh5o07l+QeAwbYCIZiyJE4ndhBtB3zoAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:45.806392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6162","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adf7789b9724baeac11c354a8d8a93daf68f0abf179cbe2c8bc74ca6d56f48b5","sha256:d8ca415ca6fb88a02ffb3687f04a7c88c4544270252f611bedb17cf2a26ac9d7"],"state_sha256":"1b4a559e63f92116d863ab2d1685eebf98a404e16f24d53300bcbce0f04b0f92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5j03He/UK7XC4dBwTG3HR1AsUTaxrEr7fghd+3KBaUO3RWTRqD+JekSa6MVvTK6D3PMzhcMKAlpJwdElxvcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:22:22.912349Z","bundle_sha256":"724e9245a6baa887bcc812e3f3a11ef443c68c035c14aab6e0841d4ebe03d2db"}}