{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2RD272AHCJH2ASSUR7ES7MCIE3","short_pith_number":"pith:2RD272AH","schema_version":"1.0","canonical_sha256":"d447afe807124fa04a548fc92fb04826f39fb4a0471e8767ade3f7f75c408202","source":{"kind":"arxiv","id":"2401.15031","version":2},"attestation_state":"computed","paper":{"title":"Tensor product algorithms for inference of contact network from epidemiological data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA","math.PR","physics.soc-ph"],"primary_cat":"stat.CO","authors_text":"Dmitry Savostyanov, Sergey Dolgov","submitted_at":"2024-01-26T17:44:53Z","abstract_excerpt":"We consider a problem of inferring contact network from nodal states observed during an epidemiological process. In a black--box Bayesian optimisation framework this problem reduces to a discrete likelihood optimisation over the set of possible networks. The cardinality of this set grows combinatorially with the number of network nodes, which makes this optimisation computationally challenging. For each network, its likelihood is the probability for the observed data to appear during the evolution of the epidemiological process on this network. This probability can be very small, particularly "},"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":"2401.15031","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2024-01-26T17:44:53Z","cross_cats_sorted":["cs.NA","math.NA","math.PR","physics.soc-ph"],"title_canon_sha256":"94713a4977dc37f493c771a265887db591851b97da1b17869f56b1cdac84902e","abstract_canon_sha256":"834f3a5c81fc8a40afdde9d8ace784ea7e109c7107d98e539ad0e2f8881899f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:56.117479Z","signature_b64":"44umKhzo6ytbhB2mWmjufVRjDvivaXsq31Ogo1NlEWzmTk7GRqsQUmlyImTBZZIJ1mzW7k/EVxBWik2xPd+pDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d447afe807124fa04a548fc92fb04826f39fb4a0471e8767ade3f7f75c408202","last_reissued_at":"2026-07-05T09:02:56.116921Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:56.116921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor product algorithms for inference of contact network from epidemiological data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA","math.PR","physics.soc-ph"],"primary_cat":"stat.CO","authors_text":"Dmitry Savostyanov, Sergey Dolgov","submitted_at":"2024-01-26T17:44:53Z","abstract_excerpt":"We consider a problem of inferring contact network from nodal states observed during an epidemiological process. In a black--box Bayesian optimisation framework this problem reduces to a discrete likelihood optimisation over the set of possible networks. The cardinality of this set grows combinatorially with the number of network nodes, which makes this optimisation computationally challenging. For each network, its likelihood is the probability for the observed data to appear during the evolution of the epidemiological process on this network. This probability can be very small, particularly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15031","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.15031/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.15031","created_at":"2026-07-05T09:02:56.116979+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.15031v2","created_at":"2026-07-05T09:02:56.116979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15031","created_at":"2026-07-05T09:02:56.116979+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RD272AHCJH2","created_at":"2026-07-05T09:02:56.116979+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RD272AHCJH2ASSU","created_at":"2026-07-05T09:02:56.116979+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RD272AH","created_at":"2026-07-05T09:02:56.116979+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13364","citing_title":"Effective dimensional reduction of complex systems based on tensor networks","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RD272AHCJH2ASSUR7ES7MCIE3","json":"https://pith.science/pith/2RD272AHCJH2ASSUR7ES7MCIE3.json","graph_json":"https://pith.science/api/pith-number/2RD272AHCJH2ASSUR7ES7MCIE3/graph.json","events_json":"https://pith.science/api/pith-number/2RD272AHCJH2ASSUR7ES7MCIE3/events.json","paper":"https://pith.science/paper/2RD272AH"},"agent_actions":{"view_html":"https://pith.science/pith/2RD272AHCJH2ASSUR7ES7MCIE3","download_json":"https://pith.science/pith/2RD272AHCJH2ASSUR7ES7MCIE3.json","view_paper":"https://pith.science/paper/2RD272AH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.15031&json=true","fetch_graph":"https://pith.science/api/pith-number/2RD272AHCJH2ASSUR7ES7MCIE3/graph.json","fetch_events":"https://pith.science/api/pith-number/2RD272AHCJH2ASSUR7ES7MCIE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RD272AHCJH2ASSUR7ES7MCIE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RD272AHCJH2ASSUR7ES7MCIE3/action/storage_attestation","attest_author":"https://pith.science/pith/2RD272AHCJH2ASSUR7ES7MCIE3/action/author_attestation","sign_citation":"https://pith.science/pith/2RD272AHCJH2ASSUR7ES7MCIE3/action/citation_signature","submit_replication":"https://pith.science/pith/2RD272AHCJH2ASSUR7ES7MCIE3/action/replication_record"}},"created_at":"2026-07-05T09:02:56.116979+00:00","updated_at":"2026-07-05T09:02:56.116979+00:00"}