{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YZAG256RFF3ECUMK7Q44URRNGV","short_pith_number":"pith:YZAG256R","canonical_record":{"source":{"id":"1210.2067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-07T15:29:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9efb5feeb751034c45c3562a86c4044465cf58b98fba0f25161d1b5d2732f233","abstract_canon_sha256":"52d453d4e4847e587d5cd384700153d6a5fcfabcfbf4cbed8f2200c8ae5543cc"},"schema_version":"1.0"},"canonical_sha256":"c6406d77d1297641518afc39ca462d35755a0172876111804f64345c90f406c1","source":{"kind":"arxiv","id":"1210.2067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2067","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2067v3","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2067","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"YZAG256RFF3E","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YZAG256RFF3ECUMK","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YZAG256R","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YZAG256RFF3ECUMK7Q44URRNGV","target":"record","payload":{"canonical_record":{"source":{"id":"1210.2067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-07T15:29:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9efb5feeb751034c45c3562a86c4044465cf58b98fba0f25161d1b5d2732f233","abstract_canon_sha256":"52d453d4e4847e587d5cd384700153d6a5fcfabcfbf4cbed8f2200c8ae5543cc"},"schema_version":"1.0"},"canonical_sha256":"c6406d77d1297641518afc39ca462d35755a0172876111804f64345c90f406c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:06.265873Z","signature_b64":"U+7V2BZg9YcdGeiNS/r6UwAC5IMo9ccgSbESTjYNK1Kme4/MD2FMkI7AmFJK6DC1+30L0B0VBS0bOjeh3AHEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6406d77d1297641518afc39ca462d35755a0172876111804f64345c90f406c1","last_reissued_at":"2026-05-18T03:36:06.265246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:06.265246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.2067","source_version":3,"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:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8NP2H0cfMOpyvrgxjmjG0YanpNi0dpWQbZuwSBe3kyNgGMBP4HLuET8qEpNX0idGoRirqJNEkaHd6Fef/h0VDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:03:12.367611Z"},"content_sha256":"cb4a35a0c146e1d3efca4e827e066f107d42397e1bda9ef4ccaeb55c286e494a","schema_version":"1.0","event_id":"sha256:cb4a35a0c146e1d3efca4e827e066f107d42397e1bda9ef4ccaeb55c286e494a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YZAG256RFF3ECUMK7Q44URRNGV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approximation of the First Order Marcum $Q$-Function with Application to Network Connectivity Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carl Dettmann, Justin Coon, Mohammud Bocus","submitted_at":"2012-10-07T15:29:59Z","abstract_excerpt":"An exponential-type approximation of the first order Marcum $Q$-function is presented, which is robust to changes in its first argument and can easily be integrated with respect to the second argument. Such characteristics are particularly useful in network connectivity analysis. The proposed approximation is exact in the limit of small first argument of the Marcum $Q$-function, in which case the optimal parameters can be obtained analytically. For larger values of the first argument, an optimization problem is solved, and the parameters can be accurately represented using regression analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2067","kind":"arxiv","version":3},"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:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoZSfs3tTY2319bnB0ssRTqY5Z9O6Y0j+0uyrS89z2Bv7V48h0wiamdk0kX7oiyjI9GjB5G27v6M4dNNeF/oDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:03:12.368217Z"},"content_sha256":"2e41953c81231e844db286fff9f4216eaa461519dbf2805534334f1f9dad04a7","schema_version":"1.0","event_id":"sha256:2e41953c81231e844db286fff9f4216eaa461519dbf2805534334f1f9dad04a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZAG256RFF3ECUMK7Q44URRNGV/bundle.json","state_url":"https://pith.science/pith/YZAG256RFF3ECUMK7Q44URRNGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZAG256RFF3ECUMK7Q44URRNGV/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-11T01:03:12Z","links":{"resolver":"https://pith.science/pith/YZAG256RFF3ECUMK7Q44URRNGV","bundle":"https://pith.science/pith/YZAG256RFF3ECUMK7Q44URRNGV/bundle.json","state":"https://pith.science/pith/YZAG256RFF3ECUMK7Q44URRNGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZAG256RFF3ECUMK7Q44URRNGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YZAG256RFF3ECUMK7Q44URRNGV","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":"52d453d4e4847e587d5cd384700153d6a5fcfabcfbf4cbed8f2200c8ae5543cc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-07T15:29:59Z","title_canon_sha256":"9efb5feeb751034c45c3562a86c4044465cf58b98fba0f25161d1b5d2732f233"},"schema_version":"1.0","source":{"id":"1210.2067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2067","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2067v3","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2067","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"YZAG256RFF3E","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YZAG256RFF3ECUMK","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YZAG256R","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:2e41953c81231e844db286fff9f4216eaa461519dbf2805534334f1f9dad04a7","target":"graph","created_at":"2026-05-18T03:36:06Z","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 exponential-type approximation of the first order Marcum $Q$-function is presented, which is robust to changes in its first argument and can easily be integrated with respect to the second argument. Such characteristics are particularly useful in network connectivity analysis. The proposed approximation is exact in the limit of small first argument of the Marcum $Q$-function, in which case the optimal parameters can be obtained analytically. For larger values of the first argument, an optimization problem is solved, and the parameters can be accurately represented using regression analysis.","authors_text":"Carl Dettmann, Justin Coon, Mohammud Bocus","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-07T15:29:59Z","title":"An Approximation of the First Order Marcum $Q$-Function with Application to Network Connectivity Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2067","kind":"arxiv","version":3},"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:cb4a35a0c146e1d3efca4e827e066f107d42397e1bda9ef4ccaeb55c286e494a","target":"record","created_at":"2026-05-18T03:36:06Z","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":"52d453d4e4847e587d5cd384700153d6a5fcfabcfbf4cbed8f2200c8ae5543cc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-07T15:29:59Z","title_canon_sha256":"9efb5feeb751034c45c3562a86c4044465cf58b98fba0f25161d1b5d2732f233"},"schema_version":"1.0","source":{"id":"1210.2067","kind":"arxiv","version":3}},"canonical_sha256":"c6406d77d1297641518afc39ca462d35755a0172876111804f64345c90f406c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6406d77d1297641518afc39ca462d35755a0172876111804f64345c90f406c1","first_computed_at":"2026-05-18T03:36:06.265246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:06.265246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U+7V2BZg9YcdGeiNS/r6UwAC5IMo9ccgSbESTjYNK1Kme4/MD2FMkI7AmFJK6DC1+30L0B0VBS0bOjeh3AHEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:06.265873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb4a35a0c146e1d3efca4e827e066f107d42397e1bda9ef4ccaeb55c286e494a","sha256:2e41953c81231e844db286fff9f4216eaa461519dbf2805534334f1f9dad04a7"],"state_sha256":"d090bddf87d7fca668492f146af48f394ed88df94c7142ee501ab20b6b6c46a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QG2mJfiptg5mjSp4w2xv6ZB5rYe5xYSr9vkB/rxj1d5l30lG2SzLLqZ/DhHDUwxWoDRWtw2qasRAqd09+CZECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:03:12.371879Z","bundle_sha256":"efcc92e573eb46a260d7d5d7360ec3bbf6e70b2f125458f46cd501f153ad0ae4"}}