{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JNQCROIZG6AONEBF3VMBFJU4ZL","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":"370bfce408add9520c671386ee429afbb860a06632e6a0daa2d91339fb2938c7","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-28T08:44:01Z","title_canon_sha256":"e5c075f433f149d3f76ec184c0ab824ae5a074850a5ba5724cac367ee1c4a6a9"},"schema_version":"1.0","source":{"id":"2311.16603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.16603","created_at":"2026-07-05T07:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"2311.16603v1","created_at":"2026-07-05T07:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16603","created_at":"2026-07-05T07:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"JNQCROIZG6AO","created_at":"2026-07-05T07:17:43Z"},{"alias_kind":"pith_short_16","alias_value":"JNQCROIZG6AONEBF","created_at":"2026-07-05T07:17:43Z"},{"alias_kind":"pith_short_8","alias_value":"JNQCROIZ","created_at":"2026-07-05T07:17:43Z"}],"graph_snapshots":[{"event_id":"sha256:97bac017a37cc90be2061731a53d37f9bea62acebd5571c99caa1645945f9683","target":"graph","created_at":"2026-07-05T07:17:43Z","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/2311.16603/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph database is designed to store bidirectional relationships between objects and facilitate the traversal process to extract a subgraph. However, the subgraph matching process is an NP-Complete problem. Existing solutions to this problem usually employ a filter-and-verification framework and a divide-and-conquer method. The filter-and-verification framework minimizes the number of inputs to the verification stage by filtering and pruning invalid candidates as much as possible. Meanwhile, subgraph matching is performed on the substructure decomposed from the larger graph to yield partial emb","authors_text":"C. Q. Cheng, K. S. Wong, L. K. Soon","cross_cats":["cs.IR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-28T08:44:01Z","title":"l2Match: Optimization Techniques on Subgraph Matching Algorithm using Label Pair, Neighboring Label Index, and Jump-Redo method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16603","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:815eeed65a3d21d37a8131f73208375a10dea631b41964fc7ac085345d513a11","target":"record","created_at":"2026-07-05T07:17:43Z","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":"370bfce408add9520c671386ee429afbb860a06632e6a0daa2d91339fb2938c7","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-28T08:44:01Z","title_canon_sha256":"e5c075f433f149d3f76ec184c0ab824ae5a074850a5ba5724cac367ee1c4a6a9"},"schema_version":"1.0","source":{"id":"2311.16603","kind":"arxiv","version":1}},"canonical_sha256":"4b6028b9193780e69025dd5812a69ccade3d1a1a1d699579b2a173d8cdb92280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b6028b9193780e69025dd5812a69ccade3d1a1a1d699579b2a173d8cdb92280","first_computed_at":"2026-07-05T07:17:43.832343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:17:43.832343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ndkZ/iz6Sbxy0Xz0dN25bk6ZIYJEMZdpClYmff5V0dxRnL6w0osNyl4f3s0mM2ElRgk6CEmO22kxzC2CY3gyDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:17:43.832747Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.16603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:815eeed65a3d21d37a8131f73208375a10dea631b41964fc7ac085345d513a11","sha256:97bac017a37cc90be2061731a53d37f9bea62acebd5571c99caa1645945f9683"],"state_sha256":"ccdb15c1c13cfcae5e767326445598d9c7488978d31dce89d943c77806169bee"}