{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:F3D7D3HIVPCCRDILNDWOE2XMYY","short_pith_number":"pith:F3D7D3HI","canonical_record":{"source":{"id":"2002.01648","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T05:24:54Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"9d56a2dd852aebecfd40cecb1de393ae7e42895a5e324614cb137302c81c7457","abstract_canon_sha256":"33924eb120fc9a1dadad039a7d87b71eaf5fbdcbdb66e9e6e10a47888d300075"},"schema_version":"1.0"},"canonical_sha256":"2ec7f1ece8abc4288d0b68ece26aecc6350cb3d30639408c9c07c574e4683a9d","source":{"kind":"arxiv","id":"2002.01648","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.01648","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"2002.01648v3","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01648","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"F3D7D3HIVPCC","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"pith_short_16","alias_value":"F3D7D3HIVPCCRDIL","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"pith_short_8","alias_value":"F3D7D3HI","created_at":"2026-07-05T02:30:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:F3D7D3HIVPCCRDILNDWOE2XMYY","target":"record","payload":{"canonical_record":{"source":{"id":"2002.01648","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T05:24:54Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"9d56a2dd852aebecfd40cecb1de393ae7e42895a5e324614cb137302c81c7457","abstract_canon_sha256":"33924eb120fc9a1dadad039a7d87b71eaf5fbdcbdb66e9e6e10a47888d300075"},"schema_version":"1.0"},"canonical_sha256":"2ec7f1ece8abc4288d0b68ece26aecc6350cb3d30639408c9c07c574e4683a9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:56.749583Z","signature_b64":"2fHmqHI5XosRN8BKf5DpToxeHSzf4+E2AFe+01nDLeuFi6sRcJPbrJRRpj5LZDoh2+Bm1iqR/0I8Usg2qkNdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ec7f1ece8abc4288d0b68ece26aecc6350cb3d30639408c9c07c574e4683a9d","last_reissued_at":"2026-07-05T02:30:56.749103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:56.749103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.01648","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-05T02:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0D0bxerFPtfbx1qrAA+XLPmblrEqtOYrHXm/BAEbMz5j+YpqrJiyJBerTqUVadR7d31lkL2rGwQKuMTuTUJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:23:03.565874Z"},"content_sha256":"b07b551dddb98f4888a5e70d40f103ae89eaa8372e30e05c79625e5a679b7c14","schema_version":"1.0","event_id":"sha256:b07b551dddb98f4888a5e70d40f103ae89eaa8372e30e05c79625e5a679b7c14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:F3D7D3HIVPCCRDILNDWOE2XMYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, Jes\\'us Arroyo, Vince Lyzinski","submitted_at":"2020-02-05T05:24:54Z","abstract_excerpt":"Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly formulated as minimizing their edge disagreements. In this paper, we address the common setting in which one of the graphs to match is a bipartite network and one is unipartite. Commonly, the bipartite networks are collapsed or projected into a unipartite graph, and graph matching proceeds as in the classical setting. This potentially leads to noisy edge estimates and loss of information. We formulate the graph matc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01648","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/2002.01648/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-05T02:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwbFhmyTz3lD8Eq4Bdroxo92KV9x1fXaklOPeLfOXNhLEDpW3HtuOH8SHlet/UUup4ejPETnQteL/MhMPZP4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:23:03.566347Z"},"content_sha256":"83ffbfadbca72368c30b72e26d5a0b615ff481b64ac92b641f426583a0f23870","schema_version":"1.0","event_id":"sha256:83ffbfadbca72368c30b72e26d5a0b615ff481b64ac92b641f426583a0f23870"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3D7D3HIVPCCRDILNDWOE2XMYY/bundle.json","state_url":"https://pith.science/pith/F3D7D3HIVPCCRDILNDWOE2XMYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3D7D3HIVPCCRDILNDWOE2XMYY/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-06T19:23:03Z","links":{"resolver":"https://pith.science/pith/F3D7D3HIVPCCRDILNDWOE2XMYY","bundle":"https://pith.science/pith/F3D7D3HIVPCCRDILNDWOE2XMYY/bundle.json","state":"https://pith.science/pith/F3D7D3HIVPCCRDILNDWOE2XMYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3D7D3HIVPCCRDILNDWOE2XMYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:F3D7D3HIVPCCRDILNDWOE2XMYY","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":"33924eb120fc9a1dadad039a7d87b71eaf5fbdcbdb66e9e6e10a47888d300075","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T05:24:54Z","title_canon_sha256":"9d56a2dd852aebecfd40cecb1de393ae7e42895a5e324614cb137302c81c7457"},"schema_version":"1.0","source":{"id":"2002.01648","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.01648","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"2002.01648v3","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01648","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"F3D7D3HIVPCC","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"pith_short_16","alias_value":"F3D7D3HIVPCCRDIL","created_at":"2026-07-05T02:30:56Z"},{"alias_kind":"pith_short_8","alias_value":"F3D7D3HI","created_at":"2026-07-05T02:30:56Z"}],"graph_snapshots":[{"event_id":"sha256:83ffbfadbca72368c30b72e26d5a0b615ff481b64ac92b641f426583a0f23870","target":"graph","created_at":"2026-07-05T02:30:56Z","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/2002.01648/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly formulated as minimizing their edge disagreements. In this paper, we address the common setting in which one of the graphs to match is a bipartite network and one is unipartite. Commonly, the bipartite networks are collapsed or projected into a unipartite graph, and graph matching proceeds as in the classical setting. This potentially leads to noisy edge estimates and loss of information. We formulate the graph matc","authors_text":"Carey E. Priebe, Jes\\'us Arroyo, Vince Lyzinski","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T05:24:54Z","title":"Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01648","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:b07b551dddb98f4888a5e70d40f103ae89eaa8372e30e05c79625e5a679b7c14","target":"record","created_at":"2026-07-05T02:30:56Z","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":"33924eb120fc9a1dadad039a7d87b71eaf5fbdcbdb66e9e6e10a47888d300075","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T05:24:54Z","title_canon_sha256":"9d56a2dd852aebecfd40cecb1de393ae7e42895a5e324614cb137302c81c7457"},"schema_version":"1.0","source":{"id":"2002.01648","kind":"arxiv","version":3}},"canonical_sha256":"2ec7f1ece8abc4288d0b68ece26aecc6350cb3d30639408c9c07c574e4683a9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ec7f1ece8abc4288d0b68ece26aecc6350cb3d30639408c9c07c574e4683a9d","first_computed_at":"2026-07-05T02:30:56.749103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:30:56.749103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2fHmqHI5XosRN8BKf5DpToxeHSzf4+E2AFe+01nDLeuFi6sRcJPbrJRRpj5LZDoh2+Bm1iqR/0I8Usg2qkNdDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:30:56.749583Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.01648","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b07b551dddb98f4888a5e70d40f103ae89eaa8372e30e05c79625e5a679b7c14","sha256:83ffbfadbca72368c30b72e26d5a0b615ff481b64ac92b641f426583a0f23870"],"state_sha256":"bbbf4dc0bf874dbd221c72ef725c1423042ed46da9ba4760d858ef2be49082e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GS1er3OSV/qLCcZjtOMfFXpodCXtSt/3PO+sMK7/eVr3bzfKFOi3OhsCOXEdFDdtqdngBqLaZcWpqAmBVm9XAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:23:03.568193Z","bundle_sha256":"25ae86a14868b5b2bc467deb567d6c306b7f55f1a8fe20359761af0deb5a6526"}}