{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WJXTU75SJSCM776IHRJZ2JIYMJ","short_pith_number":"pith:WJXTU75S","canonical_record":{"source":{"id":"1908.06418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-18T10:15:59Z","cross_cats_sorted":[],"title_canon_sha256":"bb1ac65e5956fe982e81fc7e2eca2804963324ef478e2c6b7649dc1cf9274858","abstract_canon_sha256":"1f918bb7ec0b3b9dde17c6a53fb5aa93a7987e6e3e07d593b2cc702d7d1cd173"},"schema_version":"1.0"},"canonical_sha256":"b26f3a7fb24c84cfffc83c539d251862611566cf65e2e3eccea6c7f8ca9a48ff","source":{"kind":"arxiv","id":"1908.06418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06418","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06418v1","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06418","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"WJXTU75SJSCM","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"pith_short_16","alias_value":"WJXTU75SJSCM776I","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"pith_short_8","alias_value":"WJXTU75S","created_at":"2026-07-05T01:49:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WJXTU75SJSCM776IHRJZ2JIYMJ","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-18T10:15:59Z","cross_cats_sorted":[],"title_canon_sha256":"bb1ac65e5956fe982e81fc7e2eca2804963324ef478e2c6b7649dc1cf9274858","abstract_canon_sha256":"1f918bb7ec0b3b9dde17c6a53fb5aa93a7987e6e3e07d593b2cc702d7d1cd173"},"schema_version":"1.0"},"canonical_sha256":"b26f3a7fb24c84cfffc83c539d251862611566cf65e2e3eccea6c7f8ca9a48ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:35.088531Z","signature_b64":"p94V6ACvycehLNpmlPakOdnp6rVuI4lESgO68I7vKqNct5VPQoyICtOrbeDVb2tilXKHi2M7UcY45kNAvbnlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b26f3a7fb24c84cfffc83c539d251862611566cf65e2e3eccea6c7f8ca9a48ff","last_reissued_at":"2026-07-05T01:49:35.088071Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:35.088071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06418","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-05T01:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xs9KZ1XWrxB+KYGmHlw6wFEUA2URP81ScRpbl5CU8KOV79DHvz/BZDF+qbFU/ofoBMFd4fljAzK7Mv+99IK5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:50:43.238937Z"},"content_sha256":"694da44da57d205584c6cb4876895f4413eae022d13607f1ffaee0f6163adc35","schema_version":"1.0","event_id":"sha256:694da44da57d205584c6cb4876895f4413eae022d13607f1ffaee0f6163adc35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WJXTU75SJSCM776IHRJZ2JIYMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Maximum Common Subgraph Problem: A Portfolio Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Marcelli, Giovanni Squillero, Stefano Quer","submitted_at":"2019-08-18T10:15:59Z","abstract_excerpt":"The Maximum Common Subgraph is a computationally challenging problem with countless practical applications. Even if it has been long proven NP-hard, its importance still motivates searching for exact solutions. This work starts by discussing the possibility to extend an existing, very effective branch-and-bound procedure on parallel multi-core and many-core architectures. We analyze a parallel multi-core implementation that exploits a divide-and-conquer approach based on a thread-pool, which does not deteriorate the original algorithmic efficiency and it is not memory bound. We extend the algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06418","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/1908.06418/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:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ub+7ECahcTVyKhz5iz+H2Ku9QvwQ9Hl2ghEmQ2sA+fYpjoG3RUFYA0GqjAV0J9h2PpgBgWfGvEG1G7MUsGxyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:50:43.240186Z"},"content_sha256":"a34d6de913b6ec61bc6e1df0a079b4e0a4585f26f4939041859291c1f247132a","schema_version":"1.0","event_id":"sha256:a34d6de913b6ec61bc6e1df0a079b4e0a4585f26f4939041859291c1f247132a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJXTU75SJSCM776IHRJZ2JIYMJ/bundle.json","state_url":"https://pith.science/pith/WJXTU75SJSCM776IHRJZ2JIYMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJXTU75SJSCM776IHRJZ2JIYMJ/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-16T06:50:43Z","links":{"resolver":"https://pith.science/pith/WJXTU75SJSCM776IHRJZ2JIYMJ","bundle":"https://pith.science/pith/WJXTU75SJSCM776IHRJZ2JIYMJ/bundle.json","state":"https://pith.science/pith/WJXTU75SJSCM776IHRJZ2JIYMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJXTU75SJSCM776IHRJZ2JIYMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WJXTU75SJSCM776IHRJZ2JIYMJ","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":"1f918bb7ec0b3b9dde17c6a53fb5aa93a7987e6e3e07d593b2cc702d7d1cd173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-18T10:15:59Z","title_canon_sha256":"bb1ac65e5956fe982e81fc7e2eca2804963324ef478e2c6b7649dc1cf9274858"},"schema_version":"1.0","source":{"id":"1908.06418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06418","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06418v1","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06418","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"WJXTU75SJSCM","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"pith_short_16","alias_value":"WJXTU75SJSCM776I","created_at":"2026-07-05T01:49:35Z"},{"alias_kind":"pith_short_8","alias_value":"WJXTU75S","created_at":"2026-07-05T01:49:35Z"}],"graph_snapshots":[{"event_id":"sha256:a34d6de913b6ec61bc6e1df0a079b4e0a4585f26f4939041859291c1f247132a","target":"graph","created_at":"2026-07-05T01:49:35Z","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/1908.06418/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Maximum Common Subgraph is a computationally challenging problem with countless practical applications. Even if it has been long proven NP-hard, its importance still motivates searching for exact solutions. This work starts by discussing the possibility to extend an existing, very effective branch-and-bound procedure on parallel multi-core and many-core architectures. We analyze a parallel multi-core implementation that exploits a divide-and-conquer approach based on a thread-pool, which does not deteriorate the original algorithmic efficiency and it is not memory bound. We extend the algo","authors_text":"Andrea Marcelli, Giovanni Squillero, Stefano Quer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06418","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:694da44da57d205584c6cb4876895f4413eae022d13607f1ffaee0f6163adc35","target":"record","created_at":"2026-07-05T01:49:35Z","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":"1f918bb7ec0b3b9dde17c6a53fb5aa93a7987e6e3e07d593b2cc702d7d1cd173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-18T10:15:59Z","title_canon_sha256":"bb1ac65e5956fe982e81fc7e2eca2804963324ef478e2c6b7649dc1cf9274858"},"schema_version":"1.0","source":{"id":"1908.06418","kind":"arxiv","version":1}},"canonical_sha256":"b26f3a7fb24c84cfffc83c539d251862611566cf65e2e3eccea6c7f8ca9a48ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b26f3a7fb24c84cfffc83c539d251862611566cf65e2e3eccea6c7f8ca9a48ff","first_computed_at":"2026-07-05T01:49:35.088071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:49:35.088071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p94V6ACvycehLNpmlPakOdnp6rVuI4lESgO68I7vKqNct5VPQoyICtOrbeDVb2tilXKHi2M7UcY45kNAvbnlDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:49:35.088531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:694da44da57d205584c6cb4876895f4413eae022d13607f1ffaee0f6163adc35","sha256:a34d6de913b6ec61bc6e1df0a079b4e0a4585f26f4939041859291c1f247132a"],"state_sha256":"1fc9813edc759c21574599ad87e10651c7d047ee52e92b9acc08ef228acaea14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkcwfJeIoZL1qgyjzqH3jJ/C/t1lGj8cb/ciW4Y5tG/S4eUHSulnTqMa0W5DXdBxLTo2wFE7BJbSBiLNY0Z9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:50:43.250544Z","bundle_sha256":"df01e9fb0f3b3b5d8ee42632e598577a696ff065f6829535a166f0ab6224bc53"}}