{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CJO5YO4JWGX4QSCCTGI6VV34CK","short_pith_number":"pith:CJO5YO4J","canonical_record":{"source":{"id":"1510.07158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-24T16:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"a3439f03152d89009e4838daf9463b252bb91bc05e493256cbbd1138cc211d66","abstract_canon_sha256":"1f7c603c6db4ea83f76214b0ccc147a6142d893507712c2da478631439ad950e"},"schema_version":"1.0"},"canonical_sha256":"125ddc3b89b1afc848429991ead77c12b408e7497d0b7cf7cf56f03e01fb24dc","source":{"kind":"arxiv","id":"1510.07158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07158","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07158v1","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07158","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"pith_short_12","alias_value":"CJO5YO4JWGX4","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CJO5YO4JWGX4QSCC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CJO5YO4J","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CJO5YO4JWGX4QSCCTGI6VV34CK","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-24T16:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"a3439f03152d89009e4838daf9463b252bb91bc05e493256cbbd1138cc211d66","abstract_canon_sha256":"1f7c603c6db4ea83f76214b0ccc147a6142d893507712c2da478631439ad950e"},"schema_version":"1.0"},"canonical_sha256":"125ddc3b89b1afc848429991ead77c12b408e7497d0b7cf7cf56f03e01fb24dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:19.881167Z","signature_b64":"UabP1Xbca7qcT4aLIQ/5atxWLfeh6K50bmyevW9ITy4dMkez4W+jJtZmR8aULT4Z3MSBm8oMIf8slujWX8HtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"125ddc3b89b1afc848429991ead77c12b408e7497d0b7cf7cf56f03e01fb24dc","last_reissued_at":"2026-05-18T01:29:19.880515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:19.880515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07158","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:29:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/bLUZQtH6lWM9BQghomW8yovEx8vDN6IiOkR72qzNDh62HMp8rddqpPgEeb3jKvuudIVnvZzcKlgtiMuorhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:21:20.363367Z"},"content_sha256":"b744053f75ed7045a284048081b9e4b2e1b1d2a94a7a22c3f500e84e707dec67","schema_version":"1.0","event_id":"sha256:b744053f75ed7045a284048081b9e4b2e1b1d2a94a7a22c3f500e84e707dec67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CJO5YO4JWGX4QSCCTGI6VV34CK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Parameter Estimation in Loss Tomography for Networks of General Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jun S. Liu, Ke Deng, Weiping Zhu, Yang Li","submitted_at":"2015-10-24T16:22:36Z","abstract_excerpt":"As a technique to investigate link-level loss rates of a computer network with low operational cost, loss tomography has received considerable attentions in recent years. A number of parameter estimation methods have been proposed for loss tomography of networks with a tree structure as well as a general topological structure. However, these methods suffer from either high computational cost or insufficient use of information in the data. In this paper, we provide both theoretical results and practical algorithms for parameter estimation in loss tomography. By introducing a group of novel stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07158","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:29:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyXhfIVn5uPHRgzFuuf2uJY22C9gj+PeK6nZd7RUWiDRjk7aDSPuElAR8ONfM0j/lcp5KbmAT+C8Vgi5qsNxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:21:20.363770Z"},"content_sha256":"fb643e4c1abd7f85154aaedc7868e910458bd44cab442a0f71f1ce770cd7455e","schema_version":"1.0","event_id":"sha256:fb643e4c1abd7f85154aaedc7868e910458bd44cab442a0f71f1ce770cd7455e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJO5YO4JWGX4QSCCTGI6VV34CK/bundle.json","state_url":"https://pith.science/pith/CJO5YO4JWGX4QSCCTGI6VV34CK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJO5YO4JWGX4QSCCTGI6VV34CK/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-05T19:21:20Z","links":{"resolver":"https://pith.science/pith/CJO5YO4JWGX4QSCCTGI6VV34CK","bundle":"https://pith.science/pith/CJO5YO4JWGX4QSCCTGI6VV34CK/bundle.json","state":"https://pith.science/pith/CJO5YO4JWGX4QSCCTGI6VV34CK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJO5YO4JWGX4QSCCTGI6VV34CK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CJO5YO4JWGX4QSCCTGI6VV34CK","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":"1f7c603c6db4ea83f76214b0ccc147a6142d893507712c2da478631439ad950e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-24T16:22:36Z","title_canon_sha256":"a3439f03152d89009e4838daf9463b252bb91bc05e493256cbbd1138cc211d66"},"schema_version":"1.0","source":{"id":"1510.07158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07158","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07158v1","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07158","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"pith_short_12","alias_value":"CJO5YO4JWGX4","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CJO5YO4JWGX4QSCC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CJO5YO4J","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:fb643e4c1abd7f85154aaedc7868e910458bd44cab442a0f71f1ce770cd7455e","target":"graph","created_at":"2026-05-18T01:29:19Z","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":"As a technique to investigate link-level loss rates of a computer network with low operational cost, loss tomography has received considerable attentions in recent years. A number of parameter estimation methods have been proposed for loss tomography of networks with a tree structure as well as a general topological structure. However, these methods suffer from either high computational cost or insufficient use of information in the data. In this paper, we provide both theoretical results and practical algorithms for parameter estimation in loss tomography. By introducing a group of novel stat","authors_text":"Jun S. Liu, Ke Deng, Weiping Zhu, Yang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-24T16:22:36Z","title":"Fast Parameter Estimation in Loss Tomography for Networks of General Topology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07158","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:b744053f75ed7045a284048081b9e4b2e1b1d2a94a7a22c3f500e84e707dec67","target":"record","created_at":"2026-05-18T01:29:19Z","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":"1f7c603c6db4ea83f76214b0ccc147a6142d893507712c2da478631439ad950e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-10-24T16:22:36Z","title_canon_sha256":"a3439f03152d89009e4838daf9463b252bb91bc05e493256cbbd1138cc211d66"},"schema_version":"1.0","source":{"id":"1510.07158","kind":"arxiv","version":1}},"canonical_sha256":"125ddc3b89b1afc848429991ead77c12b408e7497d0b7cf7cf56f03e01fb24dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"125ddc3b89b1afc848429991ead77c12b408e7497d0b7cf7cf56f03e01fb24dc","first_computed_at":"2026-05-18T01:29:19.880515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:19.880515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UabP1Xbca7qcT4aLIQ/5atxWLfeh6K50bmyevW9ITy4dMkez4W+jJtZmR8aULT4Z3MSBm8oMIf8slujWX8HtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:19.881167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b744053f75ed7045a284048081b9e4b2e1b1d2a94a7a22c3f500e84e707dec67","sha256:fb643e4c1abd7f85154aaedc7868e910458bd44cab442a0f71f1ce770cd7455e"],"state_sha256":"4be8ab004e2d020fc80906f8c5c3af0cd043103009dd3d382f9d8a5cad7086fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qXobLL6eSuRMDdI/+h3W+meTVG5zhgnUSenTe7X+bCmyY5h4XtS7NSm3BY3nrg2vyhCV3uC43eNt5cNfoiHuCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:21:20.370189Z","bundle_sha256":"6c0bba3e3c5900252cc4a88095cb32955728582fcca3981d08fb7717026b52ec"}}