{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N2XTKL73LQFADDGQE5STP5RLFQ","short_pith_number":"pith:N2XTKL73","schema_version":"1.0","canonical_sha256":"6eaf352ffb5c0a018cd0276537f62b2c123ff82f617a3b1c1b7b906897657d1e","source":{"kind":"arxiv","id":"1911.06869","version":3},"attestation_state":"computed","paper":{"title":"A Bootstrap-based Method for Testing Network Similarity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Kaustav Chakraborty, Somnath Bhadra, Soumendra Lahiri, Srijan Sengupta","submitted_at":"2019-11-15T20:50:22Z","abstract_excerpt":"This paper studies the matched network inference problem, where the goal is to determine if two networks, defined on a common set of nodes, exhibit a specific form of stochastic similarity. Two notions of similarity are considered: (i) equality, i.e., testing whether the networks arise from the same random graph model, and (ii) scaling, i.e., testing whether their probability matrices are proportional for some unknown scaling constant. We develop a testing framework based on a parametric bootstrap approach and a Frobenius norm-based test statistic. The proposed approach is highly versatile as "},"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":"1911.06869","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2019-11-15T20:50:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ac7e25961ed4ebd300185864184aca71b4850df5fa7ba188e6e2b3666a218aa1","abstract_canon_sha256":"4e0526b6e20675a35ed3e003516d599b809ba98d8e6958946c533d38a2ba640a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:37.838661Z","signature_b64":"jsxTgf6XTqv/yvT6Z3oEG1CXQPffqvKY+ba17mhvXd3E7rdmmtKPwE5+umcn28zu/0qDpKPqJAj3q2ZDtQ3/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eaf352ffb5c0a018cd0276537f62b2c123ff82f617a3b1c1b7b906897657d1e","last_reissued_at":"2026-07-05T10:09:37.838230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:37.838230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bootstrap-based Method for Testing Network Similarity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Kaustav Chakraborty, Somnath Bhadra, Soumendra Lahiri, Srijan Sengupta","submitted_at":"2019-11-15T20:50:22Z","abstract_excerpt":"This paper studies the matched network inference problem, where the goal is to determine if two networks, defined on a common set of nodes, exhibit a specific form of stochastic similarity. Two notions of similarity are considered: (i) equality, i.e., testing whether the networks arise from the same random graph model, and (ii) scaling, i.e., testing whether their probability matrices are proportional for some unknown scaling constant. We develop a testing framework based on a parametric bootstrap approach and a Frobenius norm-based test statistic. The proposed approach is highly versatile as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06869","kind":"arxiv","version":3},"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/1911.06869/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":"1911.06869","created_at":"2026-07-05T10:09:37.838286+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.06869v3","created_at":"2026-07-05T10:09:37.838286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06869","created_at":"2026-07-05T10:09:37.838286+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2XTKL73LQFA","created_at":"2026-07-05T10:09:37.838286+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2XTKL73LQFADDGQ","created_at":"2026-07-05T10:09:37.838286+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2XTKL73","created_at":"2026-07-05T10:09:37.838286+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06482","citing_title":"Two-Sample Hypothesis Testing for Subspace Equality in Network Data","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ","json":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ.json","graph_json":"https://pith.science/api/pith-number/N2XTKL73LQFADDGQE5STP5RLFQ/graph.json","events_json":"https://pith.science/api/pith-number/N2XTKL73LQFADDGQE5STP5RLFQ/events.json","paper":"https://pith.science/paper/N2XTKL73"},"agent_actions":{"view_html":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ","download_json":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ.json","view_paper":"https://pith.science/paper/N2XTKL73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.06869&json=true","fetch_graph":"https://pith.science/api/pith-number/N2XTKL73LQFADDGQE5STP5RLFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/N2XTKL73LQFADDGQE5STP5RLFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ/action/storage_attestation","attest_author":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ/action/author_attestation","sign_citation":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ/action/citation_signature","submit_replication":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ/action/replication_record"}},"created_at":"2026-07-05T10:09:37.838286+00:00","updated_at":"2026-07-05T10:09:37.838286+00:00"}