{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2ZGW3E5PFCZ22FUA6CTSZZQVDN","short_pith_number":"pith:2ZGW3E5P","schema_version":"1.0","canonical_sha256":"d64d6d93af28b3ad1680f0a72ce6151b6b4cc45e09810cae7869c1cc09d221a8","source":{"kind":"arxiv","id":"1507.03623","version":1},"attestation_state":"computed","paper":{"title":"Two characterizations of simple circulant tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernardo Llano","submitted_at":"2015-07-13T21:21:06Z","abstract_excerpt":"The \\textit{acyclic disconnection} $\\overrightarrow{\\omega }(D)$ (resp. the \\textit{directed triangle free disconnection } $\\overrightarrow{\\omega }_{3}(D)$) of a digraph $D$ is defined as the maximum possible number of connected components of the underlying graph of $D\\setminus A(D^{\\ast })$ where $D^{\\ast }$ is an acyclic (resp. a directed triangle free) subdigraph of $D$. In this paper, we generalize some previous results and solve some problems posed by V. Neumann-Lara (The acyclic disconnection of a digraph, Discrete Math. 197/198 (1999), 617-632). Let $\\overrightarrow{C}_{2n+1}(J)$ be a "},"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":"1507.03623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-13T21:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"8c1c313f65a22e49eb96ae2cc6ab2d4325dbe92a384e747ac54a39d803e4d290","abstract_canon_sha256":"5366332daeb9cf324f565f7f79b791a0f63470e9abe825d586ba9ef48d33c88a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:57.792814Z","signature_b64":"FNazU8kiAtaC/hOtY3uWRzz8UsTZzweLGgZWN3aXFZtAk5pVRb59LwSYhHwqbCAmaG8ZX8JfP6kJT1wRDNymAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d64d6d93af28b3ad1680f0a72ce6151b6b4cc45e09810cae7869c1cc09d221a8","last_reissued_at":"2026-05-18T01:36:57.792215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:57.792215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two characterizations of simple circulant tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernardo Llano","submitted_at":"2015-07-13T21:21:06Z","abstract_excerpt":"The \\textit{acyclic disconnection} $\\overrightarrow{\\omega }(D)$ (resp. the \\textit{directed triangle free disconnection } $\\overrightarrow{\\omega }_{3}(D)$) of a digraph $D$ is defined as the maximum possible number of connected components of the underlying graph of $D\\setminus A(D^{\\ast })$ where $D^{\\ast }$ is an acyclic (resp. a directed triangle free) subdigraph of $D$. In this paper, we generalize some previous results and solve some problems posed by V. Neumann-Lara (The acyclic disconnection of a digraph, Discrete Math. 197/198 (1999), 617-632). Let $\\overrightarrow{C}_{2n+1}(J)$ be a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03623","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":"1507.03623","created_at":"2026-05-18T01:36:57.792324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03623v1","created_at":"2026-05-18T01:36:57.792324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03623","created_at":"2026-05-18T01:36:57.792324+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZGW3E5PFCZ2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZGW3E5PFCZ22FUA","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZGW3E5P","created_at":"2026-05-18T12:29:02.477457+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/2ZGW3E5PFCZ22FUA6CTSZZQVDN","json":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN.json","graph_json":"https://pith.science/api/pith-number/2ZGW3E5PFCZ22FUA6CTSZZQVDN/graph.json","events_json":"https://pith.science/api/pith-number/2ZGW3E5PFCZ22FUA6CTSZZQVDN/events.json","paper":"https://pith.science/paper/2ZGW3E5P"},"agent_actions":{"view_html":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN","download_json":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN.json","view_paper":"https://pith.science/paper/2ZGW3E5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03623&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZGW3E5PFCZ22FUA6CTSZZQVDN/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZGW3E5PFCZ22FUA6CTSZZQVDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/action/storage_attestation","attest_author":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/action/author_attestation","sign_citation":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/action/citation_signature","submit_replication":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/action/replication_record"}},"created_at":"2026-05-18T01:36:57.792324+00:00","updated_at":"2026-05-18T01:36:57.792324+00:00"}