{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AWXDEZYEDZM6WV4PN75CZ4K4GS","short_pith_number":"pith:AWXDEZYE","canonical_record":{"source":{"id":"1705.09358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-25T20:52:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b5f45ff5d822dffd4f0a7251f761c17eff9aba7a2064e9fe38c67e0a7be6f0c2","abstract_canon_sha256":"182eb135941c1aa33688ec5b7a25ccc1fc1030d8f154bf70f826549b0a862ffa"},"schema_version":"1.0"},"canonical_sha256":"05ae3267041e59eb578f6ffa2cf15c34a3f99330a5c7bd23597f12a5b0160b8a","source":{"kind":"arxiv","id":"1705.09358","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09358","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09358v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09358","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"AWXDEZYEDZM6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AWXDEZYEDZM6WV4P","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AWXDEZYE","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AWXDEZYEDZM6WV4PN75CZ4K4GS","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-25T20:52:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b5f45ff5d822dffd4f0a7251f761c17eff9aba7a2064e9fe38c67e0a7be6f0c2","abstract_canon_sha256":"182eb135941c1aa33688ec5b7a25ccc1fc1030d8f154bf70f826549b0a862ffa"},"schema_version":"1.0"},"canonical_sha256":"05ae3267041e59eb578f6ffa2cf15c34a3f99330a5c7bd23597f12a5b0160b8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.922788Z","signature_b64":"aPTUF5ZGa4FohmY8BLm1tGRffKsjcICHbdHEfpo9YLrKHORaJKHV1zZhDpu5VjNPpX8RfqivPii3PA0hepFqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05ae3267041e59eb578f6ffa2cf15c34a3f99330a5c7bd23597f12a5b0160b8a","last_reissued_at":"2026-05-18T00:43:38.922232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.922232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09358","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-05-18T00:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQaXK3Ao4YOhRMel2TikKS5KKy53AdTpgGhv1fFQa2le5zWIC6f/DZNG6k1lhysneAhMzJRw5Ni4hYH9tnYYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:16:13.606819Z"},"content_sha256":"d63d02490cbdec64a906f1da3067a0183b442849ce319112dd3164a4aa30e8d4","schema_version":"1.0","event_id":"sha256:d63d02490cbdec64a906f1da3067a0183b442849ce319112dd3164a4aa30e8d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AWXDEZYEDZM6WV4PN75CZ4K4GS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shared Memory Parallel Subgraph Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Darren Strash, Henning Meyerhenke, Raphael Kimmig","submitted_at":"2017-05-25T20:52:48Z","abstract_excerpt":"The subgraph enumeration problem asks us to find all subgraphs of a target graph that are isomorphic to a given pattern graph. Determining whether even one such isomorphic subgraph exists is NP-complete---and therefore finding all such subgraphs (if they exist) is a time-consuming task. Subgraph enumeration has applications in many fields, including biochemistry and social networks, and interestingly the fastest algorithms for solving the problem for biochemical inputs are sequential. Since they depend on depth-first tree traversal, an efficient parallelization is far from trivial. Nevertheles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09358","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":""},"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-18T00:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnfW3A/Vs32evxclLIC0qrioz3+I8aXv0X5kokeTq6h1cN4F+jKXsR8eaCQHSe47jecvHA8TGly9kIRqXoI5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:16:13.607469Z"},"content_sha256":"d759a75c89244289d10781ce81123fc52c1e1c6d64e80ce6f8c9f2d49bcdc258","schema_version":"1.0","event_id":"sha256:d759a75c89244289d10781ce81123fc52c1e1c6d64e80ce6f8c9f2d49bcdc258"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWXDEZYEDZM6WV4PN75CZ4K4GS/bundle.json","state_url":"https://pith.science/pith/AWXDEZYEDZM6WV4PN75CZ4K4GS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWXDEZYEDZM6WV4PN75CZ4K4GS/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-06-06T17:16:13Z","links":{"resolver":"https://pith.science/pith/AWXDEZYEDZM6WV4PN75CZ4K4GS","bundle":"https://pith.science/pith/AWXDEZYEDZM6WV4PN75CZ4K4GS/bundle.json","state":"https://pith.science/pith/AWXDEZYEDZM6WV4PN75CZ4K4GS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWXDEZYEDZM6WV4PN75CZ4K4GS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AWXDEZYEDZM6WV4PN75CZ4K4GS","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":"182eb135941c1aa33688ec5b7a25ccc1fc1030d8f154bf70f826549b0a862ffa","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-25T20:52:48Z","title_canon_sha256":"b5f45ff5d822dffd4f0a7251f761c17eff9aba7a2064e9fe38c67e0a7be6f0c2"},"schema_version":"1.0","source":{"id":"1705.09358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09358","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09358v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09358","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"AWXDEZYEDZM6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AWXDEZYEDZM6WV4P","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AWXDEZYE","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:d759a75c89244289d10781ce81123fc52c1e1c6d64e80ce6f8c9f2d49bcdc258","target":"graph","created_at":"2026-05-18T00:43:38Z","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 subgraph enumeration problem asks us to find all subgraphs of a target graph that are isomorphic to a given pattern graph. Determining whether even one such isomorphic subgraph exists is NP-complete---and therefore finding all such subgraphs (if they exist) is a time-consuming task. Subgraph enumeration has applications in many fields, including biochemistry and social networks, and interestingly the fastest algorithms for solving the problem for biochemical inputs are sequential. Since they depend on depth-first tree traversal, an efficient parallelization is far from trivial. Nevertheles","authors_text":"Darren Strash, Henning Meyerhenke, Raphael Kimmig","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-25T20:52:48Z","title":"Shared Memory Parallel Subgraph Enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09358","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:d63d02490cbdec64a906f1da3067a0183b442849ce319112dd3164a4aa30e8d4","target":"record","created_at":"2026-05-18T00:43:38Z","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":"182eb135941c1aa33688ec5b7a25ccc1fc1030d8f154bf70f826549b0a862ffa","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-25T20:52:48Z","title_canon_sha256":"b5f45ff5d822dffd4f0a7251f761c17eff9aba7a2064e9fe38c67e0a7be6f0c2"},"schema_version":"1.0","source":{"id":"1705.09358","kind":"arxiv","version":1}},"canonical_sha256":"05ae3267041e59eb578f6ffa2cf15c34a3f99330a5c7bd23597f12a5b0160b8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05ae3267041e59eb578f6ffa2cf15c34a3f99330a5c7bd23597f12a5b0160b8a","first_computed_at":"2026-05-18T00:43:38.922232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:38.922232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aPTUF5ZGa4FohmY8BLm1tGRffKsjcICHbdHEfpo9YLrKHORaJKHV1zZhDpu5VjNPpX8RfqivPii3PA0hepFqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:38.922788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d63d02490cbdec64a906f1da3067a0183b442849ce319112dd3164a4aa30e8d4","sha256:d759a75c89244289d10781ce81123fc52c1e1c6d64e80ce6f8c9f2d49bcdc258"],"state_sha256":"efcaba0ab1964ad07f28a2c9016146fcb479d1886b4ec5d29fa92d3de2248baa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"raIfvLGUccS+aO0bi7zCUIvYEXyPIumB/xmp+Fj3BAausCqhxiwoylxK+GH5I1xEBjDmrOOEOeVfXudcup6DAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:16:13.610419Z","bundle_sha256":"2a40b43af43155970dd8bf55cf2278e16800c4b7487f3e25cc8e670bccbe5ff5"}}