{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CKBNGTWEGCZSVK7KABFIWBTSHC","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":"05215ba11ea0584dc4ed92cdadf9015cd0719e0ff9e43c603a26ad94d994ca7f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T10:14:46Z","title_canon_sha256":"50a95450a8d4842a6d407c9d75ce33f50abdff7aeb76520044accdfaba323307"},"schema_version":"1.0","source":{"id":"1908.02050","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02050","created_at":"2026-07-05T01:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02050v5","created_at":"2026-07-05T01:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02050","created_at":"2026-07-05T01:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"CKBNGTWEGCZS","created_at":"2026-07-05T01:22:35Z"},{"alias_kind":"pith_short_16","alias_value":"CKBNGTWEGCZSVK7K","created_at":"2026-07-05T01:22:35Z"},{"alias_kind":"pith_short_8","alias_value":"CKBNGTWE","created_at":"2026-07-05T01:22:35Z"}],"graph_snapshots":[{"event_id":"sha256:064bc6ebbdf882d780d67b8f63379ccaaa8fe2f9ff475806fcbda76021363ccc","target":"graph","created_at":"2026-07-05T01:22:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02050/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of enumerating the $k$-arc-connected orientations of a graph $G$, i.e., generating each exactly once. A first algorithm using submodular flow optimization is easy to state, but intricate to implement. In a second approach we present a simple algorithm with $O(knm^2)$ time delay and amortized time $O(m^2)$, which improves over the analysis of the submodular flow algorithm. As ingredients, we obtain enumeration algorithms for the $\\alpha$-orientations of a graph $G$ in $O(m^2)$ time delay and for the outdegree sequences attained by $k$-arc-connected orientations of $G$ in $O","authors_text":"Kolja Knauer, Petru Valicov, Sarah Blind","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T10:14:46Z","title":"Enumerating $k$-arc-connected orientations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02050","kind":"arxiv","version":5},"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:a8a47f698974dc3d89080675e9215eaf1dd98dcfe27b9d2a60f050142cbbed53","target":"record","created_at":"2026-07-05T01:22:35Z","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":"05215ba11ea0584dc4ed92cdadf9015cd0719e0ff9e43c603a26ad94d994ca7f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T10:14:46Z","title_canon_sha256":"50a95450a8d4842a6d407c9d75ce33f50abdff7aeb76520044accdfaba323307"},"schema_version":"1.0","source":{"id":"1908.02050","kind":"arxiv","version":5}},"canonical_sha256":"1282d34ec430b32aabea004a8b067238bc74d661761d7854033429fba1664efb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1282d34ec430b32aabea004a8b067238bc74d661761d7854033429fba1664efb","first_computed_at":"2026-07-05T01:22:35.911928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:22:35.911928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cOUbhSAyyj3TRYtJpvMdx6iiTigLun75iHCL0zTR+syKzP1N0Kb6rEmkA2aGdWW4W4K4NPKlTltZa3oBt7X/AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:22:35.912349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02050","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8a47f698974dc3d89080675e9215eaf1dd98dcfe27b9d2a60f050142cbbed53","sha256:064bc6ebbdf882d780d67b8f63379ccaaa8fe2f9ff475806fcbda76021363ccc"],"state_sha256":"f20664c99d22b674005e62786d78f4675f5649fc7b68d1d577937df85ed9a66e"}