{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4BC2ZUCAFTMXSSLHJI725KKXWM","short_pith_number":"pith:4BC2ZUCA","schema_version":"1.0","canonical_sha256":"e045acd0402cd97949674a3faea957b32d29dd59641502a4ce7ac093996ed729","source":{"kind":"arxiv","id":"1710.06680","version":2},"attestation_state":"computed","paper":{"title":"Near-domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Bruce Reed, Paul Seymour","submitted_at":"2017-10-18T11:22:38Z","abstract_excerpt":"A vertex u of a graph t-dominates a vertex v if there are at most t vertices different from u,v that are adjacent to v and not to u; and a graph is t-dominating if for every pair of distinct vertices, one of them t-dominates the other. Our main result says that if a graph is t-dominating, then it is close (in an appropriate sense) to being 0-dominating. We also show that an analogous statement for digraphs is false; and discuss some connections with the Erdos-Hajnal conjecture."},"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":"1710.06680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-18T11:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"cff20bb62690fe882c6c17460b389111ae939198bfcdf3689916f1ade7225184","abstract_canon_sha256":"b93263e86406666b4c0a1dd3ae5c0677ce90924805d3b953375fe63c2480d016"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:29.400836Z","signature_b64":"4XTWpTYtYhNXOU+TrCycUULmJKqwAIIXYCgAvQSNN1gIRzayAvGRt5WzmTUp/kKaOOqz6CuTgZ9yohe8h7zjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e045acd0402cd97949674a3faea957b32d29dd59641502a4ce7ac093996ed729","last_reissued_at":"2026-05-17T23:52:29.400241Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:29.400241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Bruce Reed, Paul Seymour","submitted_at":"2017-10-18T11:22:38Z","abstract_excerpt":"A vertex u of a graph t-dominates a vertex v if there are at most t vertices different from u,v that are adjacent to v and not to u; and a graph is t-dominating if for every pair of distinct vertices, one of them t-dominates the other. Our main result says that if a graph is t-dominating, then it is close (in an appropriate sense) to being 0-dominating. We also show that an analogous statement for digraphs is false; and discuss some connections with the Erdos-Hajnal conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06680","kind":"arxiv","version":2},"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":"1710.06680","created_at":"2026-05-17T23:52:29.400325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.06680v2","created_at":"2026-05-17T23:52:29.400325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06680","created_at":"2026-05-17T23:52:29.400325+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BC2ZUCAFTMX","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BC2ZUCAFTMXSSLH","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BC2ZUCA","created_at":"2026-05-18T12:30:58.224056+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/4BC2ZUCAFTMXSSLHJI725KKXWM","json":"https://pith.science/pith/4BC2ZUCAFTMXSSLHJI725KKXWM.json","graph_json":"https://pith.science/api/pith-number/4BC2ZUCAFTMXSSLHJI725KKXWM/graph.json","events_json":"https://pith.science/api/pith-number/4BC2ZUCAFTMXSSLHJI725KKXWM/events.json","paper":"https://pith.science/paper/4BC2ZUCA"},"agent_actions":{"view_html":"https://pith.science/pith/4BC2ZUCAFTMXSSLHJI725KKXWM","download_json":"https://pith.science/pith/4BC2ZUCAFTMXSSLHJI725KKXWM.json","view_paper":"https://pith.science/paper/4BC2ZUCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.06680&json=true","fetch_graph":"https://pith.science/api/pith-number/4BC2ZUCAFTMXSSLHJI725KKXWM/graph.json","fetch_events":"https://pith.science/api/pith-number/4BC2ZUCAFTMXSSLHJI725KKXWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BC2ZUCAFTMXSSLHJI725KKXWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BC2ZUCAFTMXSSLHJI725KKXWM/action/storage_attestation","attest_author":"https://pith.science/pith/4BC2ZUCAFTMXSSLHJI725KKXWM/action/author_attestation","sign_citation":"https://pith.science/pith/4BC2ZUCAFTMXSSLHJI725KKXWM/action/citation_signature","submit_replication":"https://pith.science/pith/4BC2ZUCAFTMXSSLHJI725KKXWM/action/replication_record"}},"created_at":"2026-05-17T23:52:29.400325+00:00","updated_at":"2026-05-17T23:52:29.400325+00:00"}