{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UU3LWHFJO5RR37JQS2U5XV4AOB","short_pith_number":"pith:UU3LWHFJ","schema_version":"1.0","canonical_sha256":"a536bb1ca977631dfd3096a9dbd780705340b47a4074f86a07107cb589f7c79c","source":{"kind":"arxiv","id":"1806.02590","version":3},"attestation_state":"computed","paper":{"title":"Greedy domination on biclique-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Sebastian Siebertz","submitted_at":"2018-06-07T09:57:27Z","abstract_excerpt":"The greedy algorithm for approximating dominating sets is a simple method that is known to compute an $(\\ln n+1)$-approximation of a minimum dominating set on any graph with $n$ vertices. We show that a small modification of the greedy algorithm can be used to compute an $O(t^2\\cdot \\ln k)$-approximation, where~$k$ is the size of a minimum dominating set, on graphs that exclude the complete bipartite graph $K_{t,t}$ as a subgraph."},"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":"1806.02590","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-07T09:57:27Z","cross_cats_sorted":[],"title_canon_sha256":"1424edf3c6654a1d10acee2810affe3d9d4a40f617e20615b17a07c1081c98dc","abstract_canon_sha256":"cfcb535b4dd92ff18b658461e935bd999722abe624b89d0c102d622303f09a4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:10.009452Z","signature_b64":"4/T57HyW+OOzTV0Vn7UmP+bB6HYGy+24RBDDcaOyUFUMiGKh+6Udp9kxuVxWxoTT4TleyVFVIPVgMpGoOwPPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a536bb1ca977631dfd3096a9dbd780705340b47a4074f86a07107cb589f7c79c","last_reissued_at":"2026-05-17T23:56:10.008776Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:10.008776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy domination on biclique-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Sebastian Siebertz","submitted_at":"2018-06-07T09:57:27Z","abstract_excerpt":"The greedy algorithm for approximating dominating sets is a simple method that is known to compute an $(\\ln n+1)$-approximation of a minimum dominating set on any graph with $n$ vertices. We show that a small modification of the greedy algorithm can be used to compute an $O(t^2\\cdot \\ln k)$-approximation, where~$k$ is the size of a minimum dominating set, on graphs that exclude the complete bipartite graph $K_{t,t}$ as a subgraph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02590","kind":"arxiv","version":3},"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":"1806.02590","created_at":"2026-05-17T23:56:10.008897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02590v3","created_at":"2026-05-17T23:56:10.008897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02590","created_at":"2026-05-17T23:56:10.008897+00:00"},{"alias_kind":"pith_short_12","alias_value":"UU3LWHFJO5RR","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UU3LWHFJO5RR37JQ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UU3LWHFJ","created_at":"2026-05-18T12:32:56.356000+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/UU3LWHFJO5RR37JQS2U5XV4AOB","json":"https://pith.science/pith/UU3LWHFJO5RR37JQS2U5XV4AOB.json","graph_json":"https://pith.science/api/pith-number/UU3LWHFJO5RR37JQS2U5XV4AOB/graph.json","events_json":"https://pith.science/api/pith-number/UU3LWHFJO5RR37JQS2U5XV4AOB/events.json","paper":"https://pith.science/paper/UU3LWHFJ"},"agent_actions":{"view_html":"https://pith.science/pith/UU3LWHFJO5RR37JQS2U5XV4AOB","download_json":"https://pith.science/pith/UU3LWHFJO5RR37JQS2U5XV4AOB.json","view_paper":"https://pith.science/paper/UU3LWHFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02590&json=true","fetch_graph":"https://pith.science/api/pith-number/UU3LWHFJO5RR37JQS2U5XV4AOB/graph.json","fetch_events":"https://pith.science/api/pith-number/UU3LWHFJO5RR37JQS2U5XV4AOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UU3LWHFJO5RR37JQS2U5XV4AOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UU3LWHFJO5RR37JQS2U5XV4AOB/action/storage_attestation","attest_author":"https://pith.science/pith/UU3LWHFJO5RR37JQS2U5XV4AOB/action/author_attestation","sign_citation":"https://pith.science/pith/UU3LWHFJO5RR37JQS2U5XV4AOB/action/citation_signature","submit_replication":"https://pith.science/pith/UU3LWHFJO5RR37JQS2U5XV4AOB/action/replication_record"}},"created_at":"2026-05-17T23:56:10.008897+00:00","updated_at":"2026-05-17T23:56:10.008897+00:00"}