{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DG3MXBZ4NMSY7ZVIZVIRQEHXZO","short_pith_number":"pith:DG3MXBZ4","schema_version":"1.0","canonical_sha256":"19b6cb873c6b258fe6a8cd511810f7cbac4129d05581778e01159a305bc4c8e7","source":{"kind":"arxiv","id":"1505.05200","version":2},"attestation_state":"computed","paper":{"title":"On the maximum density of fixed strongly connected subtournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Cristiane M. Sato, Leonardo N. Coregliano, Roberto F. Parente","submitted_at":"2015-05-19T21:55:26Z","abstract_excerpt":"We study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for five tournaments as well as unique extremal sequences for each tournament. As a byproduct we also characterize tournaments that are recursive blow-ups of a 3-cycle as tournaments that avoid three specific tournaments of size 5."},"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":"1505.05200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T21:55:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7761b37dd1d918dc02ea654d5b4fc68dd4813e4a0bb661799bceec9847bff002","abstract_canon_sha256":"ad6f9f99b329c9c83b0d0b5446cf6f8325a228fde6dea068699d1c0afab498d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:32.105764Z","signature_b64":"yhI0TgqdaV7Rf7JSH6gfeK8dT5bRvafvhxBu7obvSgfxLsP69fNi0RphIXWEAa2mN4xo3pZwL7tScl+S0jWlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19b6cb873c6b258fe6a8cd511810f7cbac4129d05581778e01159a305bc4c8e7","last_reissued_at":"2026-05-18T01:33:32.105123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:32.105123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum density of fixed strongly connected subtournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Cristiane M. Sato, Leonardo N. Coregliano, Roberto F. Parente","submitted_at":"2015-05-19T21:55:26Z","abstract_excerpt":"We study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for five tournaments as well as unique extremal sequences for each tournament. As a byproduct we also characterize tournaments that are recursive blow-ups of a 3-cycle as tournaments that avoid three specific tournaments of size 5."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05200","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":"1505.05200","created_at":"2026-05-18T01:33:32.105210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05200v2","created_at":"2026-05-18T01:33:32.105210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05200","created_at":"2026-05-18T01:33:32.105210+00:00"},{"alias_kind":"pith_short_12","alias_value":"DG3MXBZ4NMSY","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DG3MXBZ4NMSY7ZVI","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DG3MXBZ4","created_at":"2026-05-18T12:29:17.054201+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/DG3MXBZ4NMSY7ZVIZVIRQEHXZO","json":"https://pith.science/pith/DG3MXBZ4NMSY7ZVIZVIRQEHXZO.json","graph_json":"https://pith.science/api/pith-number/DG3MXBZ4NMSY7ZVIZVIRQEHXZO/graph.json","events_json":"https://pith.science/api/pith-number/DG3MXBZ4NMSY7ZVIZVIRQEHXZO/events.json","paper":"https://pith.science/paper/DG3MXBZ4"},"agent_actions":{"view_html":"https://pith.science/pith/DG3MXBZ4NMSY7ZVIZVIRQEHXZO","download_json":"https://pith.science/pith/DG3MXBZ4NMSY7ZVIZVIRQEHXZO.json","view_paper":"https://pith.science/paper/DG3MXBZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05200&json=true","fetch_graph":"https://pith.science/api/pith-number/DG3MXBZ4NMSY7ZVIZVIRQEHXZO/graph.json","fetch_events":"https://pith.science/api/pith-number/DG3MXBZ4NMSY7ZVIZVIRQEHXZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DG3MXBZ4NMSY7ZVIZVIRQEHXZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DG3MXBZ4NMSY7ZVIZVIRQEHXZO/action/storage_attestation","attest_author":"https://pith.science/pith/DG3MXBZ4NMSY7ZVIZVIRQEHXZO/action/author_attestation","sign_citation":"https://pith.science/pith/DG3MXBZ4NMSY7ZVIZVIRQEHXZO/action/citation_signature","submit_replication":"https://pith.science/pith/DG3MXBZ4NMSY7ZVIZVIRQEHXZO/action/replication_record"}},"created_at":"2026-05-18T01:33:32.105210+00:00","updated_at":"2026-05-18T01:33:32.105210+00:00"}