{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RYGIDNTL3Y3VDYCAIZLNPAAOX3","short_pith_number":"pith:RYGIDNTL","schema_version":"1.0","canonical_sha256":"8e0c81b66bde3751e0404656d7800ebed10ba367c0feeda6e567d67c1798b960","source":{"kind":"arxiv","id":"1704.01389","version":2},"attestation_state":"computed","paper":{"title":"Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Gregory Gutin, Ruijuan Li","submitted_at":"2017-04-05T12:51:58Z","abstract_excerpt":"Seymour's second neighbourhood conjecture asserts that every oriented graph has a vertex whose second out-neighbourhood is at least as large as its out-neighbourhood. In this paper, we prove that the conjecture holds for quasi-transitive oriented graphs, which is a superclass of tournaments and transitive acyclic digraphs. A digraph $D$ is called quasi-transitive is for every pair $xy,yz$ of arcs between distinct vertices $x,y,z$, $xz$ or $zx$ (\"or\" is inclusive here) is in $D$."},"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":"1704.01389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-05T12:51:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"db66bb3e54904151d546630a87e06875063550875ba1d4d1bc6b175bae594b57","abstract_canon_sha256":"435bd5f9fdbda1370ad0ad2cc3d8d95149641927f11e2be94f2535cfe6b4fe72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:17.035775Z","signature_b64":"K2cAh0jQVlUvmxUo0HdkCDV88gQDYcHXcvqwC/wa+17U/VCNB7DyIeTDnQhVae4uPlz2DQno+nxOAAxWHUsLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e0c81b66bde3751e0404656d7800ebed10ba367c0feeda6e567d67c1798b960","last_reissued_at":"2026-05-18T00:30:17.034814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:17.034814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Gregory Gutin, Ruijuan Li","submitted_at":"2017-04-05T12:51:58Z","abstract_excerpt":"Seymour's second neighbourhood conjecture asserts that every oriented graph has a vertex whose second out-neighbourhood is at least as large as its out-neighbourhood. In this paper, we prove that the conjecture holds for quasi-transitive oriented graphs, which is a superclass of tournaments and transitive acyclic digraphs. A digraph $D$ is called quasi-transitive is for every pair $xy,yz$ of arcs between distinct vertices $x,y,z$, $xz$ or $zx$ (\"or\" is inclusive here) is in $D$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01389","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":"1704.01389","created_at":"2026-05-18T00:30:17.034963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01389v2","created_at":"2026-05-18T00:30:17.034963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01389","created_at":"2026-05-18T00:30:17.034963+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYGIDNTL3Y3V","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYGIDNTL3Y3VDYCA","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYGIDNTL","created_at":"2026-05-18T12:31:43.269735+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/RYGIDNTL3Y3VDYCAIZLNPAAOX3","json":"https://pith.science/pith/RYGIDNTL3Y3VDYCAIZLNPAAOX3.json","graph_json":"https://pith.science/api/pith-number/RYGIDNTL3Y3VDYCAIZLNPAAOX3/graph.json","events_json":"https://pith.science/api/pith-number/RYGIDNTL3Y3VDYCAIZLNPAAOX3/events.json","paper":"https://pith.science/paper/RYGIDNTL"},"agent_actions":{"view_html":"https://pith.science/pith/RYGIDNTL3Y3VDYCAIZLNPAAOX3","download_json":"https://pith.science/pith/RYGIDNTL3Y3VDYCAIZLNPAAOX3.json","view_paper":"https://pith.science/paper/RYGIDNTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01389&json=true","fetch_graph":"https://pith.science/api/pith-number/RYGIDNTL3Y3VDYCAIZLNPAAOX3/graph.json","fetch_events":"https://pith.science/api/pith-number/RYGIDNTL3Y3VDYCAIZLNPAAOX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYGIDNTL3Y3VDYCAIZLNPAAOX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYGIDNTL3Y3VDYCAIZLNPAAOX3/action/storage_attestation","attest_author":"https://pith.science/pith/RYGIDNTL3Y3VDYCAIZLNPAAOX3/action/author_attestation","sign_citation":"https://pith.science/pith/RYGIDNTL3Y3VDYCAIZLNPAAOX3/action/citation_signature","submit_replication":"https://pith.science/pith/RYGIDNTL3Y3VDYCAIZLNPAAOX3/action/replication_record"}},"created_at":"2026-05-18T00:30:17.034963+00:00","updated_at":"2026-05-18T00:30:17.034963+00:00"}