{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:N2XTKL73LQFADDGQE5STP5RLFQ","short_pith_number":"pith:N2XTKL73","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"},"canonical_sha256":"6eaf352ffb5c0a018cd0276537f62b2c123ff82f617a3b1c1b7b906897657d1e","source":{"kind":"arxiv","id":"1911.06869","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06869","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06869v3","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06869","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"pith_short_12","alias_value":"N2XTKL73LQFA","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"pith_short_16","alias_value":"N2XTKL73LQFADDGQ","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"pith_short_8","alias_value":"N2XTKL73","created_at":"2026-07-05T10:09:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:N2XTKL73LQFADDGQE5STP5RLFQ","target":"record","payload":{"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"},"canonical_sha256":"6eaf352ffb5c0a018cd0276537f62b2c123ff82f617a3b1c1b7b906897657d1e","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"},"source_kind":"arxiv","source_id":"1911.06869","source_version":3,"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-07-05T10:09:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Po4Gm0IxnlT4dAis/ZzwDVK8bUfeH4hibyIxMbo4OO10kVqZrYND7VT8v5dQBm7/bNmrb/LBm2mMZENqvGL1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T14:36:03.874761Z"},"content_sha256":"b786fe0f41b2e977a852f05963b5c05246729ca0910e45b92f56aa0dfc2b8f75","schema_version":"1.0","event_id":"sha256:b786fe0f41b2e977a852f05963b5c05246729ca0910e45b92f56aa0dfc2b8f75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:N2XTKL73LQFADDGQE5STP5RLFQ","target":"graph","payload":{"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"},"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-07-05T10:09:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zcv1ipzTZM6UC+pAm/Cu6//MXOg52rc7TLB1wfbxHXeO0YU7oMqf9y2RHqk0ip9g/xBPfb1TnrWDcvZb7u4hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T14:36:03.875137Z"},"content_sha256":"66f1b154f9516ecd4bec14bf6a95ecd8f21e28f54ac7880d0840c890d6449bdc","schema_version":"1.0","event_id":"sha256:66f1b154f9516ecd4bec14bf6a95ecd8f21e28f54ac7880d0840c890d6449bdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ/bundle.json","state_url":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2XTKL73LQFADDGQE5STP5RLFQ/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-07-17T14:36:03Z","links":{"resolver":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ","bundle":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ/bundle.json","state":"https://pith.science/pith/N2XTKL73LQFADDGQE5STP5RLFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2XTKL73LQFADDGQE5STP5RLFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N2XTKL73LQFADDGQE5STP5RLFQ","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":"4e0526b6e20675a35ed3e003516d599b809ba98d8e6958946c533d38a2ba640a","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2019-11-15T20:50:22Z","title_canon_sha256":"ac7e25961ed4ebd300185864184aca71b4850df5fa7ba188e6e2b3666a218aa1"},"schema_version":"1.0","source":{"id":"1911.06869","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06869","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06869v3","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06869","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"pith_short_12","alias_value":"N2XTKL73LQFA","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"pith_short_16","alias_value":"N2XTKL73LQFADDGQ","created_at":"2026-07-05T10:09:37Z"},{"alias_kind":"pith_short_8","alias_value":"N2XTKL73","created_at":"2026-07-05T10:09:37Z"}],"graph_snapshots":[{"event_id":"sha256:66f1b154f9516ecd4bec14bf6a95ecd8f21e28f54ac7880d0840c890d6449bdc","target":"graph","created_at":"2026-07-05T10:09:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.06869/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Kaustav Chakraborty, Somnath Bhadra, Soumendra Lahiri, Srijan Sengupta","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2019-11-15T20:50:22Z","title":"A Bootstrap-based Method for Testing Network Similarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06869","kind":"arxiv","version":3},"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:b786fe0f41b2e977a852f05963b5c05246729ca0910e45b92f56aa0dfc2b8f75","target":"record","created_at":"2026-07-05T10:09:37Z","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":"4e0526b6e20675a35ed3e003516d599b809ba98d8e6958946c533d38a2ba640a","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2019-11-15T20:50:22Z","title_canon_sha256":"ac7e25961ed4ebd300185864184aca71b4850df5fa7ba188e6e2b3666a218aa1"},"schema_version":"1.0","source":{"id":"1911.06869","kind":"arxiv","version":3}},"canonical_sha256":"6eaf352ffb5c0a018cd0276537f62b2c123ff82f617a3b1c1b7b906897657d1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eaf352ffb5c0a018cd0276537f62b2c123ff82f617a3b1c1b7b906897657d1e","first_computed_at":"2026-07-05T10:09:37.838230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:37.838230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jsxTgf6XTqv/yvT6Z3oEG1CXQPffqvKY+ba17mhvXd3E7rdmmtKPwE5+umcn28zu/0qDpKPqJAj3q2ZDtQ3/Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:37.838661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.06869","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b786fe0f41b2e977a852f05963b5c05246729ca0910e45b92f56aa0dfc2b8f75","sha256:66f1b154f9516ecd4bec14bf6a95ecd8f21e28f54ac7880d0840c890d6449bdc"],"state_sha256":"fd2a3ea412cdf9bcedca238d608d5244c3dc88a2c5d4da0a629e0c76b9f8da87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfzYbwQJ2PMtrY1Eetya3UYemXzL+BqD7M4LLuB0Vz1oioJzVbO7JaD4+u54rI7Mb4bsFPceWG8UGFxXEbLiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T14:36:03.877374Z","bundle_sha256":"b107718a6252a53014e7ed329297cd5590ed76dd175d577ec10014d3aef4514c"}}