{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OAA6OHNLWKYPZJPSFX7MJUI5CF","short_pith_number":"pith:OAA6OHNL","canonical_record":{"source":{"id":"1803.06469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-17T05:56:29Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"809fa268e8ca78560675f8fd9902c6bae12ba7f8060a45a4712f37465f5e7fe0","abstract_canon_sha256":"abc5e4709c5094756886b4e28301d89eb71b1b6b1e45b940ec74776fb1dc4270"},"schema_version":"1.0"},"canonical_sha256":"7001e71dabb2b0fca5f22dfec4d11d117595f90e5fb27208179884417a3aaab0","source":{"kind":"arxiv","id":"1803.06469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06469","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06469v1","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06469","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"pith_short_12","alias_value":"OAA6OHNLWKYP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OAA6OHNLWKYPZJPS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OAA6OHNL","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OAA6OHNLWKYPZJPSFX7MJUI5CF","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-17T05:56:29Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"809fa268e8ca78560675f8fd9902c6bae12ba7f8060a45a4712f37465f5e7fe0","abstract_canon_sha256":"abc5e4709c5094756886b4e28301d89eb71b1b6b1e45b940ec74776fb1dc4270"},"schema_version":"1.0"},"canonical_sha256":"7001e71dabb2b0fca5f22dfec4d11d117595f90e5fb27208179884417a3aaab0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:45.820428Z","signature_b64":"iHdqRRLmWgJhRxGv2iC8451JEbnoSsk48sv+mowtzkNfPaLvcZQ5vh2Y7wuvBFce7q1byxrB6sJy87sa0QZTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7001e71dabb2b0fca5f22dfec4d11d117595f90e5fb27208179884417a3aaab0","last_reissued_at":"2026-05-18T00:20:45.819853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:45.819853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06469","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-18T00:20:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDHLkuO1b79c1s9UbKW1rBDNc93mtrHHQA8vJj2aLy3mDBVPPzhiddB6eE1cpb6YxRSuae5lb2ILIddfGGt+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:32:04.970295Z"},"content_sha256":"0077e2aaa56ad07d364d12004571f6bdc5075395432165d225e4994f05ae668e","schema_version":"1.0","event_id":"sha256:0077e2aaa56ad07d364d12004571f6bdc5075395432165d225e4994f05ae668e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OAA6OHNLWKYPZJPSFX7MJUI5CF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Eytan Modiano, Rajat Talak, Sertac Karaman","submitted_at":"2018-03-17T05:56:29Z","abstract_excerpt":"Age of Information (AoI), measures the time elapsed since the last received information packet was generated at the source. We consider the problem of AoI minimization for single-hop flows in a wireless network, under pairwise interference constraints and time varying channel. We consider simple, yet broad, class of distributed scheduling policies, in which a transmission is attempted over each link with a certain attempt probability. We obtain an interesting relation between the optimal attempt probability and the optimal AoI of the link, and its neighboring links. We then show that the optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06469","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-18T00:20:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z1b4PYQxwR8LhLv7qZoVxwzLsNOjA5dLzS2nxEOQ8H1LR4m1iUr6SoQkD7DqaGUBa50ORbume2vF+9pm+kkWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:32:04.970919Z"},"content_sha256":"7748aaa6f24d6949ff769cfff7a3caa3195a808c85ccdd9aa754f63b8aca007e","schema_version":"1.0","event_id":"sha256:7748aaa6f24d6949ff769cfff7a3caa3195a808c85ccdd9aa754f63b8aca007e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/bundle.json","state_url":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/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-05-28T08:32:04Z","links":{"resolver":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF","bundle":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/bundle.json","state":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OAA6OHNLWKYPZJPSFX7MJUI5CF","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":"abc5e4709c5094756886b4e28301d89eb71b1b6b1e45b940ec74776fb1dc4270","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-17T05:56:29Z","title_canon_sha256":"809fa268e8ca78560675f8fd9902c6bae12ba7f8060a45a4712f37465f5e7fe0"},"schema_version":"1.0","source":{"id":"1803.06469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06469","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06469v1","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06469","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"pith_short_12","alias_value":"OAA6OHNLWKYP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OAA6OHNLWKYPZJPS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OAA6OHNL","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:7748aaa6f24d6949ff769cfff7a3caa3195a808c85ccdd9aa754f63b8aca007e","target":"graph","created_at":"2026-05-18T00:20: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":"Age of Information (AoI), measures the time elapsed since the last received information packet was generated at the source. We consider the problem of AoI minimization for single-hop flows in a wireless network, under pairwise interference constraints and time varying channel. We consider simple, yet broad, class of distributed scheduling policies, in which a transmission is attempted over each link with a certain attempt probability. We obtain an interesting relation between the optimal attempt probability and the optimal AoI of the link, and its neighboring links. We then show that the optim","authors_text":"Eytan Modiano, Rajat Talak, Sertac Karaman","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-17T05:56:29Z","title":"Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06469","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:0077e2aaa56ad07d364d12004571f6bdc5075395432165d225e4994f05ae668e","target":"record","created_at":"2026-05-18T00:20: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":"abc5e4709c5094756886b4e28301d89eb71b1b6b1e45b940ec74776fb1dc4270","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-17T05:56:29Z","title_canon_sha256":"809fa268e8ca78560675f8fd9902c6bae12ba7f8060a45a4712f37465f5e7fe0"},"schema_version":"1.0","source":{"id":"1803.06469","kind":"arxiv","version":1}},"canonical_sha256":"7001e71dabb2b0fca5f22dfec4d11d117595f90e5fb27208179884417a3aaab0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7001e71dabb2b0fca5f22dfec4d11d117595f90e5fb27208179884417a3aaab0","first_computed_at":"2026-05-18T00:20:45.819853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:45.819853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iHdqRRLmWgJhRxGv2iC8451JEbnoSsk48sv+mowtzkNfPaLvcZQ5vh2Y7wuvBFce7q1byxrB6sJy87sa0QZTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:45.820428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0077e2aaa56ad07d364d12004571f6bdc5075395432165d225e4994f05ae668e","sha256:7748aaa6f24d6949ff769cfff7a3caa3195a808c85ccdd9aa754f63b8aca007e"],"state_sha256":"fe777867b3e080a0e18749332c82104d6ed4e7ebc6a2db461426c0c01503fb2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxmxiN5NAFQ9RA8CH5XW8rR677iOMo91O1/5USdHXRv1/Y5VvebiQ6uTz7e1K2STtDJGILC6bl5wq9S0immYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:32:04.973875Z","bundle_sha256":"e0d98d763309b7a88f6fec8828ff1254710662a9e9fac1501d3b50a1c8fb4f06"}}