{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CI6NTVXISD3HHKRETHD4BL6GAZ","short_pith_number":"pith:CI6NTVXI","schema_version":"1.0","canonical_sha256":"123cd9d6e890f673aa2499c7c0afc6067ac3af6acef22e8e9d76ff6bfee18469","source":{"kind":"arxiv","id":"1605.02469","version":1},"attestation_state":"computed","paper":{"title":"Upper bounds on the size of transitive subtournaments in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Koji Momihara, Sho Suda","submitted_at":"2016-05-09T08:34:52Z","abstract_excerpt":"In this paper, we consider upper bounds on the size of transitive subtournaments in a digraph. In particular, we give an analogy of Hoffman's bound for the size of cocliques in a regular graph. Furthermore, we partially improve the Hoffman type bound for doubly regular tournaments by using the technique of Greaves and Soicher for strongly regular graphs [4], which gives a new application of block intersection polynomials."},"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":"1605.02469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-09T08:34:52Z","cross_cats_sorted":[],"title_canon_sha256":"5130accb316fcb9e7b7adcd8c0fe1d6ccb457e6dd58df0f79666e8121514d971","abstract_canon_sha256":"72b7ca72f47cfcc9178ab68225a33fd579c00ce1b210590a4989576dba08fd52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:16.468570Z","signature_b64":"wmGtaGqJsJ1AT2c3a+g5BVPGFiC9fQ3R/p/OnRJasYVeviBFrjh7MqMjn6gjqyBM9GLTAjk8ZmnLMfqBoe/IBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"123cd9d6e890f673aa2499c7c0afc6067ac3af6acef22e8e9d76ff6bfee18469","last_reissued_at":"2026-05-18T01:15:16.468105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:16.468105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds on the size of transitive subtournaments in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Koji Momihara, Sho Suda","submitted_at":"2016-05-09T08:34:52Z","abstract_excerpt":"In this paper, we consider upper bounds on the size of transitive subtournaments in a digraph. In particular, we give an analogy of Hoffman's bound for the size of cocliques in a regular graph. Furthermore, we partially improve the Hoffman type bound for doubly regular tournaments by using the technique of Greaves and Soicher for strongly regular graphs [4], which gives a new application of block intersection polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02469","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":"1605.02469","created_at":"2026-05-18T01:15:16.468173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02469v1","created_at":"2026-05-18T01:15:16.468173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02469","created_at":"2026-05-18T01:15:16.468173+00:00"},{"alias_kind":"pith_short_12","alias_value":"CI6NTVXISD3H","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CI6NTVXISD3HHKRE","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CI6NTVXI","created_at":"2026-05-18T12:30:09.641336+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/CI6NTVXISD3HHKRETHD4BL6GAZ","json":"https://pith.science/pith/CI6NTVXISD3HHKRETHD4BL6GAZ.json","graph_json":"https://pith.science/api/pith-number/CI6NTVXISD3HHKRETHD4BL6GAZ/graph.json","events_json":"https://pith.science/api/pith-number/CI6NTVXISD3HHKRETHD4BL6GAZ/events.json","paper":"https://pith.science/paper/CI6NTVXI"},"agent_actions":{"view_html":"https://pith.science/pith/CI6NTVXISD3HHKRETHD4BL6GAZ","download_json":"https://pith.science/pith/CI6NTVXISD3HHKRETHD4BL6GAZ.json","view_paper":"https://pith.science/paper/CI6NTVXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02469&json=true","fetch_graph":"https://pith.science/api/pith-number/CI6NTVXISD3HHKRETHD4BL6GAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CI6NTVXISD3HHKRETHD4BL6GAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CI6NTVXISD3HHKRETHD4BL6GAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CI6NTVXISD3HHKRETHD4BL6GAZ/action/storage_attestation","attest_author":"https://pith.science/pith/CI6NTVXISD3HHKRETHD4BL6GAZ/action/author_attestation","sign_citation":"https://pith.science/pith/CI6NTVXISD3HHKRETHD4BL6GAZ/action/citation_signature","submit_replication":"https://pith.science/pith/CI6NTVXISD3HHKRETHD4BL6GAZ/action/replication_record"}},"created_at":"2026-05-18T01:15:16.468173+00:00","updated_at":"2026-05-18T01:15:16.468173+00:00"}