{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SJ7ST2D6VYHUVUBYR6NXLP7FPZ","short_pith_number":"pith:SJ7ST2D6","schema_version":"1.0","canonical_sha256":"927f29e87eae0f4ad0388f9b75bfe57e65e9b2def70cb15a1a9a3599299f21d7","source":{"kind":"arxiv","id":"1701.00328","version":1},"attestation_state":"computed","paper":{"title":"On Seymour's Second Neighborhood Conjecture of m-free Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Liang, Jun-Ming Xu","submitted_at":"2017-01-02T08:01:58Z","abstract_excerpt":"This paper gives an approximate result related to Seymour's Second Neighborhood conjecture, that is, for any $m$-free digraph $G$, there exists a vertex $v\\in V(G)$ and a real number $\\lambda_m$ such that $d^{++}(v)\\geq \\lambda_m d^+(v)$, and $\\lambda_m \\rightarrow 1$ while $m \\rightarrow +\\infty$. This result generalizes and improves some known results in a sense."},"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":"1701.00328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-02T08:01:58Z","cross_cats_sorted":[],"title_canon_sha256":"787afd22d4d26cfe2e5e704669389d248b83b098a5b1749317a657fcd34537df","abstract_canon_sha256":"b02a8e2bd7a86fd050358c9557e5eedea4cddd01bc0cd906996dae01d8ac71d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:35.856335Z","signature_b64":"CpJtmxxD5FokLmPL2P20TbZXV6dHWXfN/8klswdzWCDpDO2XoERsy+0FwiFM7WSpC5Cte/Ocd3XJLSZOkJu7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"927f29e87eae0f4ad0388f9b75bfe57e65e9b2def70cb15a1a9a3599299f21d7","last_reissued_at":"2026-05-18T00:53:35.855790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:35.855790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Seymour's Second Neighborhood Conjecture of m-free Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Liang, Jun-Ming Xu","submitted_at":"2017-01-02T08:01:58Z","abstract_excerpt":"This paper gives an approximate result related to Seymour's Second Neighborhood conjecture, that is, for any $m$-free digraph $G$, there exists a vertex $v\\in V(G)$ and a real number $\\lambda_m$ such that $d^{++}(v)\\geq \\lambda_m d^+(v)$, and $\\lambda_m \\rightarrow 1$ while $m \\rightarrow +\\infty$. This result generalizes and improves some known results in a sense."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00328","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":"1701.00328","created_at":"2026-05-18T00:53:35.855869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00328v1","created_at":"2026-05-18T00:53:35.855869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00328","created_at":"2026-05-18T00:53:35.855869+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJ7ST2D6VYHU","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJ7ST2D6VYHUVUBY","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJ7ST2D6","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/SJ7ST2D6VYHUVUBYR6NXLP7FPZ","json":"https://pith.science/pith/SJ7ST2D6VYHUVUBYR6NXLP7FPZ.json","graph_json":"https://pith.science/api/pith-number/SJ7ST2D6VYHUVUBYR6NXLP7FPZ/graph.json","events_json":"https://pith.science/api/pith-number/SJ7ST2D6VYHUVUBYR6NXLP7FPZ/events.json","paper":"https://pith.science/paper/SJ7ST2D6"},"agent_actions":{"view_html":"https://pith.science/pith/SJ7ST2D6VYHUVUBYR6NXLP7FPZ","download_json":"https://pith.science/pith/SJ7ST2D6VYHUVUBYR6NXLP7FPZ.json","view_paper":"https://pith.science/paper/SJ7ST2D6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00328&json=true","fetch_graph":"https://pith.science/api/pith-number/SJ7ST2D6VYHUVUBYR6NXLP7FPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SJ7ST2D6VYHUVUBYR6NXLP7FPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJ7ST2D6VYHUVUBYR6NXLP7FPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJ7ST2D6VYHUVUBYR6NXLP7FPZ/action/storage_attestation","attest_author":"https://pith.science/pith/SJ7ST2D6VYHUVUBYR6NXLP7FPZ/action/author_attestation","sign_citation":"https://pith.science/pith/SJ7ST2D6VYHUVUBYR6NXLP7FPZ/action/citation_signature","submit_replication":"https://pith.science/pith/SJ7ST2D6VYHUVUBYR6NXLP7FPZ/action/replication_record"}},"created_at":"2026-05-18T00:53:35.855869+00:00","updated_at":"2026-05-18T00:53:35.855869+00:00"}