{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EW52PB35WKJVB3R7Q2HVSCKBIT","short_pith_number":"pith:EW52PB35","schema_version":"1.0","canonical_sha256":"25bba7877db29350ee3f868f59094144e2224a11df3f93c290ae795574b7066b","source":{"kind":"arxiv","id":"1306.4508","version":1},"attestation_state":"computed","paper":{"title":"Computational Methods for a Class of Network Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ajay Jasra, Junshan Wang, Maria De Iorio","submitted_at":"2013-06-19T12:04:02Z","abstract_excerpt":"In the following article we provide an exposition of exact computational methods to perform parameter inference from partially observed network models. In particular, we consider the duplication attachment (DA) model which has a likelihood function that typically cannot be evaluated in any reasonable computational time. We consider a number of importance sampling (IS) and sequential Monte Carlo (SMC) methods for approximating the likelihood of the network model for a fixed parameter value. It is well-known that for IS, the relative variance of the likelihood estimate typically grows at an expo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1306.4508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-06-19T12:04:02Z","cross_cats_sorted":[],"title_canon_sha256":"40c812b5f630e2c6bd257589ad61f5c5990238f683aa4c0d0e31e3d02382fbcd","abstract_canon_sha256":"132759dc9ff9bbe54de9264e430afc124d3b35adb59079bd988a0dac5cb39bd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:34.212807Z","signature_b64":"hsItXQPtGFOur+q7U9FacTNxeb4aWOM5eWldt7fQuYMiQfAMc/g6lO2uQUvrESrHXWvr3g5Q+gqmAOUBvV0jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25bba7877db29350ee3f868f59094144e2224a11df3f93c290ae795574b7066b","last_reissued_at":"2026-05-18T03:20:34.212018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:34.212018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Methods for a Class of Network Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ajay Jasra, Junshan Wang, Maria De Iorio","submitted_at":"2013-06-19T12:04:02Z","abstract_excerpt":"In the following article we provide an exposition of exact computational methods to perform parameter inference from partially observed network models. In particular, we consider the duplication attachment (DA) model which has a likelihood function that typically cannot be evaluated in any reasonable computational time. We consider a number of importance sampling (IS) and sequential Monte Carlo (SMC) methods for approximating the likelihood of the network model for a fixed parameter value. It is well-known that for IS, the relative variance of the likelihood estimate typically grows at an expo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4508","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.4508","created_at":"2026-05-18T03:20:34.212122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4508v1","created_at":"2026-05-18T03:20:34.212122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4508","created_at":"2026-05-18T03:20:34.212122+00:00"},{"alias_kind":"pith_short_12","alias_value":"EW52PB35WKJV","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EW52PB35WKJVB3R7","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EW52PB35","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EW52PB35WKJVB3R7Q2HVSCKBIT","json":"https://pith.science/pith/EW52PB35WKJVB3R7Q2HVSCKBIT.json","graph_json":"https://pith.science/api/pith-number/EW52PB35WKJVB3R7Q2HVSCKBIT/graph.json","events_json":"https://pith.science/api/pith-number/EW52PB35WKJVB3R7Q2HVSCKBIT/events.json","paper":"https://pith.science/paper/EW52PB35"},"agent_actions":{"view_html":"https://pith.science/pith/EW52PB35WKJVB3R7Q2HVSCKBIT","download_json":"https://pith.science/pith/EW52PB35WKJVB3R7Q2HVSCKBIT.json","view_paper":"https://pith.science/paper/EW52PB35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4508&json=true","fetch_graph":"https://pith.science/api/pith-number/EW52PB35WKJVB3R7Q2HVSCKBIT/graph.json","fetch_events":"https://pith.science/api/pith-number/EW52PB35WKJVB3R7Q2HVSCKBIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EW52PB35WKJVB3R7Q2HVSCKBIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EW52PB35WKJVB3R7Q2HVSCKBIT/action/storage_attestation","attest_author":"https://pith.science/pith/EW52PB35WKJVB3R7Q2HVSCKBIT/action/author_attestation","sign_citation":"https://pith.science/pith/EW52PB35WKJVB3R7Q2HVSCKBIT/action/citation_signature","submit_replication":"https://pith.science/pith/EW52PB35WKJVB3R7Q2HVSCKBIT/action/replication_record"}},"created_at":"2026-05-18T03:20:34.212122+00:00","updated_at":"2026-05-18T03:20:34.212122+00:00"}