{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BA6OU7ECMC6CHHR4LXZPAHBQXM","short_pith_number":"pith:BA6OU7EC","canonical_record":{"source":{"id":"1404.6399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-25T11:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"467b1d7c1b8315a21390cba909c072c5784668ccfd8999ce5e21853966ee7fc7","abstract_canon_sha256":"5bfcf5bf0c6381383ff73a334713912604c4868c07f1c41493cc64b7b81d16d7"},"schema_version":"1.0"},"canonical_sha256":"083cea7c8260bc239e3c5df2f01c30bb187f6f40ebd07f94edd678ecdb1184ee","source":{"kind":"arxiv","id":"1404.6399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6399","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6399v1","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6399","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"BA6OU7ECMC6C","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BA6OU7ECMC6CHHR4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BA6OU7EC","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BA6OU7ECMC6CHHR4LXZPAHBQXM","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-25T11:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"467b1d7c1b8315a21390cba909c072c5784668ccfd8999ce5e21853966ee7fc7","abstract_canon_sha256":"5bfcf5bf0c6381383ff73a334713912604c4868c07f1c41493cc64b7b81d16d7"},"schema_version":"1.0"},"canonical_sha256":"083cea7c8260bc239e3c5df2f01c30bb187f6f40ebd07f94edd678ecdb1184ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:16.604674Z","signature_b64":"nroMgEWwzj1JFNBuNpxhBR+0Tc+M/W4wMvMQ0KwaCredIpkVXE2+3CTqEFv0gxomHkibYxbNsMAsthp9lcjqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"083cea7c8260bc239e3c5df2f01c30bb187f6f40ebd07f94edd678ecdb1184ee","last_reissued_at":"2026-05-18T02:53:16.603954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:16.603954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6399","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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXzRVqygk0zr65nATKIBq/6vyhrMBn5qB0TbE3WCfPE9ZAKa70LJWNHZIrK34qvRwbqQyWCetMhaCPQUAPwYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T12:35:56.276970Z"},"content_sha256":"9ec0db4a41ef3ebb2b082d662d2a1a21c615750b7f9711502a4a07e0ce169042","schema_version":"1.0","event_id":"sha256:9ec0db4a41ef3ebb2b082d662d2a1a21c615750b7f9711502a4a07e0ce169042"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BA6OU7ECMC6CHHR4LXZPAHBQXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hybrid Graph Representation for Exact Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amer E. Mouawad, Faisal N. Abu-Khzam, Karim A. Jahed","submitted_at":"2014-04-25T11:34:55Z","abstract_excerpt":"Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing number of graph modifications, such as vertex/edge deletions, that reduce the problem instance and have to be \"taken back\" frequently during the search process. We investigate practical implementation-based aspects of exact graph algorithms by providing a simple hybrid graph representation that trades space for time to address the said take-back challenge. Experiments on three well studied problems show consistent s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6399","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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQyGIVs8zYflACPcmLthKKH1os4zFphj6881KRwcunifeT57ODnDtT42zZKxkeT/M+NOPuhheGFl1AswpQUuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T12:35:56.277726Z"},"content_sha256":"727a423741b49952d413dceca72002a814c5d333fab4569f5643d651ae4e6257","schema_version":"1.0","event_id":"sha256:727a423741b49952d413dceca72002a814c5d333fab4569f5643d651ae4e6257"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/bundle.json","state_url":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/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-05-19T12:35:56Z","links":{"resolver":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM","bundle":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/bundle.json","state":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BA6OU7ECMC6CHHR4LXZPAHBQXM","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":"5bfcf5bf0c6381383ff73a334713912604c4868c07f1c41493cc64b7b81d16d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-25T11:34:55Z","title_canon_sha256":"467b1d7c1b8315a21390cba909c072c5784668ccfd8999ce5e21853966ee7fc7"},"schema_version":"1.0","source":{"id":"1404.6399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6399","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6399v1","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6399","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"BA6OU7ECMC6C","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BA6OU7ECMC6CHHR4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BA6OU7EC","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:727a423741b49952d413dceca72002a814c5d333fab4569f5643d651ae4e6257","target":"graph","created_at":"2026-05-18T02:53: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"},"paper":{"abstract_excerpt":"Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing number of graph modifications, such as vertex/edge deletions, that reduce the problem instance and have to be \"taken back\" frequently during the search process. We investigate practical implementation-based aspects of exact graph algorithms by providing a simple hybrid graph representation that trades space for time to address the said take-back challenge. Experiments on three well studied problems show consistent s","authors_text":"Amer E. Mouawad, Faisal N. Abu-Khzam, Karim A. Jahed","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-25T11:34:55Z","title":"A Hybrid Graph Representation for Exact Graph Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6399","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:9ec0db4a41ef3ebb2b082d662d2a1a21c615750b7f9711502a4a07e0ce169042","target":"record","created_at":"2026-05-18T02:53: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":"5bfcf5bf0c6381383ff73a334713912604c4868c07f1c41493cc64b7b81d16d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-25T11:34:55Z","title_canon_sha256":"467b1d7c1b8315a21390cba909c072c5784668ccfd8999ce5e21853966ee7fc7"},"schema_version":"1.0","source":{"id":"1404.6399","kind":"arxiv","version":1}},"canonical_sha256":"083cea7c8260bc239e3c5df2f01c30bb187f6f40ebd07f94edd678ecdb1184ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"083cea7c8260bc239e3c5df2f01c30bb187f6f40ebd07f94edd678ecdb1184ee","first_computed_at":"2026-05-18T02:53:16.603954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:16.603954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nroMgEWwzj1JFNBuNpxhBR+0Tc+M/W4wMvMQ0KwaCredIpkVXE2+3CTqEFv0gxomHkibYxbNsMAsthp9lcjqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:16.604674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ec0db4a41ef3ebb2b082d662d2a1a21c615750b7f9711502a4a07e0ce169042","sha256:727a423741b49952d413dceca72002a814c5d333fab4569f5643d651ae4e6257"],"state_sha256":"7f3e1d27073c04115c00b53fd8ec333ac58f98ea8db0c03a5fc5fd60d863fd5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hU21wXmdwo5/ONEs5Gfdo1DbypzzFUNoUTvRZIsfhf2sp0lIh4MwQENzfv9npK856c7KugeSk/6Ub3/++YdUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T12:35:56.280650Z","bundle_sha256":"55ac693e56df88075d238036aa5578761870686b1166d1028223aacdf53c4189"}}