{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OKUH5ADVYN6I3TDF3K3Y34RJD5","short_pith_number":"pith:OKUH5ADV","canonical_record":{"source":{"id":"1708.07352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2017-08-24T10:55:55Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"2140e0afbc218eba854cf0ebdf4bf1f678acf76ef9e70d12c53fdf10f7824f4f","abstract_canon_sha256":"0519b3a5f1a4027fe8ab4e3ddf8253b30356c2dc07205393f88b16b63c8c4da8"},"schema_version":"1.0"},"canonical_sha256":"72a87e8075c37c8dcc65dab78df2291f6fb6c0bcfcc95eedf60528fc7bf9e757","source":{"kind":"arxiv","id":"1708.07352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07352","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07352v1","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07352","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"OKUH5ADVYN6I","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKUH5ADVYN6I3TDF","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKUH5ADV","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OKUH5ADVYN6I3TDF3K3Y34RJD5","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2017-08-24T10:55:55Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"2140e0afbc218eba854cf0ebdf4bf1f678acf76ef9e70d12c53fdf10f7824f4f","abstract_canon_sha256":"0519b3a5f1a4027fe8ab4e3ddf8253b30356c2dc07205393f88b16b63c8c4da8"},"schema_version":"1.0"},"canonical_sha256":"72a87e8075c37c8dcc65dab78df2291f6fb6c0bcfcc95eedf60528fc7bf9e757","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:46.465366Z","signature_b64":"+d7dGnq3JDF6093ypE35gP9yH4aMtwcY6ZzRjzx1+GWpSF5z1vKgAfpt/A6V6fbVohQYdVKLap9N6DzZ70lqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72a87e8075c37c8dcc65dab78df2291f6fb6c0bcfcc95eedf60528fc7bf9e757","last_reissued_at":"2026-05-18T00:36:46.464682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:46.464682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07352","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:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4xBjqfakSTzSDnysh37ppsGz7qxXt/945PAizGQ+ibSZfZODSUMscPPzrXs38AW57w4FmEJ1Gkijerjzo+ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:21:29.692203Z"},"content_sha256":"d720d116a4ed34eab560e88a274a315f3eafbb6afd7f4488a055978f3e5f636b","schema_version":"1.0","event_id":"sha256:d720d116a4ed34eab560e88a274a315f3eafbb6afd7f4488a055978f3e5f636b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OKUH5ADVYN6I3TDF3K3Y34RJD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Identifiability of Cyclic Graphical Models of Biological Networks with Latent Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"q-bio.MN","authors_text":"Hongyu Miao, Na Lu, Yulin Wang","submitted_at":"2017-08-24T10:55:55Z","abstract_excerpt":"An efficient structural identifiability analysis algorithm is developed in this study for a broad range of network structures. The proposed method adopts the Wright's path coefficient method to generate identifiability equations in forms of symbolic polynomials, and then converts these symbolic equations to binary matrices (called identifiability matrix). Several matrix operations are introduced for identifiability matrix reduction with system equivalency maintained. Based on the reduced identifiability matrices, the structural identifiability of each parameter is determined. A number of bench"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07352","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:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bN0HtsCrJz0Qnc/ygt4j/Azg9chI7PSXrsfm4YR01jIoghVhGwDf8ZnrJIgfUJS/vKSwHYknyD5GcFJQUa40CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:21:29.692612Z"},"content_sha256":"2abbfa237376dd053d55cf7db41c7c106136c4b014d743ef52f3d805a1cb27dd","schema_version":"1.0","event_id":"sha256:2abbfa237376dd053d55cf7db41c7c106136c4b014d743ef52f3d805a1cb27dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKUH5ADVYN6I3TDF3K3Y34RJD5/bundle.json","state_url":"https://pith.science/pith/OKUH5ADVYN6I3TDF3K3Y34RJD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKUH5ADVYN6I3TDF3K3Y34RJD5/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-05-26T17:21:29Z","links":{"resolver":"https://pith.science/pith/OKUH5ADVYN6I3TDF3K3Y34RJD5","bundle":"https://pith.science/pith/OKUH5ADVYN6I3TDF3K3Y34RJD5/bundle.json","state":"https://pith.science/pith/OKUH5ADVYN6I3TDF3K3Y34RJD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKUH5ADVYN6I3TDF3K3Y34RJD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OKUH5ADVYN6I3TDF3K3Y34RJD5","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":"0519b3a5f1a4027fe8ab4e3ddf8253b30356c2dc07205393f88b16b63c8c4da8","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2017-08-24T10:55:55Z","title_canon_sha256":"2140e0afbc218eba854cf0ebdf4bf1f678acf76ef9e70d12c53fdf10f7824f4f"},"schema_version":"1.0","source":{"id":"1708.07352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07352","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07352v1","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07352","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"OKUH5ADVYN6I","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKUH5ADVYN6I3TDF","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKUH5ADV","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:2abbfa237376dd053d55cf7db41c7c106136c4b014d743ef52f3d805a1cb27dd","target":"graph","created_at":"2026-05-18T00:36:46Z","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 efficient structural identifiability analysis algorithm is developed in this study for a broad range of network structures. The proposed method adopts the Wright's path coefficient method to generate identifiability equations in forms of symbolic polynomials, and then converts these symbolic equations to binary matrices (called identifiability matrix). Several matrix operations are introduced for identifiability matrix reduction with system equivalency maintained. Based on the reduced identifiability matrices, the structural identifiability of each parameter is determined. A number of bench","authors_text":"Hongyu Miao, Na Lu, Yulin Wang","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2017-08-24T10:55:55Z","title":"Structural Identifiability of Cyclic Graphical Models of Biological Networks with Latent Variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07352","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:d720d116a4ed34eab560e88a274a315f3eafbb6afd7f4488a055978f3e5f636b","target":"record","created_at":"2026-05-18T00:36:46Z","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":"0519b3a5f1a4027fe8ab4e3ddf8253b30356c2dc07205393f88b16b63c8c4da8","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2017-08-24T10:55:55Z","title_canon_sha256":"2140e0afbc218eba854cf0ebdf4bf1f678acf76ef9e70d12c53fdf10f7824f4f"},"schema_version":"1.0","source":{"id":"1708.07352","kind":"arxiv","version":1}},"canonical_sha256":"72a87e8075c37c8dcc65dab78df2291f6fb6c0bcfcc95eedf60528fc7bf9e757","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72a87e8075c37c8dcc65dab78df2291f6fb6c0bcfcc95eedf60528fc7bf9e757","first_computed_at":"2026-05-18T00:36:46.464682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:46.464682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+d7dGnq3JDF6093ypE35gP9yH4aMtwcY6ZzRjzx1+GWpSF5z1vKgAfpt/A6V6fbVohQYdVKLap9N6DzZ70lqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:46.465366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d720d116a4ed34eab560e88a274a315f3eafbb6afd7f4488a055978f3e5f636b","sha256:2abbfa237376dd053d55cf7db41c7c106136c4b014d743ef52f3d805a1cb27dd"],"state_sha256":"f3e3e83dcc6dd35b88b1fe27ff69c83b690340401862ab16bd772d33e48f1ed0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i2w895cOAmnsFXmRXsDnnlIyrfe6n65u7hIVphi8XEdn9GvBF6ziSyW9aKTq/hVUx1I3JPYrTko3h8LApDZYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:21:29.694870Z","bundle_sha256":"4f2ff59a1b7662b7c025c728c5fb97e7d6aac65beeb487a630c519594978d73a"}}