{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QHFSLNAJXYJN7QGL3JBXUA7RSZ","short_pith_number":"pith:QHFSLNAJ","schema_version":"1.0","canonical_sha256":"81cb25b409be12dfc0cbda437a03f1965b971222ceea62fea6f53e1608b7a94a","source":{"kind":"arxiv","id":"1306.3602","version":1},"attestation_state":"computed","paper":{"title":"Faster Deterministic Algorithms for Packing, Matching and $t$-Dominating Set Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shenshi Chen, Zhixiang Chen","submitted_at":"2013-06-15T19:48:52Z","abstract_excerpt":"In this paper, we devise three deterministic algorithms for solving the $m$-set $k$-packing, $m$-dimensional $k$-matching, and $t$-dominating set problems in time $O^*(5.44^{mk})$, $O^*(5.44^{(m-1)k})$ and $O^*(5.44^{t})$, respectively. Although recently there has been remarkable progress on randomized solutions to those problems, our bounds make good improvements on the best known bounds for deterministic solutions to those problems."},"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":"1306.3602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-15T19:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"51a10b06338ebd453cd5ca35c2a8fa35bc32f6d10dcc9fb069f63d474ae7e152","abstract_canon_sha256":"8a1d3dd3a2b335b15aea199ece1a021ac837268d2e1679add9896a231bc8707e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:47.122061Z","signature_b64":"Ug7UPeGfx+YXBSB02OxnfGFeg8Ax3pA8r/86n4dRf1AiVJ7xY5RkKJRf5OHT/1VRuSs3uy4D1vczealGFcoYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81cb25b409be12dfc0cbda437a03f1965b971222ceea62fea6f53e1608b7a94a","last_reissued_at":"2026-05-18T03:20:47.121167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:47.121167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Deterministic Algorithms for Packing, Matching and $t$-Dominating Set Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shenshi Chen, Zhixiang Chen","submitted_at":"2013-06-15T19:48:52Z","abstract_excerpt":"In this paper, we devise three deterministic algorithms for solving the $m$-set $k$-packing, $m$-dimensional $k$-matching, and $t$-dominating set problems in time $O^*(5.44^{mk})$, $O^*(5.44^{(m-1)k})$ and $O^*(5.44^{t})$, respectively. Although recently there has been remarkable progress on randomized solutions to those problems, our bounds make good improvements on the best known bounds for deterministic solutions to those problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3602","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":"1306.3602","created_at":"2026-05-18T03:20:47.121333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3602v1","created_at":"2026-05-18T03:20:47.121333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3602","created_at":"2026-05-18T03:20:47.121333+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHFSLNAJXYJN","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHFSLNAJXYJN7QGL","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHFSLNAJ","created_at":"2026-05-18T12:27:57.521954+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/QHFSLNAJXYJN7QGL3JBXUA7RSZ","json":"https://pith.science/pith/QHFSLNAJXYJN7QGL3JBXUA7RSZ.json","graph_json":"https://pith.science/api/pith-number/QHFSLNAJXYJN7QGL3JBXUA7RSZ/graph.json","events_json":"https://pith.science/api/pith-number/QHFSLNAJXYJN7QGL3JBXUA7RSZ/events.json","paper":"https://pith.science/paper/QHFSLNAJ"},"agent_actions":{"view_html":"https://pith.science/pith/QHFSLNAJXYJN7QGL3JBXUA7RSZ","download_json":"https://pith.science/pith/QHFSLNAJXYJN7QGL3JBXUA7RSZ.json","view_paper":"https://pith.science/paper/QHFSLNAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3602&json=true","fetch_graph":"https://pith.science/api/pith-number/QHFSLNAJXYJN7QGL3JBXUA7RSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/QHFSLNAJXYJN7QGL3JBXUA7RSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHFSLNAJXYJN7QGL3JBXUA7RSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHFSLNAJXYJN7QGL3JBXUA7RSZ/action/storage_attestation","attest_author":"https://pith.science/pith/QHFSLNAJXYJN7QGL3JBXUA7RSZ/action/author_attestation","sign_citation":"https://pith.science/pith/QHFSLNAJXYJN7QGL3JBXUA7RSZ/action/citation_signature","submit_replication":"https://pith.science/pith/QHFSLNAJXYJN7QGL3JBXUA7RSZ/action/replication_record"}},"created_at":"2026-05-18T03:20:47.121333+00:00","updated_at":"2026-05-18T03:20:47.121333+00:00"}