{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:X4A26ZEXNZW7OUOWL4TWW5O2WJ","short_pith_number":"pith:X4A26ZEX","schema_version":"1.0","canonical_sha256":"bf01af64976e6df751d65f276b75dab25ecaf22084a312f510067d0ed7dfdd0b","source":{"kind":"arxiv","id":"2606.30588","version":1},"attestation_state":"computed","paper":{"title":"A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree equal to 7","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Arpan Sadhukhan, R. B. Sandeep, Sagnik Sen","submitted_at":"2026-06-29T17:31:24Z","abstract_excerpt":"We prove Seymour's second neighborhood conjecture on oriented graphs whose minimum out-degree is equal to $7$. This gives, to our knowledge, the first improvement of the minimum out-degree threshold in two decades, since the work of Kaneko and Locke in 2001, who resolved the conjecture for oriented graphs whose minimum out-degree is at most $6$. The proof is partially computer-assisted: after a sequence of local reductions, the remaining finite obstruction models are eliminated by reproducible OR-Tools CP-SAT infeasibility checks."},"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":"2606.30588","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-29T17:31:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6150f7314d2914dda75c35b0dbc5a981e8769cb4b21f2bef68d2d6cab725a926","abstract_canon_sha256":"ddae39445f1363259fef9edde0ae8b9bd63555a2197fddb066ef93fec8f375c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:18:21.750749Z","signature_b64":"6MGspm8I+xiq9gIs1K+0BucIa0srFdCStz+ZlErFt+aX3nnCdzu/kL1u9CQyO36M+A2Vz+EovqktB7oYkhJHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf01af64976e6df751d65f276b75dab25ecaf22084a312f510067d0ed7dfdd0b","last_reissued_at":"2026-06-30T02:18:21.750256Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:18:21.750256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree equal to 7","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Arpan Sadhukhan, R. B. Sandeep, Sagnik Sen","submitted_at":"2026-06-29T17:31:24Z","abstract_excerpt":"We prove Seymour's second neighborhood conjecture on oriented graphs whose minimum out-degree is equal to $7$. This gives, to our knowledge, the first improvement of the minimum out-degree threshold in two decades, since the work of Kaneko and Locke in 2001, who resolved the conjecture for oriented graphs whose minimum out-degree is at most $6$. The proof is partially computer-assisted: after a sequence of local reductions, the remaining finite obstruction models are eliminated by reproducible OR-Tools CP-SAT infeasibility checks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30588","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.30588/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.30588","created_at":"2026-06-30T02:18:21.750330+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30588v1","created_at":"2026-06-30T02:18:21.750330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30588","created_at":"2026-06-30T02:18:21.750330+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4A26ZEXNZW7","created_at":"2026-06-30T02:18:21.750330+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4A26ZEXNZW7OUOW","created_at":"2026-06-30T02:18:21.750330+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4A26ZEX","created_at":"2026-06-30T02:18:21.750330+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/X4A26ZEXNZW7OUOWL4TWW5O2WJ","json":"https://pith.science/pith/X4A26ZEXNZW7OUOWL4TWW5O2WJ.json","graph_json":"https://pith.science/api/pith-number/X4A26ZEXNZW7OUOWL4TWW5O2WJ/graph.json","events_json":"https://pith.science/api/pith-number/X4A26ZEXNZW7OUOWL4TWW5O2WJ/events.json","paper":"https://pith.science/paper/X4A26ZEX"},"agent_actions":{"view_html":"https://pith.science/pith/X4A26ZEXNZW7OUOWL4TWW5O2WJ","download_json":"https://pith.science/pith/X4A26ZEXNZW7OUOWL4TWW5O2WJ.json","view_paper":"https://pith.science/paper/X4A26ZEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30588&json=true","fetch_graph":"https://pith.science/api/pith-number/X4A26ZEXNZW7OUOWL4TWW5O2WJ/graph.json","fetch_events":"https://pith.science/api/pith-number/X4A26ZEXNZW7OUOWL4TWW5O2WJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4A26ZEXNZW7OUOWL4TWW5O2WJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4A26ZEXNZW7OUOWL4TWW5O2WJ/action/storage_attestation","attest_author":"https://pith.science/pith/X4A26ZEXNZW7OUOWL4TWW5O2WJ/action/author_attestation","sign_citation":"https://pith.science/pith/X4A26ZEXNZW7OUOWL4TWW5O2WJ/action/citation_signature","submit_replication":"https://pith.science/pith/X4A26ZEXNZW7OUOWL4TWW5O2WJ/action/replication_record"}},"created_at":"2026-06-30T02:18:21.750330+00:00","updated_at":"2026-06-30T02:18:21.750330+00:00"}