{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:W2BZSPF5XECOAF47VLKYGL2BRI","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":"40c0ea10033f64f70b56b1a2cb8806d5b374e8a8d30297cbcec9c64ab49337a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-17T17:03:07Z","title_canon_sha256":"396cf7fce9d9af27da59e691658efb4dd3664dea4289ba99f51f14d3cfbeb924"},"schema_version":"1.0","source":{"id":"2411.11124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11124","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11124v1","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11124","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_12","alias_value":"W2BZSPF5XECO","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_16","alias_value":"W2BZSPF5XECOAF47","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_8","alias_value":"W2BZSPF5","created_at":"2026-07-05T09:36:29Z"}],"graph_snapshots":[{"event_id":"sha256:140e09b120ede55afa1f282cbfb97d7819c2225269c3ae641e5d77a45039959a","target":"graph","created_at":"2026-07-05T09:36:29Z","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/2411.11124/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An edge-coloring of a graph $G$ assigns a color to each edge of $G$. An edge-coloring is a parity edge-coloring if for each path $P$ in $G$, it uses some color on an odd number of edges in $P$. It is a strong parity edge-coloring if for every open walk $W$ in $G$, it uses some color an odd number of times along $W$. The minimum numbers of colors in parity and strong parity edge-colorings of $G$ are denoted $p(G)$ and $\\hat{p}(G)$, respectively.\n  We characterize strong parity edge-colorings and use this characterization to prove lower bounds on $\\hat{p}(G)$ and answer several questions of Bund","authors_text":"Douglas B. West, Peter Bradshaw, Sergey Norin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-17T17:03:07Z","title":"Strong parity edge-colorings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11124","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:9adfce9cee1d5f16d7c68977c233a2a9083866476908a5b582ab1a1ed605ab8c","target":"record","created_at":"2026-07-05T09:36:29Z","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":"40c0ea10033f64f70b56b1a2cb8806d5b374e8a8d30297cbcec9c64ab49337a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-17T17:03:07Z","title_canon_sha256":"396cf7fce9d9af27da59e691658efb4dd3664dea4289ba99f51f14d3cfbeb924"},"schema_version":"1.0","source":{"id":"2411.11124","kind":"arxiv","version":1}},"canonical_sha256":"b683993cbdb904e0179faad5832f418a3f1f72b1702af8d50fe5507b37a163e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b683993cbdb904e0179faad5832f418a3f1f72b1702af8d50fe5507b37a163e4","first_computed_at":"2026-07-05T09:36:29.043898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:36:29.043898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aerd0meCdT34ianurhJzO3P51EqP0NFQ4QOZOksP+hfUvLLPOCIWmrmeEIUCVi6yYgpLCGIoB628nNEqwQakCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:36:29.044352Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.11124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9adfce9cee1d5f16d7c68977c233a2a9083866476908a5b582ab1a1ed605ab8c","sha256:140e09b120ede55afa1f282cbfb97d7819c2225269c3ae641e5d77a45039959a"],"state_sha256":"5eb0574542e423276de353fbd3982314c01c20aebac663f2669148c338d1aa93"}