{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BA6OU7ECMC6CHHR4LXZPAHBQXM","short_pith_number":"pith:BA6OU7EC","schema_version":"1.0","canonical_sha256":"083cea7c8260bc239e3c5df2f01c30bb187f6f40ebd07f94edd678ecdb1184ee","source":{"kind":"arxiv","id":"1404.6399","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.6399","created_at":"2026-05-18T02:53:16.604064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6399v1","created_at":"2026-05-18T02:53:16.604064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6399","created_at":"2026-05-18T02:53:16.604064+00:00"},{"alias_kind":"pith_short_12","alias_value":"BA6OU7ECMC6C","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BA6OU7ECMC6CHHR4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BA6OU7EC","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM","json":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM.json","graph_json":"https://pith.science/api/pith-number/BA6OU7ECMC6CHHR4LXZPAHBQXM/graph.json","events_json":"https://pith.science/api/pith-number/BA6OU7ECMC6CHHR4LXZPAHBQXM/events.json","paper":"https://pith.science/paper/BA6OU7EC"},"agent_actions":{"view_html":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM","download_json":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM.json","view_paper":"https://pith.science/paper/BA6OU7EC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6399&json=true","fetch_graph":"https://pith.science/api/pith-number/BA6OU7ECMC6CHHR4LXZPAHBQXM/graph.json","fetch_events":"https://pith.science/api/pith-number/BA6OU7ECMC6CHHR4LXZPAHBQXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/action/storage_attestation","attest_author":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/action/author_attestation","sign_citation":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/action/citation_signature","submit_replication":"https://pith.science/pith/BA6OU7ECMC6CHHR4LXZPAHBQXM/action/replication_record"}},"created_at":"2026-05-18T02:53:16.604064+00:00","updated_at":"2026-05-18T02:53:16.604064+00:00"}