{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R7KGCGEU3TAP55MOABQ7CYWXIZ","short_pith_number":"pith:R7KGCGEU","canonical_record":{"source":{"id":"1803.02423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-06T20:55:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d37ad323bc3f9d2eff79039e6807f04bd5f87edeb997f84da3aa80dbd3534e97","abstract_canon_sha256":"e041e4afc166dc8c068be6fd729c3987e8aa9b4410fc6d5ace305daa34a2286b"},"schema_version":"1.0"},"canonical_sha256":"8fd4611894dcc0fef58e0061f162d7464f7cecc6bc674cb5d6d2813b170be92c","source":{"kind":"arxiv","id":"1803.02423","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02423","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02423v3","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02423","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"pith_short_12","alias_value":"R7KGCGEU3TAP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R7KGCGEU3TAP55MO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R7KGCGEU","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R7KGCGEU3TAP55MOABQ7CYWXIZ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-06T20:55:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d37ad323bc3f9d2eff79039e6807f04bd5f87edeb997f84da3aa80dbd3534e97","abstract_canon_sha256":"e041e4afc166dc8c068be6fd729c3987e8aa9b4410fc6d5ace305daa34a2286b"},"schema_version":"1.0"},"canonical_sha256":"8fd4611894dcc0fef58e0061f162d7464f7cecc6bc674cb5d6d2813b170be92c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:46.817360Z","signature_b64":"jaQRxhq8uCGICNMPYifiDRzSPfOQtQGmdFGRpn5+Jls4r0jiGwmwyi9TdVKxnEvV/+uXUnGKmMcDnHaFqbjqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd4611894dcc0fef58e0061f162d7464f7cecc6bc674cb5d6d2813b170be92c","last_reissued_at":"2026-05-17T23:41:46.816682Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:46.816682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02423","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-05-17T23:41:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2C0T/oigOIOTCanjia11bjBz9cJ7cjZ6yxwTLQDYKsgZNel/ocBR7Ji3MXGaZBqH8Y0jDvYpSruyBbX5AIHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:47:15.981359Z"},"content_sha256":"f23585f04d4c58743039a8489d0f97c53e5f018e9824242a34302dec9806ae19","schema_version":"1.0","event_id":"sha256:f23585f04d4c58743039a8489d0f97c53e5f018e9824242a34302dec9806ae19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R7KGCGEU3TAP55MOABQ7CYWXIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matched Filters for Noisy Induced Subgraph Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, Daniel L. Sussman, Vince Lyzinski, Youngser Park","submitted_at":"2018-03-06T20:55:17Z","abstract_excerpt":"The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision. We propose a solution to this problem via a graph matching matched filter: centering and padding the smaller adjacency matrix and applying graph matching methods to align it to the larger network. The centering and padding schemes can be incorporated into any algorithm that matches using adjacency matrices. Under a statistical model for correlated pairs of graphs, which yie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02423","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":""},"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-05-17T23:41:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwhWcYC1tYERWhbzC0jN7jXvLS4wqktcKCXgLZYHPnsaEPianJT+RGnReLnUW2x8Vg+7m6GVDIlJIxSY+D+6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:47:15.981721Z"},"content_sha256":"d3bc42f77bc48d312f2d6a51c322db03dfa9dbc274f74ca007624c3b8ca34fdb","schema_version":"1.0","event_id":"sha256:d3bc42f77bc48d312f2d6a51c322db03dfa9dbc274f74ca007624c3b8ca34fdb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7KGCGEU3TAP55MOABQ7CYWXIZ/bundle.json","state_url":"https://pith.science/pith/R7KGCGEU3TAP55MOABQ7CYWXIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7KGCGEU3TAP55MOABQ7CYWXIZ/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-05-30T10:47:15Z","links":{"resolver":"https://pith.science/pith/R7KGCGEU3TAP55MOABQ7CYWXIZ","bundle":"https://pith.science/pith/R7KGCGEU3TAP55MOABQ7CYWXIZ/bundle.json","state":"https://pith.science/pith/R7KGCGEU3TAP55MOABQ7CYWXIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7KGCGEU3TAP55MOABQ7CYWXIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R7KGCGEU3TAP55MOABQ7CYWXIZ","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":"e041e4afc166dc8c068be6fd729c3987e8aa9b4410fc6d5ace305daa34a2286b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-06T20:55:17Z","title_canon_sha256":"d37ad323bc3f9d2eff79039e6807f04bd5f87edeb997f84da3aa80dbd3534e97"},"schema_version":"1.0","source":{"id":"1803.02423","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02423","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02423v3","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02423","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"pith_short_12","alias_value":"R7KGCGEU3TAP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R7KGCGEU3TAP55MO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R7KGCGEU","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:d3bc42f77bc48d312f2d6a51c322db03dfa9dbc274f74ca007624c3b8ca34fdb","target":"graph","created_at":"2026-05-17T23:41:46Z","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"},"paper":{"abstract_excerpt":"The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision. We propose a solution to this problem via a graph matching matched filter: centering and padding the smaller adjacency matrix and applying graph matching methods to align it to the larger network. The centering and padding schemes can be incorporated into any algorithm that matches using adjacency matrices. Under a statistical model for correlated pairs of graphs, which yie","authors_text":"Carey E. Priebe, Daniel L. Sussman, Vince Lyzinski, Youngser Park","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-06T20:55:17Z","title":"Matched Filters for Noisy Induced Subgraph Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02423","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:f23585f04d4c58743039a8489d0f97c53e5f018e9824242a34302dec9806ae19","target":"record","created_at":"2026-05-17T23:41:46Z","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":"e041e4afc166dc8c068be6fd729c3987e8aa9b4410fc6d5ace305daa34a2286b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-06T20:55:17Z","title_canon_sha256":"d37ad323bc3f9d2eff79039e6807f04bd5f87edeb997f84da3aa80dbd3534e97"},"schema_version":"1.0","source":{"id":"1803.02423","kind":"arxiv","version":3}},"canonical_sha256":"8fd4611894dcc0fef58e0061f162d7464f7cecc6bc674cb5d6d2813b170be92c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fd4611894dcc0fef58e0061f162d7464f7cecc6bc674cb5d6d2813b170be92c","first_computed_at":"2026-05-17T23:41:46.816682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:46.816682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jaQRxhq8uCGICNMPYifiDRzSPfOQtQGmdFGRpn5+Jls4r0jiGwmwyi9TdVKxnEvV/+uXUnGKmMcDnHaFqbjqAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:46.817360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02423","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f23585f04d4c58743039a8489d0f97c53e5f018e9824242a34302dec9806ae19","sha256:d3bc42f77bc48d312f2d6a51c322db03dfa9dbc274f74ca007624c3b8ca34fdb"],"state_sha256":"6b1ac343d6738358e7973f09058edfcb449a4934f01d465400dfcc6d7757ad71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goYbCcUe+qXfSOe8djhfkpEQjkNTnlCbVKpwp/KLALw5NXYluAAlq0F5u/fDt4Z5T/M0xSi+eJ2BgaHc5JqcDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:47:15.983643Z","bundle_sha256":"8ba34e94403c8b55fa4c3826c0d150958ef3cb9e3bb9b67afc7fd1de29bb95a5"}}