{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:77KCUVSGARU6RN5I66D3AAH5I2","short_pith_number":"pith:77KCUVSG","schema_version":"1.0","canonical_sha256":"ffd42a56460469e8b7a8f787b000fd4696a4328c2c2da20f6ec0473fa9d86003","source":{"kind":"arxiv","id":"2001.09369","version":1},"attestation_state":"computed","paper":{"title":"On the number of alternating paths in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Patrick Bennett, Ryan Cushman","submitted_at":"2020-01-25T22:51:56Z","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"},"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":"2001.09369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-01-25T22:51:56Z","cross_cats_sorted":[],"title_canon_sha256":"a75bbefa841d0166fefb3d8887290044f7b96a860f67af14cf02b270bcae7785","abstract_canon_sha256":"38931a9b1673ac84c63d260584b0f81e42763edaf2e0b0aa3196acaae6c09b5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:58.774787Z","signature_b64":"o+zU+D2gblRCaTC5TSo4caJXf5Ni0uGGd7U51i4gq7hYTYwzoxb9OQo5hXMaLXyXi0psHc5Km5TPpzdeF3zqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffd42a56460469e8b7a8f787b000fd4696a4328c2c2da20f6ec0473fa9d86003","last_reissued_at":"2026-07-05T00:35:58.774360Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:58.774360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of alternating paths in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Patrick Bennett, Ryan Cushman","submitted_at":"2020-01-25T22:51:56Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.09369","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/2001.09369/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":"2001.09369","created_at":"2026-07-05T00:35:58.774424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.09369v1","created_at":"2026-07-05T00:35:58.774424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.09369","created_at":"2026-07-05T00:35:58.774424+00:00"},{"alias_kind":"pith_short_12","alias_value":"77KCUVSGARU6","created_at":"2026-07-05T00:35:58.774424+00:00"},{"alias_kind":"pith_short_16","alias_value":"77KCUVSGARU6RN5I","created_at":"2026-07-05T00:35:58.774424+00:00"},{"alias_kind":"pith_short_8","alias_value":"77KCUVSG","created_at":"2026-07-05T00:35:58.774424+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/77KCUVSGARU6RN5I66D3AAH5I2","json":"https://pith.science/pith/77KCUVSGARU6RN5I66D3AAH5I2.json","graph_json":"https://pith.science/api/pith-number/77KCUVSGARU6RN5I66D3AAH5I2/graph.json","events_json":"https://pith.science/api/pith-number/77KCUVSGARU6RN5I66D3AAH5I2/events.json","paper":"https://pith.science/paper/77KCUVSG"},"agent_actions":{"view_html":"https://pith.science/pith/77KCUVSGARU6RN5I66D3AAH5I2","download_json":"https://pith.science/pith/77KCUVSGARU6RN5I66D3AAH5I2.json","view_paper":"https://pith.science/paper/77KCUVSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.09369&json=true","fetch_graph":"https://pith.science/api/pith-number/77KCUVSGARU6RN5I66D3AAH5I2/graph.json","fetch_events":"https://pith.science/api/pith-number/77KCUVSGARU6RN5I66D3AAH5I2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77KCUVSGARU6RN5I66D3AAH5I2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77KCUVSGARU6RN5I66D3AAH5I2/action/storage_attestation","attest_author":"https://pith.science/pith/77KCUVSGARU6RN5I66D3AAH5I2/action/author_attestation","sign_citation":"https://pith.science/pith/77KCUVSGARU6RN5I66D3AAH5I2/action/citation_signature","submit_replication":"https://pith.science/pith/77KCUVSGARU6RN5I66D3AAH5I2/action/replication_record"}},"created_at":"2026-07-05T00:35:58.774424+00:00","updated_at":"2026-07-05T00:35:58.774424+00:00"}