{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:W74YAQ3TJNXMFONRVYFGZRLU4A","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":"6157897841c0198fd66dd61b196255501b3c465141d4f51f2bf37510a51cef63","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-28T19:05:12Z","title_canon_sha256":"5acb77bacf408ac3f720375820420944e1f39de532960477c2c1952a1c2ba2c5"},"schema_version":"1.0","source":{"id":"2312.17327","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.17327","created_at":"2026-06-04T01:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"2312.17327v4","created_at":"2026-06-04T01:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.17327","created_at":"2026-06-04T01:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"W74YAQ3TJNXM","created_at":"2026-06-04T01:08:24Z"},{"alias_kind":"pith_short_16","alias_value":"W74YAQ3TJNXMFONR","created_at":"2026-06-04T01:08:24Z"},{"alias_kind":"pith_short_8","alias_value":"W74YAQ3T","created_at":"2026-06-04T01:08:24Z"}],"graph_snapshots":[{"event_id":"sha256:777ceec4c2aa6ab14b1ea4ff6b6de82c55914f20b81458d998f5fceb3c6c6fa3","target":"graph","created_at":"2026-06-04T01:08:24Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"If a digraph has a doubly bidirectionally connected pair, then no expansion of it is cactus."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The definitions and prior result from Azuma et al. on cactus-expandability for digraphs without such pairs are taken as given and correctly applied to the converse case."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"If a digraph has a doubly bidirectionally connected pair, then no expansion of it is cactus."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A digraph with a doubly bidirectionally connected pair admits no cactus expansion."}],"snapshot_sha256":"c023de4721a47f2d3df5914d171cbf5ed7dc15eaf3679983bc6f8b931f1ec5f0"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.17327/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Azuma et al.\\ showed that a strongly connected digraph without a doubly bidirectionally connected pair is cactus-expandable. We prove the converse: if a digraph has a doubly bidirectionally connected pair, then no expansion of it is a cactus digraph. Combined with the theorem of Azuma et al., this yields a characterization of strongly connected cactus-expandable digraphs.","authors_text":"Hiroki Kodama","cross_cats":[],"headline":"A digraph with a doubly bidirectionally connected pair admits no cactus expansion.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-28T19:05:12Z","title":"Characterization of cactus-expandable digraphs via doubly bidirectionally connected pairs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.17327","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-24T04:53:00.557350Z","id":"9c911906-9d51-44fa-9628-8295eca1de86","model_set":{"reader":"grok-4.3"},"one_line_summary":"If a digraph has a doubly bidirectionally connected pair, then no expansion of it is cactus.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A digraph with a doubly bidirectionally connected pair admits no cactus expansion.","strongest_claim":"If a digraph has a doubly bidirectionally connected pair, then no expansion of it is cactus.","weakest_assumption":"The definitions and prior result from Azuma et al. on cactus-expandability for digraphs without such pairs are taken as given and correctly applied to the converse case."}},"verdict_id":"9c911906-9d51-44fa-9628-8295eca1de86"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:324e1e1e5cd0f035edbe55aec907dfe66f8b33477f96e2bbad49f97a76d89f18","target":"record","created_at":"2026-06-04T01:08:24Z","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":"6157897841c0198fd66dd61b196255501b3c465141d4f51f2bf37510a51cef63","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-28T19:05:12Z","title_canon_sha256":"5acb77bacf408ac3f720375820420944e1f39de532960477c2c1952a1c2ba2c5"},"schema_version":"1.0","source":{"id":"2312.17327","kind":"arxiv","version":4}},"canonical_sha256":"b7f98043734b6ec2b9b1ae0a6cc574e01e58e729152f87d6773f82d89c70d7d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7f98043734b6ec2b9b1ae0a6cc574e01e58e729152f87d6773f82d89c70d7d4","first_computed_at":"2026-06-04T01:08:24.741280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:08:24.741280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"isJG0tQ7J1+gdl/BeMzlWj0+7ZyHNacQ2vGIsOI/Evcv3np5DKQh/88bvzrQ9KpeB7Kycf27dZ+ZiKYNFzKgAg==","signature_status":"signed_v1","signed_at":"2026-06-04T01:08:24.742169Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.17327","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:324e1e1e5cd0f035edbe55aec907dfe66f8b33477f96e2bbad49f97a76d89f18","sha256:777ceec4c2aa6ab14b1ea4ff6b6de82c55914f20b81458d998f5fceb3c6c6fa3"],"state_sha256":"a3f498a6e66834133aed8cc5b4190d1a5c4483910b93dedb5b6f37e60675980e"}