{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:77KCUVSGARU6RN5I66D3AAH5I2","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":"38931a9b1673ac84c63d260584b0f81e42763edaf2e0b0aa3196acaae6c09b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-01-25T22:51:56Z","title_canon_sha256":"a75bbefa841d0166fefb3d8887290044f7b96a860f67af14cf02b270bcae7785"},"schema_version":"1.0","source":{"id":"2001.09369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.09369","created_at":"2026-07-05T00:35:58Z"},{"alias_kind":"arxiv_version","alias_value":"2001.09369v1","created_at":"2026-07-05T00:35:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.09369","created_at":"2026-07-05T00:35:58Z"},{"alias_kind":"pith_short_12","alias_value":"77KCUVSGARU6","created_at":"2026-07-05T00:35:58Z"},{"alias_kind":"pith_short_16","alias_value":"77KCUVSGARU6RN5I","created_at":"2026-07-05T00:35:58Z"},{"alias_kind":"pith_short_8","alias_value":"77KCUVSG","created_at":"2026-07-05T00:35:58Z"}],"graph_snapshots":[{"event_id":"sha256:30575a9aea96046c4398115191dfe7d73a5a9bf947e77f684837197c9ab78daa","target":"graph","created_at":"2026-07-05T00:35:58Z","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/2001.09369/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the noisy channel model from coding theory, we wish to detect errors introduced during transmission by optimizing various parameters of the code. Bennett, Dudek, and LaForge framed a variation of this problem in the language of alternating paths in edge-colored complete bipartite graphs in 2016. Here, we extend this problem to the random graph $\\mathbb{G}(n,p)$. We seek the alternating connectivity, $\\kappa_{r,\\ell}(G)$, which is the maximum $t$ such that there is an $r$-edge-coloring of $G$ such that any pair of vertices is connected by $t$ internally disjoint and alternating (i.e. no cons","authors_text":"Andrzej Dudek, Patrick Bennett, Ryan Cushman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-01-25T22:51:56Z","title":"On the number of alternating paths in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.09369","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:3ff05787c8cf99df64695f812f3750c2ccd1f2a89a8ea89974eb0ac9b369b16f","target":"record","created_at":"2026-07-05T00:35:58Z","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":"38931a9b1673ac84c63d260584b0f81e42763edaf2e0b0aa3196acaae6c09b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-01-25T22:51:56Z","title_canon_sha256":"a75bbefa841d0166fefb3d8887290044f7b96a860f67af14cf02b270bcae7785"},"schema_version":"1.0","source":{"id":"2001.09369","kind":"arxiv","version":1}},"canonical_sha256":"ffd42a56460469e8b7a8f787b000fd4696a4328c2c2da20f6ec0473fa9d86003","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffd42a56460469e8b7a8f787b000fd4696a4328c2c2da20f6ec0473fa9d86003","first_computed_at":"2026-07-05T00:35:58.774360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:35:58.774360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o+zU+D2gblRCaTC5TSo4caJXf5Ni0uGGd7U51i4gq7hYTYwzoxb9OQo5hXMaLXyXi0psHc5Km5TPpzdeF3zqAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:35:58.774787Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.09369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ff05787c8cf99df64695f812f3750c2ccd1f2a89a8ea89974eb0ac9b369b16f","sha256:30575a9aea96046c4398115191dfe7d73a5a9bf947e77f684837197c9ab78daa"],"state_sha256":"f92646f2381e62e3714154452eaac194f871669e4dc53c1f032411e9bfe15406"}