{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:736GLD2WAL2LG2L3CTFNQA7AUB","short_pith_number":"pith:736GLD2W","schema_version":"1.0","canonical_sha256":"fefc658f5602f4b3697b14cad803e0a0766d2b0977114733c5858079c19981c6","source":{"kind":"arxiv","id":"1901.07118","version":1},"attestation_state":"computed","paper":{"title":"A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mahdi Belbasi, Martin F\\\"urer","submitted_at":"2019-01-21T23:22:47Z","abstract_excerpt":"An NP-hard graph problem may be intractable for general graphs but it could be efficiently solvable using dynamic programming for graphs with bounded width (or depth or some other structural parameter). Dynamic programming is a well-known approach used for finding exact solutions for NP-hard graph problems based on tree decompositions. It has been shown that there exist algorithms using linear time in the number of vertices and single exponential time in the width (depth or other parameters) of a given tree decomposition for many connectivity problems. Employing dynamic programming on a tree d"},"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":"1901.07118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T23:22:47Z","cross_cats_sorted":[],"title_canon_sha256":"4223c1c5112a73f812cb3d0f135d26aabfa5f6c70f2a7731e9ae0f5a7cdd9414","abstract_canon_sha256":"a1d05f23e95eab1d5d1c2d9f52f3b4f70078fd4f22cb0697acd50f3ca92db4f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:48.108032Z","signature_b64":"oaU8Ae2BIOf5T088yqWyj3J8SgTya2ziyAVZe2KoEvPDRuHB0HBqGVn00Vwt2hEF2EhtcJ3G5ylms6WoPllQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fefc658f5602f4b3697b14cad803e0a0766d2b0977114733c5858079c19981c6","last_reissued_at":"2026-05-17T23:55:48.107517Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:48.107517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mahdi Belbasi, Martin F\\\"urer","submitted_at":"2019-01-21T23:22:47Z","abstract_excerpt":"An NP-hard graph problem may be intractable for general graphs but it could be efficiently solvable using dynamic programming for graphs with bounded width (or depth or some other structural parameter). Dynamic programming is a well-known approach used for finding exact solutions for NP-hard graph problems based on tree decompositions. It has been shown that there exist algorithms using linear time in the number of vertices and single exponential time in the width (depth or other parameters) of a given tree decomposition for many connectivity problems. Employing dynamic programming on a tree d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07118","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":"1901.07118","created_at":"2026-05-17T23:55:48.107600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07118v1","created_at":"2026-05-17T23:55:48.107600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07118","created_at":"2026-05-17T23:55:48.107600+00:00"},{"alias_kind":"pith_short_12","alias_value":"736GLD2WAL2L","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"736GLD2WAL2LG2L3","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"736GLD2W","created_at":"2026-05-18T12:33:10.108867+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/736GLD2WAL2LG2L3CTFNQA7AUB","json":"https://pith.science/pith/736GLD2WAL2LG2L3CTFNQA7AUB.json","graph_json":"https://pith.science/api/pith-number/736GLD2WAL2LG2L3CTFNQA7AUB/graph.json","events_json":"https://pith.science/api/pith-number/736GLD2WAL2LG2L3CTFNQA7AUB/events.json","paper":"https://pith.science/paper/736GLD2W"},"agent_actions":{"view_html":"https://pith.science/pith/736GLD2WAL2LG2L3CTFNQA7AUB","download_json":"https://pith.science/pith/736GLD2WAL2LG2L3CTFNQA7AUB.json","view_paper":"https://pith.science/paper/736GLD2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07118&json=true","fetch_graph":"https://pith.science/api/pith-number/736GLD2WAL2LG2L3CTFNQA7AUB/graph.json","fetch_events":"https://pith.science/api/pith-number/736GLD2WAL2LG2L3CTFNQA7AUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/736GLD2WAL2LG2L3CTFNQA7AUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/736GLD2WAL2LG2L3CTFNQA7AUB/action/storage_attestation","attest_author":"https://pith.science/pith/736GLD2WAL2LG2L3CTFNQA7AUB/action/author_attestation","sign_citation":"https://pith.science/pith/736GLD2WAL2LG2L3CTFNQA7AUB/action/citation_signature","submit_replication":"https://pith.science/pith/736GLD2WAL2LG2L3CTFNQA7AUB/action/replication_record"}},"created_at":"2026-05-17T23:55:48.107600+00:00","updated_at":"2026-05-17T23:55:48.107600+00:00"}