{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3DCDJX7T3HLHTSSBZL5LZJN43P","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":"89f3313c634e2a5aa44088f593b0e1d23a315e869a31a6832f17ce8f0c811ec2","cross_cats_sorted":["math.CO","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T15:02:24Z","title_canon_sha256":"87d3cb657cd06d65f4526c040544dbd011ac9705efdd27f304944cadaed1c284"},"schema_version":"1.0","source":{"id":"2402.13065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.13065","created_at":"2026-07-05T10:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2402.13065v2","created_at":"2026-07-05T10:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13065","created_at":"2026-07-05T10:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"3DCDJX7T3HLH","created_at":"2026-07-05T10:39:16Z"},{"alias_kind":"pith_short_16","alias_value":"3DCDJX7T3HLHTSSB","created_at":"2026-07-05T10:39:16Z"},{"alias_kind":"pith_short_8","alias_value":"3DCDJX7T","created_at":"2026-07-05T10:39:16Z"}],"graph_snapshots":[{"event_id":"sha256:da98e059f555df61ccd3648ea2a56895b695f89692a7ea6bb4812c68c3546699","target":"graph","created_at":"2026-07-05T10:39:16Z","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/2402.13065/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph rewriting is a popular tool for the optimisation and modification of graph expressions in domains such as compilers, machine learning and quantum computing. The underlying data structures are often port graphs - graphs with labels at edge endpoints. A pre-requisite for graph rewriting is the ability to find graph patterns. We propose a new solution to pattern matching in port graphs. Its novelty lies in the use of a pre-computed data structure that makes the pattern matching runtime complexity independent of the number of patterns. This offers a significant advantage over existing soluti","authors_text":"Luca Mondada (University of Oxford), Pablo Andr\\'es-Mart\\'inez (Quantinuum Ltd)","cross_cats":["math.CO","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T15:02:24Z","title":"Scalable Pattern Matching in Computation Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13065","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:e7228eb20f822555e57546be4c132bfb50135e3ecc750cf5d9253d805179ba31","target":"record","created_at":"2026-07-05T10:39:16Z","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":"89f3313c634e2a5aa44088f593b0e1d23a315e869a31a6832f17ce8f0c811ec2","cross_cats_sorted":["math.CO","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T15:02:24Z","title_canon_sha256":"87d3cb657cd06d65f4526c040544dbd011ac9705efdd27f304944cadaed1c284"},"schema_version":"1.0","source":{"id":"2402.13065","kind":"arxiv","version":2}},"canonical_sha256":"d8c434dff3d9d679ca41cafabca5bcdbe057d823570fb1d1a08c4a3d8c5a2397","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8c434dff3d9d679ca41cafabca5bcdbe057d823570fb1d1a08c4a3d8c5a2397","first_computed_at":"2026-07-05T10:39:16.904072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:39:16.904072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Wp3ohXWvdCJpyHfjk1SJs36FTKua2zHEBWAxOUeU6bFQQMPUwemz4IdqsqBQKeRX1F5V/R+TJh32nolxskLCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:39:16.904553Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.13065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7228eb20f822555e57546be4c132bfb50135e3ecc750cf5d9253d805179ba31","sha256:da98e059f555df61ccd3648ea2a56895b695f89692a7ea6bb4812c68c3546699"],"state_sha256":"f8ca18b0cc9178b53aaeb80491af9483a4d9259c9e5c41fc8b6929400a13ad55"}