{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HW3IIR77IMYNKZ7J3EGBIEKPTW","short_pith_number":"pith:HW3IIR77","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"},"canonical_sha256":"3db68447ff4330d567e9d90c14114f9d8b7cd242a3c4e3f808fdf2b6d7b0346f","source":{"kind":"arxiv","id":"1507.02875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02875","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02875v1","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02875","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"HW3IIR77IMYN","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HW3IIR77IMYNKZ7J","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HW3IIR77","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HW3IIR77IMYNKZ7J3EGBIEKPTW","target":"record","payload":{"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"},"canonical_sha256":"3db68447ff4330d567e9d90c14114f9d8b7cd242a3c4e3f808fdf2b6d7b0346f","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"},"source_kind":"arxiv","source_id":"1507.02875","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asAfuBAB72BzvNm0LSnlFEcscY68wPqzrDTU7cEbd7Dcgmray3WEt6tFENdLDszJw4S7GZAYdoG7ecI1Nr+fDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:10:20.047569Z"},"content_sha256":"ee9282dd2e3a5da23e8a5dc5fd1cb535785fdb1ca6011754f7d52f3a134d1224","schema_version":"1.0","event_id":"sha256:ee9282dd2e3a5da23e8a5dc5fd1cb535785fdb1ca6011754f7d52f3a134d1224"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HW3IIR77IMYNKZ7J3EGBIEKPTW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SP8OE1V22nOuEC5kLOX/VdkJFxNp+vIcndsoTT1+y5bXNS3rYeu+71kLvHPYRZ0VftDV4gQ7zJ+4pOzzHUhUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:10:20.048059Z"},"content_sha256":"698520bc89043044d63152a26c474ca101698acf647d7f31778ea1d16fa08c4a","schema_version":"1.0","event_id":"sha256:698520bc89043044d63152a26c474ca101698acf647d7f31778ea1d16fa08c4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/bundle.json","state_url":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T19:10:20Z","links":{"resolver":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW","bundle":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/bundle.json","state":"https://pith.science/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HW3IIR77IMYNKZ7J3EGBIEKPTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HW3IIR77IMYNKZ7J3EGBIEKPTW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"229777436b935c3c90a5a2bcb2d70995cfb7fdceae535436027c43370f1ba504","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T12:33:42Z","title_canon_sha256":"2cb606b735bd9fcc8520ece1bc01cc23a1f4a38a0278fa08d353e3553495f5bd"},"schema_version":"1.0","source":{"id":"1507.02875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02875","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02875v1","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02875","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"HW3IIR77IMYN","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HW3IIR77IMYNKZ7J","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HW3IIR77","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:698520bc89043044d63152a26c474ca101698acf647d7f31778ea1d16fa08c4a","target":"graph","created_at":"2026-05-18T01:37:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Simon Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T12:33:42Z","title":"The 3/5-conjecture for weakly $S(K_{1,3})$-free forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02875","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ee9282dd2e3a5da23e8a5dc5fd1cb535785fdb1ca6011754f7d52f3a134d1224","target":"record","created_at":"2026-05-18T01:37:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"229777436b935c3c90a5a2bcb2d70995cfb7fdceae535436027c43370f1ba504","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T12:33:42Z","title_canon_sha256":"2cb606b735bd9fcc8520ece1bc01cc23a1f4a38a0278fa08d353e3553495f5bd"},"schema_version":"1.0","source":{"id":"1507.02875","kind":"arxiv","version":1}},"canonical_sha256":"3db68447ff4330d567e9d90c14114f9d8b7cd242a3c4e3f808fdf2b6d7b0346f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3db68447ff4330d567e9d90c14114f9d8b7cd242a3c4e3f808fdf2b6d7b0346f","first_computed_at":"2026-05-18T01:37:03.024672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:03.024672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6UDsfpia+7COzhPXOa8+01hflhaIGf1KiZE69CxsX1nRopqWNbvTEeq+vKvpslZ+xc+YIo47WFquiTvLkteFCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:03.025086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee9282dd2e3a5da23e8a5dc5fd1cb535785fdb1ca6011754f7d52f3a134d1224","sha256:698520bc89043044d63152a26c474ca101698acf647d7f31778ea1d16fa08c4a"],"state_sha256":"a03bfb7d6ac5149929b7abcb4ec8c288b2cc000153dd939b0c872be788047315"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9+v2YoQZGOyGi0inAHAUUJySBFSbfbHvDqT9MNfbPVFlX29md3kMeHPdosVjvqg5Bwdc6Aas0/KCq+z7GMGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:10:20.051093Z","bundle_sha256":"3dd314fe0d434b646f42ebccc11fe4faddf62586a248ac04a4580e8e8121e779"}}