{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6ZHTHZ7QDPRNNN3DOKZ6J72WC6","short_pith_number":"pith:6ZHTHZ7Q","canonical_record":{"source":{"id":"1710.00817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-30T05:23:56Z","cross_cats_sorted":[],"title_canon_sha256":"f9c4587f2a0ad2d580f3fd0b116cd58af3d45290a30dc187f8e95230cf73a823","abstract_canon_sha256":"34d805236a1814d7cfd9141af66e5491c1eb3e7920e015943eba3e262d5d7ab0"},"schema_version":"1.0"},"canonical_sha256":"f64f33e7f01be2d6b76372b3e4ff56178a5a8ef7ed8d4a21eaed120a08c30b7c","source":{"kind":"arxiv","id":"1710.00817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00817","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00817v1","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00817","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"pith_short_12","alias_value":"6ZHTHZ7QDPRN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZHTHZ7QDPRNNN3D","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZHTHZ7Q","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6ZHTHZ7QDPRNNN3DOKZ6J72WC6","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-30T05:23:56Z","cross_cats_sorted":[],"title_canon_sha256":"f9c4587f2a0ad2d580f3fd0b116cd58af3d45290a30dc187f8e95230cf73a823","abstract_canon_sha256":"34d805236a1814d7cfd9141af66e5491c1eb3e7920e015943eba3e262d5d7ab0"},"schema_version":"1.0"},"canonical_sha256":"f64f33e7f01be2d6b76372b3e4ff56178a5a8ef7ed8d4a21eaed120a08c30b7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:47.727061Z","signature_b64":"hURhoecQ1WqDcFJFGGPz80mw/129eZUiTDH8DGdidgIqYQhMFTNRtofP5+Lx8P/G9OE+OzRrhSO7kUCBguznBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f64f33e7f01be2d6b76372b3e4ff56178a5a8ef7ed8d4a21eaed120a08c30b7c","last_reissued_at":"2026-05-18T00:33:47.726597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:47.726597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00817","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:33:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7rl8v8clW/PHcygfeMpXnNl0xgcrZpepMhy/vUob9LufbnQ5DG2V5fjnJSkwf22XXWVmjwa+maJqYlMRDYdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:47:23.472648Z"},"content_sha256":"15582adaf6ab293cff5c36b6ff37d4958a20a6a7fc7fa9ec66cbde8b105cc437","schema_version":"1.0","event_id":"sha256:15582adaf6ab293cff5c36b6ff37d4958a20a6a7fc7fa9ec66cbde8b105cc437"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6ZHTHZ7QDPRNNN3DOKZ6J72WC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overload Control in SIP Networks: A Heuristic Approach Based on Mathematical Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmadreza Montazerolghaem, Farzad Tashtarian, Mohammad Hossein Yaghmaee Moghaddam","submitted_at":"2017-09-30T05:23:56Z","abstract_excerpt":"The Session Initiation Protocol (SIP) is an application-layer control protocol for creating, modifying and terminating multimedia sessions. An open issue is the control of overload that occurs when a SIP server lacks sufficient CPU and memory resources to process all messages. We prove that the problem of overload control in SIP network with a set of n servers and limited resources is in the form of NP-hard. This paper proposes a Load-Balanced Call Admission Controller (LB-CAC), based on a heuristic mathematical model to determine an optimal resource allocation in such a way that maximizes cal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00817","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:33:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agVepoCRccV+Q4r/HY7NdR/UaLCMgLQZDL7YmUBDpHXTVXK5IgFSxuFvhIHl5L9JuV9piFrQIElOCjKExID8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:47:23.473362Z"},"content_sha256":"46ae9ff5729f923975bab51e8654c11f1a435a32c33e7fb44bece6e84cd29e03","schema_version":"1.0","event_id":"sha256:46ae9ff5729f923975bab51e8654c11f1a435a32c33e7fb44bece6e84cd29e03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZHTHZ7QDPRNNN3DOKZ6J72WC6/bundle.json","state_url":"https://pith.science/pith/6ZHTHZ7QDPRNNN3DOKZ6J72WC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZHTHZ7QDPRNNN3DOKZ6J72WC6/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-04T20:47:23Z","links":{"resolver":"https://pith.science/pith/6ZHTHZ7QDPRNNN3DOKZ6J72WC6","bundle":"https://pith.science/pith/6ZHTHZ7QDPRNNN3DOKZ6J72WC6/bundle.json","state":"https://pith.science/pith/6ZHTHZ7QDPRNNN3DOKZ6J72WC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZHTHZ7QDPRNNN3DOKZ6J72WC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6ZHTHZ7QDPRNNN3DOKZ6J72WC6","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":"34d805236a1814d7cfd9141af66e5491c1eb3e7920e015943eba3e262d5d7ab0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-30T05:23:56Z","title_canon_sha256":"f9c4587f2a0ad2d580f3fd0b116cd58af3d45290a30dc187f8e95230cf73a823"},"schema_version":"1.0","source":{"id":"1710.00817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00817","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00817v1","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00817","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"pith_short_12","alias_value":"6ZHTHZ7QDPRN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZHTHZ7QDPRNNN3D","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZHTHZ7Q","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:46ae9ff5729f923975bab51e8654c11f1a435a32c33e7fb44bece6e84cd29e03","target":"graph","created_at":"2026-05-18T00:33:47Z","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":"The Session Initiation Protocol (SIP) is an application-layer control protocol for creating, modifying and terminating multimedia sessions. An open issue is the control of overload that occurs when a SIP server lacks sufficient CPU and memory resources to process all messages. We prove that the problem of overload control in SIP network with a set of n servers and limited resources is in the form of NP-hard. This paper proposes a Load-Balanced Call Admission Controller (LB-CAC), based on a heuristic mathematical model to determine an optimal resource allocation in such a way that maximizes cal","authors_text":"Ahmadreza Montazerolghaem, Farzad Tashtarian, Mohammad Hossein Yaghmaee Moghaddam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-30T05:23:56Z","title":"Overload Control in SIP Networks: A Heuristic Approach Based on Mathematical Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00817","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:15582adaf6ab293cff5c36b6ff37d4958a20a6a7fc7fa9ec66cbde8b105cc437","target":"record","created_at":"2026-05-18T00:33:47Z","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":"34d805236a1814d7cfd9141af66e5491c1eb3e7920e015943eba3e262d5d7ab0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-30T05:23:56Z","title_canon_sha256":"f9c4587f2a0ad2d580f3fd0b116cd58af3d45290a30dc187f8e95230cf73a823"},"schema_version":"1.0","source":{"id":"1710.00817","kind":"arxiv","version":1}},"canonical_sha256":"f64f33e7f01be2d6b76372b3e4ff56178a5a8ef7ed8d4a21eaed120a08c30b7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f64f33e7f01be2d6b76372b3e4ff56178a5a8ef7ed8d4a21eaed120a08c30b7c","first_computed_at":"2026-05-18T00:33:47.726597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:47.726597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hURhoecQ1WqDcFJFGGPz80mw/129eZUiTDH8DGdidgIqYQhMFTNRtofP5+Lx8P/G9OE+OzRrhSO7kUCBguznBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:47.727061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15582adaf6ab293cff5c36b6ff37d4958a20a6a7fc7fa9ec66cbde8b105cc437","sha256:46ae9ff5729f923975bab51e8654c11f1a435a32c33e7fb44bece6e84cd29e03"],"state_sha256":"94995276d0d233e85b01a74ee8710b05d4a59f93f923f71abd39504226c6c846"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdM3GTWzB1vroQRdGR5znBzwb+jsjtEkFbfEqOrQMQWc5LZ5yT7dTmzNwgwS9OTUptJ0JuZ7Rw4um12wAxOCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:47:23.477334Z","bundle_sha256":"5861b92706aaf7fb6c32ad6adc5883dff85413a7792cc73406c4fc87c7bd59f6"}}