{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FVG6KL2IYPBFE4DMFZ5APCG6AS","short_pith_number":"pith:FVG6KL2I","schema_version":"1.0","canonical_sha256":"2d4de52f48c3c252706c2e7a0788de048952e851201d456de8fbd8fe7d800339","source":{"kind":"arxiv","id":"2608.00115","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Mixed Arc-Disjoint Spanning Subdigraphs with Antistrong Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Gregory Gutin, Hui Lei, Jiangdong Ai, Yongtang Shi","submitted_at":"2026-07-31T09:06:50Z","abstract_excerpt":"A trail is antidirected if its arcs alternate between forward and backward. A digraph $D$ is antistrong if, for every ordered pair of distinct vertices $x,y\\in V(D)$, it contains a forward antidirected $(x,y)$-trail. Bang-Jensen, Bessy, Jackson and Kriesell [J. Combin. Theory Ser. B 122 (2017), 68--90] introduced antistrong connectivity and posed two problems concerning mixed arc-disjoint spanning subdigraphs. In the first problem, one seeks an antistrong spanning subdigraph and an arc-disjoint strong spanning subdigraph. In the second, strong connectivity is replaced by the requirement that t"},"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":"2608.00115","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-31T09:06:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7b0f5a66cddd3aadd6af3c0cc5eb89f290d6ffb48b283b20b28edf1a3c0746e7","abstract_canon_sha256":"b9bb192333eac7b8a1523857f26cc4f7d3ec5b2f9493b5cd8ec57a52d228cc58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T00:32:30.799614Z","signature_b64":"8rou/+0S6UvrZ8Vwqlc4GipapunQodIT4uRLfeLQkwXw9AJOWQNlRSo3nbUHTiMDQpf1ajh0xIc3dJsUEDnYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4de52f48c3c252706c2e7a0788de048952e851201d456de8fbd8fe7d800339","last_reissued_at":"2026-08-04T00:32:30.798097Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T00:32:30.798097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Mixed Arc-Disjoint Spanning Subdigraphs with Antistrong Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Gregory Gutin, Hui Lei, Jiangdong Ai, Yongtang Shi","submitted_at":"2026-07-31T09:06:50Z","abstract_excerpt":"A trail is antidirected if its arcs alternate between forward and backward. A digraph $D$ is antistrong if, for every ordered pair of distinct vertices $x,y\\in V(D)$, it contains a forward antidirected $(x,y)$-trail. Bang-Jensen, Bessy, Jackson and Kriesell [J. Combin. Theory Ser. B 122 (2017), 68--90] introduced antistrong connectivity and posed two problems concerning mixed arc-disjoint spanning subdigraphs. In the first problem, one seeks an antistrong spanning subdigraph and an arc-disjoint strong spanning subdigraph. In the second, strong connectivity is replaced by the requirement that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00115","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/2608.00115/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":"2608.00115","created_at":"2026-08-04T00:32:30.799198+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00115v1","created_at":"2026-08-04T00:32:30.799198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00115","created_at":"2026-08-04T00:32:30.799198+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVG6KL2IYPBF","created_at":"2026-08-04T00:32:30.799198+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVG6KL2IYPBFE4DM","created_at":"2026-08-04T00:32:30.799198+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVG6KL2I","created_at":"2026-08-04T00:32:30.799198+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/FVG6KL2IYPBFE4DMFZ5APCG6AS","json":"https://pith.science/pith/FVG6KL2IYPBFE4DMFZ5APCG6AS.json","graph_json":"https://pith.science/api/pith-number/FVG6KL2IYPBFE4DMFZ5APCG6AS/graph.json","events_json":"https://pith.science/api/pith-number/FVG6KL2IYPBFE4DMFZ5APCG6AS/events.json","paper":"https://pith.science/paper/FVG6KL2I"},"agent_actions":{"view_html":"https://pith.science/pith/FVG6KL2IYPBFE4DMFZ5APCG6AS","download_json":"https://pith.science/pith/FVG6KL2IYPBFE4DMFZ5APCG6AS.json","view_paper":"https://pith.science/paper/FVG6KL2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00115&json=true","fetch_graph":"https://pith.science/api/pith-number/FVG6KL2IYPBFE4DMFZ5APCG6AS/graph.json","fetch_events":"https://pith.science/api/pith-number/FVG6KL2IYPBFE4DMFZ5APCG6AS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVG6KL2IYPBFE4DMFZ5APCG6AS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVG6KL2IYPBFE4DMFZ5APCG6AS/action/storage_attestation","attest_author":"https://pith.science/pith/FVG6KL2IYPBFE4DMFZ5APCG6AS/action/author_attestation","sign_citation":"https://pith.science/pith/FVG6KL2IYPBFE4DMFZ5APCG6AS/action/citation_signature","submit_replication":"https://pith.science/pith/FVG6KL2IYPBFE4DMFZ5APCG6AS/action/replication_record"}},"created_at":"2026-08-04T00:32:30.799198+00:00","updated_at":"2026-08-04T00:32:30.799198+00:00"}