{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2ZGW3E5PFCZ22FUA6CTSZZQVDN","short_pith_number":"pith:2ZGW3E5P","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"},"canonical_sha256":"d64d6d93af28b3ad1680f0a72ce6151b6b4cc45e09810cae7869c1cc09d221a8","source":{"kind":"arxiv","id":"1507.03623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03623","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03623v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03623","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"2ZGW3E5PFCZ2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2ZGW3E5PFCZ22FUA","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2ZGW3E5P","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2ZGW3E5PFCZ22FUA6CTSZZQVDN","target":"record","payload":{"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"},"canonical_sha256":"d64d6d93af28b3ad1680f0a72ce6151b6b4cc45e09810cae7869c1cc09d221a8","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"},"source_kind":"arxiv","source_id":"1507.03623","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSXtNjoUDA9MC7wSpvgYEE3guo/SMNGxic6uRLMIYtZwzv2N496vGHglTynjllVL80s2UWIMRiaqKLkpEbavCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:08:41.525300Z"},"content_sha256":"0e5ca112e2ffe555f5787a76be55ed436c722170a101a85ceedc109cd824b07b","schema_version":"1.0","event_id":"sha256:0e5ca112e2ffe555f5787a76be55ed436c722170a101a85ceedc109cd824b07b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2ZGW3E5PFCZ22FUA6CTSZZQVDN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhKDiS7VflrjzKuyi/Czjb1Lwq6e2tRIDqC08+SOjKUM8MeOmhoGnFRCcVdIusTqL5Mfd8BaHzkQ/iTWWFTRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:08:41.525996Z"},"content_sha256":"6a7efe14554b7d1de4d08d932032691d9f098a9b88a8163007873becf6daf1c4","schema_version":"1.0","event_id":"sha256:6a7efe14554b7d1de4d08d932032691d9f098a9b88a8163007873becf6daf1c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/bundle.json","state_url":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T07:08:41Z","links":{"resolver":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN","bundle":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/bundle.json","state":"https://pith.science/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZGW3E5PFCZ22FUA6CTSZZQVDN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2ZGW3E5PFCZ22FUA6CTSZZQVDN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5366332daeb9cf324f565f7f79b791a0f63470e9abe825d586ba9ef48d33c88a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-13T21:21:06Z","title_canon_sha256":"8c1c313f65a22e49eb96ae2cc6ab2d4325dbe92a384e747ac54a39d803e4d290"},"schema_version":"1.0","source":{"id":"1507.03623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03623","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03623v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03623","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"2ZGW3E5PFCZ2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2ZGW3E5PFCZ22FUA","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2ZGW3E5P","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:6a7efe14554b7d1de4d08d932032691d9f098a9b88a8163007873becf6daf1c4","target":"graph","created_at":"2026-05-18T01:36:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Bernardo Llano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-13T21:21:06Z","title":"Two characterizations of simple circulant tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03623","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0e5ca112e2ffe555f5787a76be55ed436c722170a101a85ceedc109cd824b07b","target":"record","created_at":"2026-05-18T01:36:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5366332daeb9cf324f565f7f79b791a0f63470e9abe825d586ba9ef48d33c88a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-13T21:21:06Z","title_canon_sha256":"8c1c313f65a22e49eb96ae2cc6ab2d4325dbe92a384e747ac54a39d803e4d290"},"schema_version":"1.0","source":{"id":"1507.03623","kind":"arxiv","version":1}},"canonical_sha256":"d64d6d93af28b3ad1680f0a72ce6151b6b4cc45e09810cae7869c1cc09d221a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d64d6d93af28b3ad1680f0a72ce6151b6b4cc45e09810cae7869c1cc09d221a8","first_computed_at":"2026-05-18T01:36:57.792215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:57.792215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FNazU8kiAtaC/hOtY3uWRzz8UsTZzweLGgZWN3aXFZtAk5pVRb59LwSYhHwqbCAmaG8ZX8JfP6kJT1wRDNymAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:57.792814Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e5ca112e2ffe555f5787a76be55ed436c722170a101a85ceedc109cd824b07b","sha256:6a7efe14554b7d1de4d08d932032691d9f098a9b88a8163007873becf6daf1c4"],"state_sha256":"4fefbbdda0e726e62488bd52fef18bc86d5a43e936bb7e15cfb525383671dc9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMi/4PIzqinhFfy5XddNxMJ7wt1sppIBRXp+zh8e1yzG6vSEO9GtMu1gCyl3wdFi5qCfjzUELm0zv6qLFxkzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T07:08:41.530131Z","bundle_sha256":"ec99e0cdbc73f15d48e611c5b2ad3ec881ed4aea041b43c1d98211d7abedd8af"}}