{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XDV4U4JN3J3BHMITEUQUCVVNPF","short_pith_number":"pith:XDV4U4JN","schema_version":"1.0","canonical_sha256":"b8ebca712dda7613b11325214156ad797c732016d4e26462a9bf85115caae036","source":{"kind":"arxiv","id":"1902.01874","version":1},"attestation_state":"computed","paper":{"title":"Average-case complexity of a branch-and-bound algorithm for min dominating set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ararat Harutyunyan, Tom Denat, Vangelis Th. Paschos","submitted_at":"2019-02-05T19:13:12Z","abstract_excerpt":"The average-case complexity of a branch-and-bound algorithms for Minimum Dominating Set problem in random graphs in the G(n,p) model is studied. We identify phase transitions between subexponential and exponential average-case complexities, depending on the growth of the probability p with respect to the number n of nodes."},"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":"1902.01874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T19:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"646ce03d2c32e7839958739dc9c970f48f9a556065cb0fe5fd69294ce3f88182","abstract_canon_sha256":"a2282e488e0a01a5e97d25533e5e4ff2990968fcdf38158f6136399c6f552791"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.560552Z","signature_b64":"SPso6JR6tC7af/YTLhJVmTwJsSy/kDCzUSivxAO81aCcHlMAsvX5nc8KWbBtnXzIZEPGgDN+v3NfzPxbLwz4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ebca712dda7613b11325214156ad797c732016d4e26462a9bf85115caae036","last_reissued_at":"2026-05-17T23:54:38.560069Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.560069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average-case complexity of a branch-and-bound algorithm for min dominating set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ararat Harutyunyan, Tom Denat, Vangelis Th. Paschos","submitted_at":"2019-02-05T19:13:12Z","abstract_excerpt":"The average-case complexity of a branch-and-bound algorithms for Minimum Dominating Set problem in random graphs in the G(n,p) model is studied. We identify phase transitions between subexponential and exponential average-case complexities, depending on the growth of the probability p with respect to the number n of nodes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01874","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":"1902.01874","created_at":"2026-05-17T23:54:38.560145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01874v1","created_at":"2026-05-17T23:54:38.560145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01874","created_at":"2026-05-17T23:54:38.560145+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDV4U4JN3J3B","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDV4U4JN3J3BHMIT","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDV4U4JN","created_at":"2026-05-18T12:33:33.725879+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/XDV4U4JN3J3BHMITEUQUCVVNPF","json":"https://pith.science/pith/XDV4U4JN3J3BHMITEUQUCVVNPF.json","graph_json":"https://pith.science/api/pith-number/XDV4U4JN3J3BHMITEUQUCVVNPF/graph.json","events_json":"https://pith.science/api/pith-number/XDV4U4JN3J3BHMITEUQUCVVNPF/events.json","paper":"https://pith.science/paper/XDV4U4JN"},"agent_actions":{"view_html":"https://pith.science/pith/XDV4U4JN3J3BHMITEUQUCVVNPF","download_json":"https://pith.science/pith/XDV4U4JN3J3BHMITEUQUCVVNPF.json","view_paper":"https://pith.science/paper/XDV4U4JN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01874&json=true","fetch_graph":"https://pith.science/api/pith-number/XDV4U4JN3J3BHMITEUQUCVVNPF/graph.json","fetch_events":"https://pith.science/api/pith-number/XDV4U4JN3J3BHMITEUQUCVVNPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDV4U4JN3J3BHMITEUQUCVVNPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDV4U4JN3J3BHMITEUQUCVVNPF/action/storage_attestation","attest_author":"https://pith.science/pith/XDV4U4JN3J3BHMITEUQUCVVNPF/action/author_attestation","sign_citation":"https://pith.science/pith/XDV4U4JN3J3BHMITEUQUCVVNPF/action/citation_signature","submit_replication":"https://pith.science/pith/XDV4U4JN3J3BHMITEUQUCVVNPF/action/replication_record"}},"created_at":"2026-05-17T23:54:38.560145+00:00","updated_at":"2026-05-17T23:54:38.560145+00:00"}