{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7FIRKCUTTN5YMU73VCAS234TNV","short_pith_number":"pith:7FIRKCUT","canonical_record":{"source":{"id":"1602.00986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-02T15:57:03Z","cross_cats_sorted":[],"title_canon_sha256":"9b61691e9f8e1cf87e74dd171ea56cf76c60bbd43c8edf76538c48bd5d819c2b","abstract_canon_sha256":"0082b274ac52ea0ddd5f67c2be36f8b501c5b4ce17c7642b9170436a466fa1b5"},"schema_version":"1.0"},"canonical_sha256":"f951150a939b7b8653fba8812d6f936d7011fefecda12b0b013e226f3149ecaf","source":{"kind":"arxiv","id":"1602.00986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00986","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00986v1","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00986","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"pith_short_12","alias_value":"7FIRKCUTTN5Y","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7FIRKCUTTN5YMU73","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7FIRKCUT","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7FIRKCUTTN5YMU73VCAS234TNV","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-02T15:57:03Z","cross_cats_sorted":[],"title_canon_sha256":"9b61691e9f8e1cf87e74dd171ea56cf76c60bbd43c8edf76538c48bd5d819c2b","abstract_canon_sha256":"0082b274ac52ea0ddd5f67c2be36f8b501c5b4ce17c7642b9170436a466fa1b5"},"schema_version":"1.0"},"canonical_sha256":"f951150a939b7b8653fba8812d6f936d7011fefecda12b0b013e226f3149ecaf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:24.079153Z","signature_b64":"73nh68WS6TMWfM6SEK+IE1QZ+9m9p0uxFHfxVIm/4/vMS/DTM9dcU8SWhJEP/o+3J57fIXJhz0HQ9HyaGfJzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f951150a939b7b8653fba8812d6f936d7011fefecda12b0b013e226f3149ecaf","last_reissued_at":"2026-05-18T01:21:24.078569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:24.078569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00986","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-18T01:21:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYI9DFW9Du3m8v+OA5zD5ohEkpEfZWIeG9aFL7mhWw+p2OfrJ/n8dRJ827Nz4Y5ils/Ugc0NHg40NQBwRxDhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:24:23.936489Z"},"content_sha256":"d5930e2d4d9fe89be9ed85d5def34396b442c7358ad667d64030b0a5072b2d32","schema_version":"1.0","event_id":"sha256:d5930e2d4d9fe89be9ed85d5def34396b442c7358ad667d64030b0a5072b2d32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7FIRKCUTTN5YMU73VCAS234TNV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revenue maximization in an optical router node - allocation of service windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jacques Resing, Murtuza Ali Abidini, Onno Boxma, Ton Koonen","submitted_at":"2016-02-02T15:57:03Z","abstract_excerpt":"In this paper we study a revenue maximization problem for optical routing nodes. We model the routing node as a single server polling model with the aim to assign visit periods (service windows) to the different stations (ports) such that the mean profit per cycle is maximized. Under reasonable assumptions regarding retrial and dropping probabilities of packets the optimization problem becomes a separable concave resource allocation problem, which can be solved using existing algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00986","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-18T01:21:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0uIG4ncENaBPQBuEI2RIoTpl2TSHvfv9hq2W3JwupWfDplWQwAKa2FbiplkUOT9BeaXqTwm5eVTrCjYYocKRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:24:23.936831Z"},"content_sha256":"427caa1457eb4e20ae65683272a60c94acfa4175d3d7e9e97616a78bcaccfcad","schema_version":"1.0","event_id":"sha256:427caa1457eb4e20ae65683272a60c94acfa4175d3d7e9e97616a78bcaccfcad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FIRKCUTTN5YMU73VCAS234TNV/bundle.json","state_url":"https://pith.science/pith/7FIRKCUTTN5YMU73VCAS234TNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FIRKCUTTN5YMU73VCAS234TNV/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-02T08:24:23Z","links":{"resolver":"https://pith.science/pith/7FIRKCUTTN5YMU73VCAS234TNV","bundle":"https://pith.science/pith/7FIRKCUTTN5YMU73VCAS234TNV/bundle.json","state":"https://pith.science/pith/7FIRKCUTTN5YMU73VCAS234TNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FIRKCUTTN5YMU73VCAS234TNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7FIRKCUTTN5YMU73VCAS234TNV","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":"0082b274ac52ea0ddd5f67c2be36f8b501c5b4ce17c7642b9170436a466fa1b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-02T15:57:03Z","title_canon_sha256":"9b61691e9f8e1cf87e74dd171ea56cf76c60bbd43c8edf76538c48bd5d819c2b"},"schema_version":"1.0","source":{"id":"1602.00986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00986","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00986v1","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00986","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"pith_short_12","alias_value":"7FIRKCUTTN5Y","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7FIRKCUTTN5YMU73","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7FIRKCUT","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:427caa1457eb4e20ae65683272a60c94acfa4175d3d7e9e97616a78bcaccfcad","target":"graph","created_at":"2026-05-18T01:21:24Z","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":"In this paper we study a revenue maximization problem for optical routing nodes. We model the routing node as a single server polling model with the aim to assign visit periods (service windows) to the different stations (ports) such that the mean profit per cycle is maximized. Under reasonable assumptions regarding retrial and dropping probabilities of packets the optimization problem becomes a separable concave resource allocation problem, which can be solved using existing algorithms.","authors_text":"Jacques Resing, Murtuza Ali Abidini, Onno Boxma, Ton Koonen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-02T15:57:03Z","title":"Revenue maximization in an optical router node - allocation of service windows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00986","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:d5930e2d4d9fe89be9ed85d5def34396b442c7358ad667d64030b0a5072b2d32","target":"record","created_at":"2026-05-18T01:21:24Z","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":"0082b274ac52ea0ddd5f67c2be36f8b501c5b4ce17c7642b9170436a466fa1b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-02T15:57:03Z","title_canon_sha256":"9b61691e9f8e1cf87e74dd171ea56cf76c60bbd43c8edf76538c48bd5d819c2b"},"schema_version":"1.0","source":{"id":"1602.00986","kind":"arxiv","version":1}},"canonical_sha256":"f951150a939b7b8653fba8812d6f936d7011fefecda12b0b013e226f3149ecaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f951150a939b7b8653fba8812d6f936d7011fefecda12b0b013e226f3149ecaf","first_computed_at":"2026-05-18T01:21:24.078569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:24.078569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"73nh68WS6TMWfM6SEK+IE1QZ+9m9p0uxFHfxVIm/4/vMS/DTM9dcU8SWhJEP/o+3J57fIXJhz0HQ9HyaGfJzAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:24.079153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5930e2d4d9fe89be9ed85d5def34396b442c7358ad667d64030b0a5072b2d32","sha256:427caa1457eb4e20ae65683272a60c94acfa4175d3d7e9e97616a78bcaccfcad"],"state_sha256":"ad0a7283906cd33e84bb6d6ef045092204a85c2813f55e6c1cf904e5d496450b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXBRvObhRDAzfFpDyKC4hMANNoWf5sw2MupzB3DnueA9uUBTCI7cw2ayKMOWQ5GHYDnO9upgignTdh7Vmah7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:24:23.938750Z","bundle_sha256":"04f8d115540c95b43b3347da1ea6fcff1320da3b718dd20bf4a6c2aefca181f9"}}