{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HW3IIR77IMYNKZ7J3EGBIEKPTW","short_pith_number":"pith:HW3IIR77","schema_version":"1.0","canonical_sha256":"3db68447ff4330d567e9d90c14114f9d8b7cd242a3c4e3f808fdf2b6d7b0346f","source":{"kind":"arxiv","id":"1507.02875","version":1},"attestation_state":"computed","paper":{"title":"The 3/5-conjecture for weakly $S(K_{1,3})$-free forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Simon Schmidt","submitted_at":"2015-07-10T12:33:42Z","abstract_excerpt":"The $3/5$-conjecture for the domination game states that the game domination numbers of an isolate-free graph $G$ on $n$ vertices are bounded as follows: $\\gamma_g(G)\\leq \\frac{3n}5 $ and $\\gamma_g'(G)\\leq \\frac{3n+2}5 $. Recent progress have been done on the subject and the conjecture is now proved for graphs with minimum degree at least $2$. One powerful tool, introduced by Bujt\\'as is the so-called greedy strategy for \\D. In particular, using this strategy, she has proved the conjecture for isolate-free forests without leafs at distance $4$. In this paper, we improve this strategy to extend"},"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":"1507.02875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T12:33:42Z","cross_cats_sorted":[],"title_canon_sha256":"2cb606b735bd9fcc8520ece1bc01cc23a1f4a38a0278fa08d353e3553495f5bd","abstract_canon_sha256":"229777436b935c3c90a5a2bcb2d70995cfb7fdceae535436027c43370f1ba504"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:03.025086Z","signature_b64":"6UDsfpia+7COzhPXOa8+01hflhaIGf1KiZE69CxsX1nRopqWNbvTEeq+vKvpslZ+xc+YIo47WFquiTvLkteFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3db68447ff4330d567e9d90c14114f9d8b7cd242a3c4e3f808fdf2b6d7b0346f","last_reissued_at":"2026-05-18T01:37:03.024672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:03.024672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The 3/5-conjecture for weakly $S(K_{1,3})$-free forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Simon Schmidt","submitted_at":"2015-07-10T12:33:42Z","abstract_excerpt":"The $3/5$-conjecture for the domination game states that the game domination numbers of an isolate-free graph $G$ on $n$ vertices are bounded as follows: $\\gamma_g(G)\\leq \\frac{3n}5 $ and $\\gamma_g'(G)\\leq \\frac{3n+2}5 $. Recent progress have been done on the subject and the conjecture is now proved for graphs with minimum degree at least $2$. One powerful tool, introduced by Bujt\\'as is the so-called greedy strategy for \\D. In particular, using this strategy, she has proved the conjecture for isolate-free forests without leafs at distance $4$. In this paper, we improve this strategy to extend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02875","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":"1507.02875","created_at":"2026-05-18T01:37:03.024738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02875v1","created_at":"2026-05-18T01:37:03.024738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02875","created_at":"2026-05-18T01:37:03.024738+00:00"},{"alias_kind":"pith_short_12","alias_value":"HW3IIR77IMYN","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HW3IIR77IMYNKZ7J","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HW3IIR77","created_at":"2026-05-18T12:29:25.134429+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/HW3IIR77IMYNKZ7J3EGBIEKPTW","json":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW.json","graph_json":"https://pith.science/api/pith-number/HW3IIR77IMYNKZ7J3EGBIEKPTW/graph.json","events_json":"https://pith.science/api/pith-number/HW3IIR77IMYNKZ7J3EGBIEKPTW/events.json","paper":"https://pith.science/paper/HW3IIR77"},"agent_actions":{"view_html":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW","download_json":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW.json","view_paper":"https://pith.science/paper/HW3IIR77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02875&json=true","fetch_graph":"https://pith.science/api/pith-number/HW3IIR77IMYNKZ7J3EGBIEKPTW/graph.json","fetch_events":"https://pith.science/api/pith-number/HW3IIR77IMYNKZ7J3EGBIEKPTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/action/storage_attestation","attest_author":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/action/author_attestation","sign_citation":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/action/citation_signature","submit_replication":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/action/replication_record"}},"created_at":"2026-05-18T01:37:03.024738+00:00","updated_at":"2026-05-18T01:37:03.024738+00:00"}