{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WHN5F2Y7KDQ4DR5GZIOZUEPEQD","short_pith_number":"pith:WHN5F2Y7","canonical_record":{"source":{"id":"2306.06380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-10T08:35:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e2ce0575017933fc5483b8d7f25f78d617ed4be6d98de2218e222be5975fd44f","abstract_canon_sha256":"7ff3d4f68ca39a08ce9e3883514c6bdc92a145fbd0396f696c2d63ea5dbe9384"},"schema_version":"1.0"},"canonical_sha256":"b1dbd2eb1f50e1c1c7a6ca1d9a11e480c9448c7a0325003c4ffa871771e9818f","source":{"kind":"arxiv","id":"2306.06380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.06380","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"2306.06380v1","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06380","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"WHN5F2Y7KDQ4","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"WHN5F2Y7KDQ4DR5G","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"WHN5F2Y7","created_at":"2026-07-05T06:19:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WHN5F2Y7KDQ4DR5GZIOZUEPEQD","target":"record","payload":{"canonical_record":{"source":{"id":"2306.06380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-10T08:35:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e2ce0575017933fc5483b8d7f25f78d617ed4be6d98de2218e222be5975fd44f","abstract_canon_sha256":"7ff3d4f68ca39a08ce9e3883514c6bdc92a145fbd0396f696c2d63ea5dbe9384"},"schema_version":"1.0"},"canonical_sha256":"b1dbd2eb1f50e1c1c7a6ca1d9a11e480c9448c7a0325003c4ffa871771e9818f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:24.267250Z","signature_b64":"YSJmKIdys4opcTMTFOdPrbgheyNV85MzzmEjkGaegYL2ZakMW7Te3Y8ipGlzwT4eFCweDOdR2Q5xCCPY2KwYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1dbd2eb1f50e1c1c7a6ca1d9a11e480c9448c7a0325003c4ffa871771e9818f","last_reissued_at":"2026-07-05T06:19:24.266849Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:24.266849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.06380","source_version":1,"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-05T06:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhiSiX3vSxXKQu1I0fXChxgRqsTV8iMGDNcOVhwYzNIc8ErAXAF4xHnmOjWsiDrHx6md8KNbxdqh2fbP5VpFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T15:20:35.073307Z"},"content_sha256":"5d281caf7177460926334519519af2d24906d5666114039c1747cc792e5d743d","schema_version":"1.0","event_id":"sha256:5d281caf7177460926334519519af2d24906d5666114039c1747cc792e5d743d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WHN5F2Y7KDQ4DR5GZIOZUEPEQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Haiqin Yang, Jiaqi Sun, Lin Zhang, Xuanzhou Liu, Yujiu Yang","submitted_at":"2023-06-10T08:35:00Z","abstract_excerpt":"Subgraph matching is a fundamental building block for graph-based applications and is challenging due to its high-order combinatorial nature. Existing studies usually tackle it by combinatorial optimization or learning-based methods. However, they suffer from exponential computational costs or searching the matching without theoretical guarantees. In this paper, we develop D2Match by leveraging the efficiency of Deep learning and Degeneracy for subgraph matching. More specifically, we first prove that subgraph matching can degenerate to subtree matching, and subsequently is equivalent to findi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06380","kind":"arxiv","version":1},"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/2306.06380/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-05T06:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IY7iSS+xYXeuSG8iSo3aCKbeES6UajjS5daDQ1I9+wkPEIxMxfx4wGQVSgaI2yaT3z6/bdNXK5/MFXs2dUHlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T15:20:35.074137Z"},"content_sha256":"0dbbbae923d0add90292ef30557c7353c7f33fb2bca5b391c61b9e12733ce2f0","schema_version":"1.0","event_id":"sha256:0dbbbae923d0add90292ef30557c7353c7f33fb2bca5b391c61b9e12733ce2f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHN5F2Y7KDQ4DR5GZIOZUEPEQD/bundle.json","state_url":"https://pith.science/pith/WHN5F2Y7KDQ4DR5GZIOZUEPEQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHN5F2Y7KDQ4DR5GZIOZUEPEQD/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-01T15:20:35Z","links":{"resolver":"https://pith.science/pith/WHN5F2Y7KDQ4DR5GZIOZUEPEQD","bundle":"https://pith.science/pith/WHN5F2Y7KDQ4DR5GZIOZUEPEQD/bundle.json","state":"https://pith.science/pith/WHN5F2Y7KDQ4DR5GZIOZUEPEQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHN5F2Y7KDQ4DR5GZIOZUEPEQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WHN5F2Y7KDQ4DR5GZIOZUEPEQD","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":"7ff3d4f68ca39a08ce9e3883514c6bdc92a145fbd0396f696c2d63ea5dbe9384","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-10T08:35:00Z","title_canon_sha256":"e2ce0575017933fc5483b8d7f25f78d617ed4be6d98de2218e222be5975fd44f"},"schema_version":"1.0","source":{"id":"2306.06380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.06380","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"2306.06380v1","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06380","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"WHN5F2Y7KDQ4","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"WHN5F2Y7KDQ4DR5G","created_at":"2026-07-05T06:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"WHN5F2Y7","created_at":"2026-07-05T06:19:24Z"}],"graph_snapshots":[{"event_id":"sha256:0dbbbae923d0add90292ef30557c7353c7f33fb2bca5b391c61b9e12733ce2f0","target":"graph","created_at":"2026-07-05T06:19:24Z","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/2306.06380/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Subgraph matching is a fundamental building block for graph-based applications and is challenging due to its high-order combinatorial nature. Existing studies usually tackle it by combinatorial optimization or learning-based methods. However, they suffer from exponential computational costs or searching the matching without theoretical guarantees. In this paper, we develop D2Match by leveraging the efficiency of Deep learning and Degeneracy for subgraph matching. More specifically, we first prove that subgraph matching can degenerate to subtree matching, and subsequently is equivalent to findi","authors_text":"Haiqin Yang, Jiaqi Sun, Lin Zhang, Xuanzhou Liu, Yujiu Yang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-10T08:35:00Z","title":"D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06380","kind":"arxiv","version":1},"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:5d281caf7177460926334519519af2d24906d5666114039c1747cc792e5d743d","target":"record","created_at":"2026-07-05T06:19:24Z","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":"7ff3d4f68ca39a08ce9e3883514c6bdc92a145fbd0396f696c2d63ea5dbe9384","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-10T08:35:00Z","title_canon_sha256":"e2ce0575017933fc5483b8d7f25f78d617ed4be6d98de2218e222be5975fd44f"},"schema_version":"1.0","source":{"id":"2306.06380","kind":"arxiv","version":1}},"canonical_sha256":"b1dbd2eb1f50e1c1c7a6ca1d9a11e480c9448c7a0325003c4ffa871771e9818f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1dbd2eb1f50e1c1c7a6ca1d9a11e480c9448c7a0325003c4ffa871771e9818f","first_computed_at":"2026-07-05T06:19:24.266849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:19:24.266849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YSJmKIdys4opcTMTFOdPrbgheyNV85MzzmEjkGaegYL2ZakMW7Te3Y8ipGlzwT4eFCweDOdR2Q5xCCPY2KwYAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:19:24.267250Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.06380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d281caf7177460926334519519af2d24906d5666114039c1747cc792e5d743d","sha256:0dbbbae923d0add90292ef30557c7353c7f33fb2bca5b391c61b9e12733ce2f0"],"state_sha256":"a38d34ad26ba3dee758b1138dce1244ad93dd6dfb204a4cc89e5105e0cabe271"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17GVNBXNCPTh+046mut1AnwF6Qu1rRfnk+jed6rr8AGV1KmIPxMAg6fDs+NWl/oih1m1b7RPKHYLMnpKiO5nDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T15:20:35.079191Z","bundle_sha256":"52eeb01e2d100a26e194d91bca3effdcf4c0eaae8132b9d28994407d3da7032e"}}