{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:54LN3ZAQ5665QBDH4HNORBVU6P","short_pith_number":"pith:54LN3ZAQ","canonical_record":{"source":{"id":"2007.03092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T22:06:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"100791082b3daf9fc1b87be1f8361f05c94e5825fe086185b47b891950678f63","abstract_canon_sha256":"c1b7ea4427d20cd2b0695725d4b592b19e86475344ab203d69ad6614899d2645"},"schema_version":"1.0"},"canonical_sha256":"ef16dde410efbdd80467e1dae886b4f3dccadd577b063d6bbd9b26825b7417cf","source":{"kind":"arxiv","id":"2007.03092","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.03092","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"2007.03092v2","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03092","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"54LN3ZAQ5665","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"pith_short_16","alias_value":"54LN3ZAQ5665QBDH","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"pith_short_8","alias_value":"54LN3ZAQ","created_at":"2026-07-05T01:46:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:54LN3ZAQ5665QBDH4HNORBVU6P","target":"record","payload":{"canonical_record":{"source":{"id":"2007.03092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T22:06:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"100791082b3daf9fc1b87be1f8361f05c94e5825fe086185b47b891950678f63","abstract_canon_sha256":"c1b7ea4427d20cd2b0695725d4b592b19e86475344ab203d69ad6614899d2645"},"schema_version":"1.0"},"canonical_sha256":"ef16dde410efbdd80467e1dae886b4f3dccadd577b063d6bbd9b26825b7417cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:46:22.927483Z","signature_b64":"DN2OUmKi16AC534RvxprYYd71a+N3xO46eOUEqS5Kw1eY4WuoXPjoczFPiwOCNU79ou7zkEwqu+Mc6BId4yDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef16dde410efbdd80467e1dae886b4f3dccadd577b063d6bbd9b26825b7417cf","last_reissued_at":"2026-07-05T01:46:22.926980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:46:22.926980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.03092","source_version":2,"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-05T01:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2I8rJTqtH+7L+m7EXyTlU+OTrot3YpM7BxU619tuNRmrm71ZmjL/flq1ytAw78EHlNrd52z07mRDJRdPDExxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T21:58:20.930395Z"},"content_sha256":"108a57f1ecea681ab0f319bcac2a28f7e15f4f8b974427799cde1f5f45dda116","schema_version":"1.0","event_id":"sha256:108a57f1ecea681ab0f319bcac2a28f7e15f4f8b974427799cde1f5f45dda116"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:54LN3ZAQ5665QBDH4HNORBVU6P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Subgraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Arquimedes Canedo, Chengtao Wen, Jiaxuan You, Jure Leskovec, Rex (Zhitao) Ying, Zhaoyu Lou","submitted_at":"2020-07-06T22:06:38Z","abstract_excerpt":"Subgraph matching is the problem of determining the presence and location(s) of a given query graph in a large target graph. Despite being an NP-complete problem, the subgraph matching problem is crucial in domains ranging from network science and database systems to biochemistry and cognitive science. However, existing techniques based on combinatorial matching and integer programming cannot handle matching problems with both large target and query graphs. Here we propose NeuroMatch, an accurate, efficient, and robust neural approach to subgraph matching. NeuroMatch decomposes query and targe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03092","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/2007.03092/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-05T01:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kt5w8S46GGvd+z7EfinvSKh5+iofqbu9h6wMelFjTWpqBfZQmSX7Oj3wfFMs2cwuNk8+u6s35fmoOXZsKJVzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T21:58:20.930908Z"},"content_sha256":"087b65d2aa61be2c0b7beac8c5a21626de0d10bee52a8ae4aa443c3f9f489495","schema_version":"1.0","event_id":"sha256:087b65d2aa61be2c0b7beac8c5a21626de0d10bee52a8ae4aa443c3f9f489495"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54LN3ZAQ5665QBDH4HNORBVU6P/bundle.json","state_url":"https://pith.science/pith/54LN3ZAQ5665QBDH4HNORBVU6P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54LN3ZAQ5665QBDH4HNORBVU6P/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-08-10T21:58:20Z","links":{"resolver":"https://pith.science/pith/54LN3ZAQ5665QBDH4HNORBVU6P","bundle":"https://pith.science/pith/54LN3ZAQ5665QBDH4HNORBVU6P/bundle.json","state":"https://pith.science/pith/54LN3ZAQ5665QBDH4HNORBVU6P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54LN3ZAQ5665QBDH4HNORBVU6P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:54LN3ZAQ5665QBDH4HNORBVU6P","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":"c1b7ea4427d20cd2b0695725d4b592b19e86475344ab203d69ad6614899d2645","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T22:06:38Z","title_canon_sha256":"100791082b3daf9fc1b87be1f8361f05c94e5825fe086185b47b891950678f63"},"schema_version":"1.0","source":{"id":"2007.03092","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.03092","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"2007.03092v2","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03092","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"54LN3ZAQ5665","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"pith_short_16","alias_value":"54LN3ZAQ5665QBDH","created_at":"2026-07-05T01:46:22Z"},{"alias_kind":"pith_short_8","alias_value":"54LN3ZAQ","created_at":"2026-07-05T01:46:22Z"}],"graph_snapshots":[{"event_id":"sha256:087b65d2aa61be2c0b7beac8c5a21626de0d10bee52a8ae4aa443c3f9f489495","target":"graph","created_at":"2026-07-05T01:46:22Z","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/2007.03092/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Subgraph matching is the problem of determining the presence and location(s) of a given query graph in a large target graph. Despite being an NP-complete problem, the subgraph matching problem is crucial in domains ranging from network science and database systems to biochemistry and cognitive science. However, existing techniques based on combinatorial matching and integer programming cannot handle matching problems with both large target and query graphs. Here we propose NeuroMatch, an accurate, efficient, and robust neural approach to subgraph matching. NeuroMatch decomposes query and targe","authors_text":"Arquimedes Canedo, Chengtao Wen, Jiaxuan You, Jure Leskovec, Rex (Zhitao) Ying, Zhaoyu Lou","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T22:06:38Z","title":"Neural Subgraph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03092","kind":"arxiv","version":2},"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:108a57f1ecea681ab0f319bcac2a28f7e15f4f8b974427799cde1f5f45dda116","target":"record","created_at":"2026-07-05T01:46:22Z","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":"c1b7ea4427d20cd2b0695725d4b592b19e86475344ab203d69ad6614899d2645","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T22:06:38Z","title_canon_sha256":"100791082b3daf9fc1b87be1f8361f05c94e5825fe086185b47b891950678f63"},"schema_version":"1.0","source":{"id":"2007.03092","kind":"arxiv","version":2}},"canonical_sha256":"ef16dde410efbdd80467e1dae886b4f3dccadd577b063d6bbd9b26825b7417cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef16dde410efbdd80467e1dae886b4f3dccadd577b063d6bbd9b26825b7417cf","first_computed_at":"2026-07-05T01:46:22.926980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:46:22.926980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DN2OUmKi16AC534RvxprYYd71a+N3xO46eOUEqS5Kw1eY4WuoXPjoczFPiwOCNU79ou7zkEwqu+Mc6BId4yDCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:46:22.927483Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.03092","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:108a57f1ecea681ab0f319bcac2a28f7e15f4f8b974427799cde1f5f45dda116","sha256:087b65d2aa61be2c0b7beac8c5a21626de0d10bee52a8ae4aa443c3f9f489495"],"state_sha256":"40a3ddfc9bfb04c17d1a92b983dc30d6ecc83c8deb8dc777660a303c7539186f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VvJuPc/IIjoMAMOeRyIdc+a5TtLliXML3Cr+213BjDAHTc5pgu0jSJ5kt4pWxx5pRt5k6S2Fo5veHmVeawoFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T21:58:20.936600Z","bundle_sha256":"f58bae9d995ec55f312db73cebc31db15260c2254689542ad75847285465cb93"}}