{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HCFFQUON4M7RTCKMYAGDCIRZV5","short_pith_number":"pith:HCFFQUON","canonical_record":{"source":{"id":"1702.04939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-16T12:12:22Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"79952c310656c6372b0510eecdea52139675c215564740b0063917857fbea4e5","abstract_canon_sha256":"67fdc166b20234a1624bcdfcca9a7438849e05f1f019634e1b544641bf532a23"},"schema_version":"1.0"},"canonical_sha256":"388a5851cde33f19894cc00c312239af5061604e812d044d976af9406f381d15","source":{"kind":"arxiv","id":"1702.04939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04939","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04939v1","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04939","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"HCFFQUON4M7R","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HCFFQUON4M7RTCKM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HCFFQUON","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HCFFQUON4M7RTCKMYAGDCIRZV5","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-16T12:12:22Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"79952c310656c6372b0510eecdea52139675c215564740b0063917857fbea4e5","abstract_canon_sha256":"67fdc166b20234a1624bcdfcca9a7438849e05f1f019634e1b544641bf532a23"},"schema_version":"1.0"},"canonical_sha256":"388a5851cde33f19894cc00c312239af5061604e812d044d976af9406f381d15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:36.711095Z","signature_b64":"YZltmCec9vY7X0jdrTQYu8UB8JIVhglehBhNUxjpkV5kcmQGSjw6+wa8g20puyhsfk2L1SbrsGlbFz5K19TvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"388a5851cde33f19894cc00c312239af5061604e812d044d976af9406f381d15","last_reissued_at":"2026-05-18T00:50:36.710535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:36.710535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04939","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:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5BsbfG2Jt3H26QaXxyiAV5lMH4UJnYybDLlbkX46ZT/JdzEoaFGArGQm/nK/DUskBrhh3aWCnfCllSWnbR3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:19:43.213964Z"},"content_sha256":"8eb4323a1c8c177e3c9734fb10f3484d2c8a0456c484705c9df8e9014a800a5d","schema_version":"1.0","event_id":"sha256:8eb4323a1c8c177e3c9734fb10f3484d2c8a0456c484705c9df8e9014a800a5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HCFFQUON4M7RTCKMYAGDCIRZV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bayesian framework for distributed estimation of arrival rates in asynchronous networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Angelo Coluccia, Giuseppe Notarstefano","submitted_at":"2017-02-16T12:12:22Z","abstract_excerpt":"In this paper we consider a network of agents monitoring a spatially distributed arrival process. Each node measures the number of arrivals seen at its monitoring point in a given time-interval with the objective of estimating the unknown local arrival rate. We propose an asynchronous distributed approach based on a Bayesian model with unknown hyperparameter, where each node computes the minimum mean square error (MMSE) estimator of its local arrival rate in a distributed way. As a result, the estimation at each node \"optimally\" fuses the information from the whole network through a distribute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04939","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:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGvIwXEdO2ieCThLCAJOX5hLpkgYNOrvXcu2yNufQ1Zyf9w8EA4YJYVL4OQhVXkfF2NUaZifAPeCcVxkwScLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:19:43.214308Z"},"content_sha256":"ca9919e747b8bc37cd1bbd56541586c25d51066db2a654a2e225615a247c2967","schema_version":"1.0","event_id":"sha256:ca9919e747b8bc37cd1bbd56541586c25d51066db2a654a2e225615a247c2967"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCFFQUON4M7RTCKMYAGDCIRZV5/bundle.json","state_url":"https://pith.science/pith/HCFFQUON4M7RTCKMYAGDCIRZV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCFFQUON4M7RTCKMYAGDCIRZV5/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-01T22:19:43Z","links":{"resolver":"https://pith.science/pith/HCFFQUON4M7RTCKMYAGDCIRZV5","bundle":"https://pith.science/pith/HCFFQUON4M7RTCKMYAGDCIRZV5/bundle.json","state":"https://pith.science/pith/HCFFQUON4M7RTCKMYAGDCIRZV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCFFQUON4M7RTCKMYAGDCIRZV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HCFFQUON4M7RTCKMYAGDCIRZV5","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":"67fdc166b20234a1624bcdfcca9a7438849e05f1f019634e1b544641bf532a23","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-16T12:12:22Z","title_canon_sha256":"79952c310656c6372b0510eecdea52139675c215564740b0063917857fbea4e5"},"schema_version":"1.0","source":{"id":"1702.04939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04939","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04939v1","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04939","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"HCFFQUON4M7R","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HCFFQUON4M7RTCKM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HCFFQUON","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:ca9919e747b8bc37cd1bbd56541586c25d51066db2a654a2e225615a247c2967","target":"graph","created_at":"2026-05-18T00:50:36Z","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 consider a network of agents monitoring a spatially distributed arrival process. Each node measures the number of arrivals seen at its monitoring point in a given time-interval with the objective of estimating the unknown local arrival rate. We propose an asynchronous distributed approach based on a Bayesian model with unknown hyperparameter, where each node computes the minimum mean square error (MMSE) estimator of its local arrival rate in a distributed way. As a result, the estimation at each node \"optimally\" fuses the information from the whole network through a distribute","authors_text":"Angelo Coluccia, Giuseppe Notarstefano","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-16T12:12:22Z","title":"A Bayesian framework for distributed estimation of arrival rates in asynchronous networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04939","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:8eb4323a1c8c177e3c9734fb10f3484d2c8a0456c484705c9df8e9014a800a5d","target":"record","created_at":"2026-05-18T00:50:36Z","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":"67fdc166b20234a1624bcdfcca9a7438849e05f1f019634e1b544641bf532a23","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-16T12:12:22Z","title_canon_sha256":"79952c310656c6372b0510eecdea52139675c215564740b0063917857fbea4e5"},"schema_version":"1.0","source":{"id":"1702.04939","kind":"arxiv","version":1}},"canonical_sha256":"388a5851cde33f19894cc00c312239af5061604e812d044d976af9406f381d15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"388a5851cde33f19894cc00c312239af5061604e812d044d976af9406f381d15","first_computed_at":"2026-05-18T00:50:36.710535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:36.710535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YZltmCec9vY7X0jdrTQYu8UB8JIVhglehBhNUxjpkV5kcmQGSjw6+wa8g20puyhsfk2L1SbrsGlbFz5K19TvCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:36.711095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eb4323a1c8c177e3c9734fb10f3484d2c8a0456c484705c9df8e9014a800a5d","sha256:ca9919e747b8bc37cd1bbd56541586c25d51066db2a654a2e225615a247c2967"],"state_sha256":"cbc78253966858a9cd3c95caebb7720a50f1d2f63fe0192fcc175436052a2a01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85Npr8npP6J9UJ6+GK+8cQRucs8uyFhHyts62V6MxprSC5vNAGQFYCEBoSCM+7GwUv/Sa9/EzXuwIzW8hmfXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:19:43.216350Z","bundle_sha256":"33d42652ec9a7fe1a74e44f2661403efb95fc49daa4d8f50aa056075810890a1"}}